{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"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":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"Codegen::compile_asmir (cyclomatic 209): Codegen::compile_asmir has cyclomatic complexity 209 (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":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd2b3ad1b0c9322e068a3c1f9810449524b93508662eda7faa9da6e07cb2b9"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::stream_convert (cyclomatic 205): monoruby::value::rvalue::string::transcode::stream_convert has cyclomatic complexity 205 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":6310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b16f51d4d7a92a8aab857f2600627f57eea9254f36358202dd4a6dd18b6eaa4"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode_bytes_with_opts (cyclomatic 197): monoruby::value::rvalue::string::transcode_bytes_with_opts has cyclomatic complexity 197 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3d20d32b0535fa9a1383ba7b3285751985ad223da5fad94f00f7514e36895a"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::format_by_args (cyclomatic 177): Executor::format_by_args has cyclomatic complexity 177 (threshold 15). Of this number, 168 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb995772f2e217885867e9fba2755aff09b8b4ba8465247ca6d7bcb1e86913f"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::compile_instruction_inner (cyclomatic 149): JitContext::compile_instruction_inner has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"14efd5dc977fa1827b5982e7060b1708cfb00b64a1705b2833469e8ba8b155b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowerer::lower_node (cyclomatic 142): Lowerer::lower_node has cyclomatic complexity 142 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::parser::prism_backend::node_kind_name (cyclomatic 145) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af0065ba5e335820203024f3064026951b8af8a35e9d88739f368378baed0a2"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::pack (cyclomatic 129): monoruby::value::rvalue::string::pack::pack has cyclomatic complexity 129 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8d8a26fcdcaa995d1e28595bb88d802b32b61e7068fb1db553b50c7b9e831f"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::encode_linst (cyclomatic 125): Codegen::encode_linst has cyclomatic complexity 125 (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":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa8928f27300d7336353718bb03ffa3ebbef2a8775d9c5f8372bd6487fc28ad"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::unpack (cyclomatic 114): monoruby::value::rvalue::string::pack::unpack has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05ab6f4ac8cbfdcb2edad45275fc2c4f132d5bb908762bac20c56229abc9cbd"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::encode_linst (cyclomatic 113): Codegen::encode_linst has cyclomatic complexity 113 (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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7928ee5cde84f8642a87cf00011690c311bbf681afdc5f7c836f35e61d6d38"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::compile_method_call (cyclomatic 109): JitContext::compile_method_call has cyclomatic complexity 109 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ab67e7772575e2e97c0337decc4d1725f128bfbea894fc529fbd2ac87f3a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoding::try_from_str (cyclomatic 109): Encoding::try_from_str has cyclomatic complexity 109 (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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f53ea3d5fa0e0e642162dde858f3141ce5e97cc74e364ccc0ecee71864eb87e"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_expr_inner (cyclomatic 106): BytecodeGen::gen_expr_inner has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a3e9cd7c2ca868164af85ec6514cce9666d1ce1573ad6cfd854aa95812069"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::split (cyclomatic 94): monoruby::builtins::string::split has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c282b9bf8b9cc11e808b84118fd6cf9d50e502711e8e30410bfd6ce8f57fd"}},{"ruleId":"D1","level":"warning","message":{"text":"TraceIr::from_pc (cyclomatic 91): TraceIr::from_pc has cyclomatic complexity 91 (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":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b53adbc761960251533a02dc22e84bcc38c1fe4ece810a5a0338b0c966997"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::inst_to_bc (cyclomatic 87): BytecodeGen::inst_to_bc has cyclomatic complexity 87 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d0b5b4ff4cbb0c9adcc2b604897d5d24d337aa1403f4566043515e7854af2c"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::marshal::marshal_dump_value (cyclomatic 85): monoruby::builtins::marshal::marshal_dump_value has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"352ae69ad25bf53101f404f3eff17673cc9ea2cfc8be662f4a9d42c9cc298048"}},{"ruleId":"D1","level":"warning","message":{"text":"TraceIr::format (cyclomatic 82): TraceIr::format has cyclomatic complexity 82 (threshold 15). Of this number, 80 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa2d5a42c90914d291f9d7e2edf8e603869cd753d1a1f6cd6540074cf1e5a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::main (cyclomatic 82): monoruby::main has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f96939c4959666a3bde56b8ce63ccc620a8bd8fbeee045cc0fe33cba50434"}},{"ruleId":"D1","level":"warning","message":{"text":"Socket.tcp_with_fast_fallback (cyclomatic 78): Socket.tcp_with_fast_fallback has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c04e4ebb8f8e3ba3facc09d0fb4a40a5a6e009526090b34ad6a4aa979c82dca"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::cell_decode (cyclomatic 76): monoruby::value::rvalue::string::transcode::cell_decode has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f144a32a82a3ff430a58afda65ccf5802519342961a2f2a6de661280673acc"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::range::range_include_impl (cyclomatic 74): monoruby::builtins::range::range_include_impl has cyclomatic complexity 74 (threshold 15). Of this number, 70 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"0776c8c4c39e299bceb8fadbc0d2f50d7ecc49009a8b0aa436273fc1da7a9bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::prof::report (cyclomatic 74): monoruby::prof::report has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"577dc0abe678f05b365eeaf4a33989319fcc39ec09166ad5d7bb0c86836b5c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Strptime.__exec0 (cyclomatic 71): Strptime.__exec0 has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f174ff4c22a3763c642516089fb4594e6e5e03400a36ec4586635c8a6bbc8626"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractState::set_arguments (cyclomatic 68): AbstractState::set_arguments has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"182bd92de9d3945d79d76354da05baf63c2f6404d265309d3cbbb1dd1e5d88c5"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::parse_template (cyclomatic 68): monoruby::value::rvalue::string::pack::parse_template has cyclomatic complexity 68 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7529d005526d8f3b69c1c018328c05b3827e73e94c3b113d77491902e150b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_store_expr (cyclomatic 63): BytecodeGen::gen_store_expr has cyclomatic complexity 63 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ed8e356488db9e58399585445e7d47ef57f3a0bd82d9b7b0a1db1a4b93f91e"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::check_defined (cyclomatic 59): BytecodeGen::check_defined has cyclomatic complexity 59 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8631d736d882dfc31b6b3c258aaa527a119a11e0507d8ef71a43db60e6311776"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::spawn::parse_exec_args (cyclomatic 59): monoruby::builtins::spawn::parse_exec_args has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9163023475cc9c47d047ec95eb8b325c0d5f5090c1181c6e09f688c98206311"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocess::unescape_nonascii (cyclomatic 57): Preprocess::unescape_nonascii 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":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"34827f6debbb046bfb3d8ec70905dc05a905a359b96674afb8f22f51fa4b529f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_select (cyclomatic 57): monoruby::builtins::io::io_select 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a272d072801171f1e38332d9a080a66800bad57c857e018972276055272eee9f"}},{"ruleId":"D1","level":"warning","message":{"text":"BigDecimal.power (cyclomatic 56): BigDecimal.power has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7ad3026ae1f6288f83bf14d1b5ed4a0d6601c8deffa30c2bdf4db46f3676c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Plain::node (cyclomatic 54): Plain::node has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2d7451a7acc7605d2ff0e9ed6e120c59866062799124d0a09d95affe16466e"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_copy_stream (cyclomatic 53): monoruby::builtins::io::io_copy_stream has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6806}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3fc9eb45913ef98ee5cb0e4e1a9be090c0f5cf2a6bc7fee69166ef247f39fd"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::level_down (cyclomatic 50): BytecodeGen::level_down has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f4e0cfe82e5ee5b5367e9b29890bc5d31a452e3847d5079c5196b51baa3c34"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_init_from_fd (cyclomatic 50): monoruby::builtins::io::io_init_from_fd has cyclomatic complexity 50 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"52aea2df81f9d30cccd2be1ff3af92afbb305bb3c8ff657d46f716a630a5c804"}},{"ruleId":"D1","level":"warning","message":{"text":"Numeric.step (cyclomatic 49): Numeric.step has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e520c9d7556dc71add0800601808bfdc266e599976ad798526f74bc403d5f5"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_popen (cyclomatic 48): monoruby::builtins::io::io_popen has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"598f67315d16770de88ae1f29bb7d050b240da9700075c68773d22627da2c457"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::op::integer_index1 (cyclomatic 47): monoruby::executor::op::integer_index1 has cyclomatic complexity 47 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f08d274af8d16ceee4ff00b7f1f286b00302ce39114c91dcc176d4427233a"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractFrame::bridge (cyclomatic 44): AbstractFrame::bridge 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":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2be92ccbab16b6a08acbb6f91a2fa9222dec515bf3b1d926e38fea5653e9b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::copy_stream_fds (cyclomatic 44): monoruby::builtins::io::copy_stream_fds has cyclomatic complexity 44 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":7168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4a141c93f53251ca3d472eb95a9f89c18580aece6a03c7b27e8cb9c6c36449"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::time::directive_core (cyclomatic 44): monoruby::builtins::time::directive_core has cyclomatic complexity 44 (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":"monoruby/src/builtins/time.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b9a037169753d33c1df6958070fd22dd0dcb6c1c9034b3d212ddccd069ff4"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::loop_float_candidates (cyclomatic 43): JitContext::loop_float_candidates has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1630c4f4508c62a78fd6d6cf9f9b17ac6b79048bdb28c01c6c25296ce638b"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::from_ast_inner (cyclomatic 41): Value::from_ast_inner has cyclomatic complexity 41 (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":"monoruby/src/value.rs"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"90886b52506e6d9d9d35299fb6d4756d2adbcacaf48b2429b50c6219a0013a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::encoding::converter_primitive_convert (cyclomatic 41): monoruby::builtins::encoding::converter_primitive_convert has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::builtins::encoding::enc_name_to_const (cyclomatic 104) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17df6b3fce674cceaa1dd0df715cd0f046f96c9915826d08ef2e4ed529c1ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.__do_parse (cyclomatic 41): Parser.__do_parse has cyclomatic complexity 41 (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":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9223807e981959005f0c1b90f27a0e01398a9abd8dd0b4543eed9b73e15442ba"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::slice_ (cyclomatic 40): monoruby::builtins::string::slice_ 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4c5f99d423655c2f4b2f4a9072c7f32a8ad602c0c0ffcd1c2434d2496599b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::parse_short_cluster (cyclomatic 40): monoruby::parse_short_cluster has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57c7e2e8edab4df921cb0b9c64bd4324e9353391e6b5d3a2b71ff4785ad589b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::args::set_callee_frame_arguments (cyclomatic 39): monoruby::codegen::runtime::args::set_callee_frame_arguments has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606a9d66d84e7b922e0580c7c0b8c3020d17d40a925258217bacd27dec54061"}},{"ruleId":"D1","level":"warning","message":{"text":"Loop.__ev_run (cyclomatic 39): Loop.__ev_run has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/cool.io_ext.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffccc84f04bfea3c6673ba12987bc008d539cdd065063739f7d7275212a506f5"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::compile_binary (cyclomatic 38): JitContext::compile_binary has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c45684fbeb5421b4a38ad253e0c0271725d27bab35f32a08dc4e5a4aa7afc4a"}},{"ruleId":"D1","level":"warning","message":{"text":"markly_native::to_tuple (cyclomatic 37): markly_native::to_tuple has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e505a123f3051db2fca8547528a4de92f23d79c155fb6c888c47f30f60a4430f"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::record_pre_fixpoint_outer_floats (cyclomatic 37): JitContext::record_pre_fixpoint_outer_floats has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92db5203c04e908d5275b3b286b1e7fee3b02fd101415e785c555855075f86e"}},{"ruleId":"D1","level":"warning","message":{"text":"markly_native::build (cyclomatic 36): markly_native::build has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9543de474c8a0b90225ce0ba835c300e2e2e52048a4d8248de84fecdf046c6"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::file::open_impl (cyclomatic 36): monoruby::builtins::file::open_impl has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c73bd305c7908ccca822073bff9e9f19013d9a6bf1c3b1460aa96bd78abfd"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::parse_undump (cyclomatic 35): monoruby::builtins::string::parse_undump 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":12983}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97183a912097d9383affc4ffd979fb2474fd1376f4161c4ab19c3303bb6a3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::time::parse_time_string (cyclomatic 34): monoruby::builtins::time::parse_time_string has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c89e5b1668604adda9203e6f575684a7036446b780e882837d10c977542bf03"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_method_call (cyclomatic 33): BytecodeGen::gen_method_call has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"044ba1069d31e3abd6bfc9223a5f1b53fd03bd2e57d7474ce07f1add4e8635ba"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::system (cyclomatic 33): monoruby::builtins::kernel::system has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3560}}}],"partialFingerprints":{"codehealthFindingId/v1":"92194e96dd7bed42ca073d43622c3e9155b49bb2dac3335d76e0c4327b66d021"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::region_summary (cyclomatic 32): JitContext::region_summary 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":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1178cf4f5b6533943ec3c18e8f9789bf0b778c5b4f7819c07dcc99a88d2797"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::gen_machine_code_inner (cyclomatic 32): Codegen::gen_machine_code_inner 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":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"626c92b25fbe8aaae4742c39fe83bfabd4087afbaaa84b4b9578ada4313bafed"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoding::classify (cyclomatic 32): Encoding::classify 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e787f2944f4c533c31cf6b3b54a9ba9190c305ad8c54b2d611d10d991671e5"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::encoding::handle_xml_option (cyclomatic 32): monoruby::builtins::encoding::handle_xml_option has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::builtins::encoding::enc_name_to_const (cyclomatic 104) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f39aedab56a8379fd8fdba8e5022a36f7f456b1b80feb70fb0683a750ed03f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::read_escaped_byte (cyclomatic 32): monoruby::value::rvalue::regexp::read_escaped_byte 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. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a33c5c309b5b0b9759853d2840ed57a144f500dbbe730afc97c63b3300e976"}},{"ruleId":"D1","level":"warning","message":{"text":"Enumerable.minmax (cyclomatic 32): Enumerable.minmax 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8de3e6c1f2bbac59ccbb3548afb9641d625844cc59e2c02146ddea44a3fc43"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.__range_step_numeric (cyclomatic 32): Range.__range_step_numeric 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":"monoruby/builtins/range.rb"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"8966afed16e7a1355b3a6ab54e5b5d558a62b50dd0f80277cb064641195099f8"}},{"ruleId":"D1","level":"warning","message":{"text":"nokogiri_native::node::relink_namespace (cyclomatic 31): nokogiri_native::node::relink_namespace has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"23af9ec7da3d0916630aa3f502650c827cfe7a5b9a90aa9e728be7ce0457ee13"}},{"ruleId":"D1","level":"warning","message":{"text":"MarshalReader::read_user_object (cyclomatic 31): MarshalReader::read_user_object has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a9c63d7d8f89334ab855c1b183dec49964548976bdaa417413c509369137d1"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::index_assign (cyclomatic 31): monoruby::builtins::string::index_assign has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef97ac46331595af123370ee03196d220bbab7895edce6c13d8c06e0aebf362"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::inline_class_new (cyclomatic 30): JitContext::inline_class_new has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c0a2abc41d6c0287b1542a9bbaa37a00148236eb93b3211c9edceafcc49a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::incoming_context (cyclomatic 30): JitContext::incoming_context has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a390bfb484f6286270e332aa4ae37932abfcc757c21b7e85ebbae8421c595b8"}},{"ruleId":"D1","level":"warning","message":{"text":"IoInner::getline (cyclomatic 30): IoInner::getline has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"67888275f824f37dca24f51eb3e03bd23bbba1633907529322315199491f5292"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::time::preprocess_strftime (cyclomatic 30): monoruby::builtins::time::preprocess_strftime has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b041e23a220a82f7956c2e00bcf98509b6cd0f05ebd0919b192612d4b22f5c9"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::expand_array (cyclomatic 30): monoruby::codegen::runtime::expand_array has cyclomatic complexity 30 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"386583aca4fff9dd716c756e48e97a8ef038653f01b53d46d205385c02000b79"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.drawFlame (cyclomatic 30): aobench-cpu.html.drawFlame has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c16b1175ce3869257a0fbe57f0ffd838c8a56a3e2b5578c11da54a12938211"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.drawFlame (cyclomatic 30): optcarrot.html.drawFlame has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fb78a98f42951233ac2053940c01ed91c019960a5e2f00e04d922483cf414d"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.drawFlame (cyclomatic 30): viewer.html.drawFlame has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2851211c9b996d860d15378f385484eb17dfd2503ce6095e4b58d20271a1d1"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::numeric::float::round (cyclomatic 29): monoruby::builtins::numeric::float::round has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0df5b8b07e531b7ec9ce19ac2193659679ecca6f9720c54bd935acbce49a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::set::divide (cyclomatic 29): monoruby::builtins::set::divide has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8ade515441823f9ec34a4e3ff43d95cfce4eed545de663ee3627e918e9a59b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::pow_values_raw (cyclomatic 29): monoruby::executor::op::binary_ops::pow_values_raw has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3c37fbecf10b752d9ed254348f2f059646d9ea8b51ee32c90d77e43dc83a03"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.viewFlame (cyclomatic 29): aobench-cpu.html.viewFlame has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 930, updateCrumbs, a function literal at line 944, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"134e72db627a9204d7e695490659bd540632c92808a753073f575e0dc4dd15d7"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.viewFlame (cyclomatic 29): optcarrot.html.viewFlame has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 930, updateCrumbs, a function literal at line 944, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aaaad5969012259d5aa8940f260c2f1a015f1983b53ca5944ecdbc78b61172"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.viewFlame (cyclomatic 29): viewer.html.viewFlame has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 930, updateCrumbs, a function literal at line 944, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ec150af42abe14904aaad2ce5947ce911a62fb183fc6de9870d632cb6177c1"}},{"ruleId":"D1","level":"warning","message":{"text":"MarshalReader::read_ivar_wrapped (cyclomatic 28): MarshalReader::read_ivar_wrapped 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":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbce14a9da15c5645bbb019548326b70f580f4fc416da03295022ea3a976a99"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::take_ex_obj (cyclomatic 28): Executor::take_ex_obj 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":"monoruby/src/executor.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b528479d93401d52cce745166a52c936167f9e13ed3caaf81dc59b5341fdbe7"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowerer::lower_parameters (cyclomatic 28): Lowerer::lower_parameters 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. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::parser::prism_backend::node_kind_name (cyclomatic 145) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5092}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3bef14892e6935989efe393431df0266024bc1b7bcf3e72a95604a7aeac77f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::array::sample_inner (cyclomatic 28): monoruby::builtins::array::sample_inner 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":"monoruby/src/builtins/array.rs"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"5855629dfa0cde0b79be4dfe42313d19c6f23acbff8889eb08eb849e715bbd89"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::spawn::child_exec (cyclomatic 28): monoruby::builtins::spawn::child_exec 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":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"984c4f4c565c7e678f7e921b33979788dba7d019e0a4f0887844f59dbdf914e7"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::index (cyclomatic 28): monoruby::builtins::string::index 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"694142d26cca7bbfd5afc64c82359aa36532ffb01193fd1f535a3bf7939aa835"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::range_fold (cyclomatic 28): monoruby::codegen::runtime::range_fold 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":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bcb155315b6079dde4417247dd758aaf21456080f488a16ee4ea9253fb4ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.step (cyclomatic 28): Range.step 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":"monoruby/builtins/range.rb"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6bcafec2cb3390e8c86298fc8a6c47dc4489a10ca24a2aa456a8d5ebc02284"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_begin (cyclomatic 27): BytecodeGen::gen_begin 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":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e42ab6755baf706745b93a0d8a9d4f0d831b0c7c214c27979a11b1e7af287"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::require (cyclomatic 27): Executor::require 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":"monoruby/src/executor.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea035154ad076aca2375e70570997e2bbcf4a0089d7e95ada079a8bb57ab89a"}},{"ruleId":"D1","level":"warning","message":{"text":"Globals::require_lib (cyclomatic 27): Globals::require_lib 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":"monoruby/src/globals/require.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79eaaebda88883adea40f712f9a420e5be13c5ddbdbe3228ff9b76da430a929"}},{"ruleId":"D1","level":"warning","message":{"text":"IoInner::getline_universal (cyclomatic 27): IoInner::getline_universal 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":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b242e3a5b3b9577e551df867f0442806829dd4262ce2f85277586cf8d308a6"}},{"ruleId":"D1","level":"warning","message":{"text":"RStringInner::inspect (cyclomatic 27): RStringInner::inspect has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Encoding::name (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c891e31f373a61f104f9a76f227abd4079c418dde3047e5127bff1702586276e"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::bytesplice (cyclomatic 27): monoruby::builtins::string::bytesplice 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":8000}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f44d2f24abfc54941e88419fe91452414832acb216f96114b8b88c34760f95"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::struct_class::initialize (cyclomatic 27): monoruby::builtins::struct_class::initialize 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":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"456637ebf59c48e1f07af064a435c06955a7ee65203e3d94504316dcd253c886"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::may_consume_virtual (cyclomatic 26): JitContext::may_consume_virtual has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcea7342a6d152374bba723edb2fa891cdefb7a7fae49af4f582e7882e0227dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::describe_func (cyclomatic 26): Store::describe_func has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"214fc1d5a066755d72be4d9872f46a3f7a0dad2ebd3287205997ebc95e55599b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::index_op (cyclomatic 26): monoruby::builtins::arithmetic_sequence::index_op has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d628333e5b51aad6510ea0f7e20e13eebd22ffeff2858ae77f232f1d0978531"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::array::fill (cyclomatic 26): monoruby::builtins::array::fill has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8f6ff06cdc6ef13329fe014c5e164e86595b598dcb53f16078b22d1365e4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io_buffer::coerce_int_for_type (cyclomatic 26): monoruby::builtins::io_buffer::coerce_int_for_type has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"402829d6530ee6aaa50ba5b73dc0433103c32816206c4b3546021c02b2f711d8"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::kernel_integer_inner (cyclomatic 26): monoruby::builtins::kernel::kernel_integer_inner has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a6168e7ce892c4aaca09424020ec7e9967ad92e6041ea678baa766abc2cf07"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::jit_module::handle_error (cyclomatic 26): monoruby::codegen::jit_module::handle_error has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c9f87094ad447fce0f0db472fcdb0d98292c0dcffd2cf242f14494ba686131"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.__range_step_size (cyclomatic 26): Range.__range_step_size has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6b3a17f4ddfe91f2eb416a8365f14f278541e638b16b390f7c2559f36eb357"}},{"ruleId":"D1","level":"warning","message":{"text":"XPathVisitor.visit_function (cyclomatic 26): XPathVisitor.visit_function has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/css/xpath_visitor.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"274f203b6f4efa5b1e4cfb7c9e676fd4d7b0667a850cb806045c829743c0fcea"}},{"ruleId":"D1","level":"warning","message":{"text":"psych_native::yaml_emit (cyclomatic 25): psych_native::yaml_emit has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/psych/src/lib.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"222cb967c46cfed3e928347e858b67531c143162d15d1d203ff00fe28133a21e"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractFrame::decide_join (cyclomatic 25): AbstractFrame::decide_join has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/join.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe623b31e5c7978f6849e4ded8692fa8cd17aeaffc63ec4bce80b141e9a1e06"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::gen_asm (cyclomatic 25): Codegen::gen_asm has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AsmInst::dump (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24d7566278211a0b2f7a4414b0eac361294985e06a0612bccdfb12807ce9c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::eq_values_pure (cyclomatic 25): Executor::eq_values_pure has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d511b4e844ff30087e09a48490e0241001b8da8cb3b81ca0fcc7df68f28cf7ee"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexpInner::tos_bytes (cyclomatic 25): RegexpInner::tos_bytes has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a64272bc8d51444fffa3c4a3a0fdeeb6b8093cbfbd673e16eb5b4ceb173b1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::dir::traverse_dir (cyclomatic 25): monoruby::builtins::dir::traverse_dir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf06f87c6eb5ba62b839a1826df152deb73c23e2c760a9efcab9ea014427c05f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_class_read (cyclomatic 25): monoruby::builtins::io::io_class_read has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fa5010f4d08fcfa13bfa09db9e385f17c6c20adcabb71fcd8eca9009e1b030"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_reopen_path (cyclomatic 25): monoruby::builtins::io::io_reopen_path has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f476f9a4ab186482a0a446c8980d9204057b66e1c50600f6744c8b445d98f25"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::proc::build_parameters (cyclomatic 25): monoruby::builtins::proc::build_parameters has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"91edbb65240190c249031de684d730c511d71235437981f2360fba9718009b19"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::byteslice (cyclomatic 25): monoruby::builtins::string::byteslice has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7863}}}],"partialFingerprints":{"codehealthFindingId/v1":"69293d0a6db08ed3542373759ed4dcd7f922326961005d09678dcc408208ea63"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::jis_direct_one (cyclomatic 25): monoruby::value::rvalue::string::transcode::jis_direct_one has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::value::rvalue::string::transcode::encoding_to_rs (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2049bd9ee69c4b0bc36d0715811fed6dde005a31068f94b737a1aa2310cb11"}},{"ruleId":"D1","level":"warning","message":{"text":"String.upto (cyclomatic 25): String.upto has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/string.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd13b2c9fb6d34fe0617bf576d77b7e0d59234f873234ca2b6bef712ca188fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.__lex_string (cyclomatic 25): Parser.__lex_string has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5384b58a8bf81d58f114c78f7aa30c920515034ac63bc0d5a7371f6cb453cb"}},{"ruleId":"D1","level":"warning","message":{"text":"nokogiri_native::node::reparent (cyclomatic 24): nokogiri_native::node::reparent 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":"ext/nokogiri/src/node.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbe4260dd3a8ca192c6a85809266d273ad481b0d964dccf1dce49a90ac3f4dc"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexpInner::replace_all_hash_plain (cyclomatic 24): RegexpInner::replace_all_hash_plain has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"095cd97ff7c4f1e9aad7ef541726944c4d621340418a71ead00988473249ee12"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexpInner::expand_backref (cyclomatic 24): RegexpInner::expand_backref has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba777436e2dcb3b78d9c1ae9ba29b2358d9d86fd20a92653400ad33a3e23d767"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::file::file_join (cyclomatic 24): monoruby::builtins::file::file_join has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"26522b44c1b215bb386f762fb18fa4cfd7d7bd670e8b6a1c8c6edc8f9f47c454"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::set_encoding (cyclomatic 24): monoruby::builtins::io::set_encoding 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":5777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6adef9d1cedcda725b69baad53095efea5e3426217dce9e95f8db6cbce0ce66"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::kernel_complex (cyclomatic 24): monoruby::builtins::kernel::kernel_complex 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"462e307810fc5a02cf55992596b44cf3ce20892f27f0e64fd0f8a699602fd0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::str_next (cyclomatic 24): monoruby::builtins::string::str_next 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"485213e1b8140381f762f9274b9b27cee8b54c426823f00952a8b38dd69276a5"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::byterindex (cyclomatic 24): monoruby::builtins::string::byterindex 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":6601}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5a58deb363fa830c7c583dca5f4b8df3d2537c80235e8b33fa4ac6bac339a5"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::bytecodegen::defined::defined_str (cyclomatic 24): monoruby::bytecodegen::defined::defined_str has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42dd1c58d875cfab8a2bff0bdc33325161d6bdd90b75a4e35db9a00cd266546"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::parse_long (cyclomatic 24): monoruby::parse_long has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6eb0f799539e88c483b93ec4eff2cb7bf95133bf9df2877322e597652aabaa"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::expand_unicode_braces (cyclomatic 24): monoruby::value::rvalue::regexp::expand_unicode_braces has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fe7f77233904109fcefd93ef71669e667a6d5686cb27d25b7b3985b0783d33"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticSequence.each (cyclomatic 24): ArithmeticSequence.each 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":"monoruby/builtins/arithmetic_sequence.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd0d53fecbd1e5492d5bbd0051a6a7768a68c46a94bee030ca9dbd7decd381e"}},{"ruleId":"D1","level":"warning","message":{"text":"Window._pump_events (cyclomatic 24): Window._pump_events 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":"monoruby/gem/gosu.rb"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f619ccca4d8372e803f3350aaceb8ec66298b6017f1df75bfce558f77db566"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.__lex_number (cyclomatic 24): Parser.__lex_number 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":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b72d25c84201477c6e27023aedc67f670585722b5a795342d31a04c7cbe89e6"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::settle_virtuals (cyclomatic 23): JitContext::settle_virtuals has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3de90f0259b181ed89879c9f9f77cc30355711b5a34588d407267920cc308ca"}},{"ruleId":"D1","level":"warning","message":{"text":"SlotAnalysis::new (cyclomatic 23): SlotAnalysis::new 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":"monoruby/src/codegen/jitgen/slot_analysis.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f360cc76fcb79617f177db863ce0ac8f92b7afd4674494856a116e6d912ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::dir::process_glob_pattern (cyclomatic 23): monoruby::builtins::dir::process_glob_pattern 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":"monoruby/src/builtins/dir.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a2ee26e9624580a6e6182e084192eae8c07f1c88eb498eccfd6963ac8b9e40"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::encoding::str_escape (cyclomatic 23): monoruby::builtins::encoding::str_escape has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::builtins::encoding::enc_name_to_const (cyclomatic 104) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf29afe325f4a7e8910470c6c852a835edd0f37b93af37b29b9fa739ddc7a0e"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::fnmatch::match_segment_chars (cyclomatic 23): monoruby::builtins::fnmatch::match_segment_chars 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":"monoruby/src/builtins/fnmatch.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0180c676a000a4e93e8d2e7182115bd11d5dc18ead32964c74306693a92d60"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_rational_str (cyclomatic 23): monoruby::builtins::kernel::parse_rational_str has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (number, digits). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fef55497082b851c6dd494f5832f968aae13303a7f6e817074856351a0c077"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::string_strscan_match (cyclomatic 23): monoruby::builtins::string::string_strscan_match has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baa00ab53cc57ae344a4d83dcc92eb30c84e07c1ae969bdd85cad5a58b76720"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::byte_case (cyclomatic 23): monoruby::builtins::string::byte_case has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":9495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67175c87c536c6993f9cd37ea3a68155ffacc7eecf1346bae15a21f5a7a1987"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::execute_gc (cyclomatic 23): monoruby::executor::execute_gc 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":"monoruby/src/executor.rs"},"region":{"startLine":6483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2312c5a22890474b70a1d1565bf5638c449d1981abb7e2dbc8fba8de07edae53"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::globals::gvar::write_special_check (cyclomatic 23): monoruby::globals::gvar::write_special_check has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/gvar.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f740a16c935332266e2f6e56676d4aac0a21f464228b6ed6d6a05d14bfd8e"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.reverse_each (cyclomatic 23): Range.reverse_each 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":"monoruby/builtins/range.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebd9a4a1d2266cf98bba2735ce9a99d436a3a8018984e65c272e021d898829d"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.__cover_range_q (cyclomatic 23): Range.__cover_range_q has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f00a2cfda64fbd3e68f9c12b669797af2accc09269ee1bbd92a081ab336b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.__decode_string (cyclomatic 23): Parser.__decode_string 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":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"811aae5e386074f9b56f5709c311a6547a19be829fe6efaffb2c037c7fa227e8"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.drawTimeline (cyclomatic 23): aobench-cpu.html.drawTimeline has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a889054ce121bc8d9b4170f676468319c3c4aeceee1382886f6db54ff6910db3"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.drawTimeline (cyclomatic 23): optcarrot.html.drawTimeline has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dd5a0b2ce0190372d3fd37e1ff73bcf5ce6203756cd912a7019093cf2de190"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.drawTimeline (cyclomatic 23): viewer.html.drawTimeline has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda295a10d7af46b654c08796d58404e3b401639102fe0d915699313132a7664"}},{"ruleId":"D1","level":"warning","message":{"text":"nokogiri_native::html5::fragment (cyclomatic 22): nokogiri_native::html5::fragment 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":"ext/nokogiri/src/html5.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b53e735b3e5095cd8ddd9efdc485329768979d8c9714daa18c2f39fe6631e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::method_call (cyclomatic 22): JitContext::method_call has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba3ece3f2b85d4a4512313a23784fe651238975bf731d3b0b904629edce05dd"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::resolve_dyn_var_offset_in (cyclomatic 22): JitContext::resolve_dyn_var_offset_in 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":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"088337ad6af90a11fb5e958f7945d0c1e93ec746d2484f695955ce551175cb22"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::gen_asm (cyclomatic 22): Codegen::gen_asm 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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b8b56403dab82b71c774ecdb9ebaddfda4a34f658fae168feafae00c734665"}},{"ruleId":"D1","level":"warning","message":{"text":"Globals::new (cyclomatic 22): Globals::new 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":"monoruby/src/globals.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2c5eb9e5e6f8da91e4d446cf79a46ce34df1136b80b9fb6fbce889fb30e1c8"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexpInner::expand_backref_wide (cyclomatic 22): RegexpInner::expand_backref_wide has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3995}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4def25e6dbbe31549f2450af780f5f69a3dbd96c59a4743e17b5548f0ad48b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::first (cyclomatic 22): monoruby::builtins::arithmetic_sequence::first 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":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"af38383f35ced3289aa25e381e84eb5f320208c3d762165b47c8a2b440fc9b10"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::file::check_realpath (cyclomatic 22): monoruby::builtins::file::check_realpath has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eca870598d74385cb440a9224530962aaba2d289722ffe26d22818cbb0d7761"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::io_wait (cyclomatic 22): monoruby::builtins::io::io_wait 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac61034c7e6894f9a850ef353e7380d1d8c9792725d195ef0dd10fe0160a40f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::enc_str_succ (cyclomatic 22): monoruby::builtins::string::enc_str_succ 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b52b85b779c676bb260ec5eef69a7787614a1f408decca3759f05ca6a87df8"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::args::fill_positional_args (cyclomatic 22): monoruby::codegen::runtime::args::fill_positional_args has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef659e3cd3a81ee6377fedaf5edcceea0053fee20971c027306655fc2d52e45"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::ruby_float_to_s (cyclomatic 22): monoruby::value::ruby_float_to_s has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f4341f5b92a9aec99774f27641aa16989670675397785cf7346eb539e2083"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.each (cyclomatic 22): Range.each 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":"monoruby/builtins/range.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eedf32afea144d11f7d96c0f17271ca3e9d8248344c7e908fb283e9ccd66137"}},{"ruleId":"D1","level":"warning","message":{"text":"Window._gosu_pad_button_id (cyclomatic 22): Window._gosu_pad_button_id has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c22f38cae50b5c0666bb0f7699ebfef043dd9a12dd111d159de7cd78d50e9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoder.__encode_part (cyclomatic 22): Encoder.__encode_part 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":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c394aa075f269bb9eaa9c39a501894f49d9f0b65f96607b5b98b16a547f74e"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoder.__escape (cyclomatic 22): Encoder.__escape 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":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee9d23ed5d0a4d3a1ff1650a714092cced81e91009e51437f8274c021ae3f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"nokogiri_native::html5::output_node (cyclomatic 21): nokogiri_native::html5::output_node 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":"ext/nokogiri/src/html5.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f77b5eccf00449e54273addf12d8938b47a63428e86883eab2d26266f07e878"}},{"ruleId":"D1","level":"warning","message":{"text":"GenConfig::configure (cyclomatic 21): GenConfig::configure has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cc1219401d3fdb594e865fd94d864d5afcf13bee22dc7b045a24ac6ada33d6"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_case (cyclomatic 21): BytecodeGen::gen_case has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a707633c9517280b9a3ceb710a4d188b64acc1d9cd2fc2c717948c1bb4cce29"}},{"ruleId":"D1","level":"warning","message":{"text":"CharByteIter::next (cyclomatic 21): CharByteIter::next has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Encoding::name (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd3e153ebe6712f834b61e900dcb520f5814f46bc133e2ba529157e187fc6e4"}},{"ruleId":"D1","level":"warning","message":{"text":"RStringInner::scrub (cyclomatic 21): RStringInner::scrub has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Encoding::name (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7776bd90da56f02b7e0154bd503a144031dd793442041dcca350ffea621da8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::encoding::init_encoding (cyclomatic 21): monoruby::builtins::encoding::init_encoding has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::builtins::encoding::enc_name_to_const (cyclomatic 104) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"298adfd08e4e8446f1eff2000aba8e3837a76e4249f99f965eda9b06d0c847d5"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::encoding::rb_enc_compatible (cyclomatic 21): monoruby::builtins::encoding::rb_enc_compatible has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::builtins::encoding::enc_name_to_const (cyclomatic 104) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":5228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cccc65c12b972130a196997e4265f2bcafab3d760eaf17cc1d82fd6a7d015c6"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_hex_float (cyclomatic 21): monoruby::builtins::kernel::parse_hex_float 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0711f7ca7ac5afc9a189eb087b68a30947b91a5eaf899ea29674d54d645bfa53"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::numeric::integer::index (cyclomatic 21): monoruby::builtins::numeric::integer::index 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":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"92634922f3e741285fc23ef46936899ced7d7ad30080bfcd692cf0f2af5b3b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::regexp::regexp_union (cyclomatic 21): monoruby::builtins::regexp::regexp_union 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":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94d2ff19b04268e3a13105bef8fcfae6f70ae3d11c8ce2b93532f14a606c71e"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::string_rindex (cyclomatic 21): monoruby::builtins::string::string_rindex 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":6851}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521023593b222b5e1618f6da4aa376755fe193d7e289d5bc332933cb80535f2"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::substring_char_index (cyclomatic 21): monoruby::builtins::string::substring_char_index 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":7028}}}],"partialFingerprints":{"codehealthFindingId/v1":"8266d3661df48c1c80f2c61c50a40a3c1e78a24b5574c06e03d4f17fe4487217"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::op::sort::merge_sort (cyclomatic 21): monoruby::executor::op::sort::merge_sort has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, 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":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6d050fd235aceb714c68eb550cec3d96827a40221b1ea9b18bd11bcf59df5a"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::carrier_stream (cyclomatic 21): monoruby::value::rvalue::string::transcode::carrier_stream has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::value::rvalue::string::transcode::encoding_to_rs (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":6092}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a2342ee441ba43c17c0d594c8ff21044fa32c4a6baac22c41ccf042aba9f84"}},{"ruleId":"D1","level":"warning","message":{"text":"Ractor.__shareable? (cyclomatic 21): Ractor.__shareable? 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":"monoruby/builtins/ractor.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"71366a8de18238ba4512b1622dca8819f5fef9a1b963c296cc213870b579d2e7"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.initTimeline (cyclomatic 21): aobench-cpu.html.initTimeline has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 657, 638, 647, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b8120f400a0c15d4761ee22c28de8304b828934a28386f017f6e8d233e4935"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.viewMethods (cyclomatic 21): aobench-cpu.html.viewMethods has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (drawDetail, a function literal at line 1034, a function literal at line 1007, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4bc11e481ded6ee3d4b72e4c2966b9ec04978144208231b81bd5765d7b0ab4"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.initTimeline (cyclomatic 21): optcarrot.html.initTimeline has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 657, 638, 647, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f1991cf218276d3b6f5b5603b159f74f501ccdb84260730d0e37c13af37c34"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.viewMethods (cyclomatic 21): optcarrot.html.viewMethods has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (drawDetail, a function literal at line 1034, a function literal at line 1007, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"97013b8cd0801cc13a76b7b49813425aded6468ae90d6f13bc04c5649b44ca3e"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.initTimeline (cyclomatic 21): viewer.html.initTimeline has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 657, 638, 647, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5396dd132d35b37a4783189ad54728734f22b46702493530ca2ba0db128acfa"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.viewMethods (cyclomatic 21): viewer.html.viewMethods has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (drawDetail, a function literal at line 1034, a function literal at line 1007, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1722fa421fcc86453a1f3519a1ff8ffe60dcfe64e92eea12e1379a4bdab9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"nokogiri_native::wrap_node_as (cyclomatic 20): nokogiri_native::wrap_node_as has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af83a47733cf6e67a722e8353d709451d90afb1c9a0d18e199d0fa564e68070"}},{"ruleId":"D1","level":"warning","message":{"text":"Allocator::gc (cyclomatic 20): Allocator::gc has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"be014270ba93e1d609770d958ebeec0a1063cd3be7574d870dc147375496ebb7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::unescape (cyclomatic 20): Parser::unescape 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":"monoruby/src/builtins/json.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a803bb3a647e5f9febafb26839554119ade9dbbb686f749affed83628c176f83"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::generate (cyclomatic 20): Generator::generate 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":"monoruby/src/builtins/json.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c3fd0382e4a9270919cb257153534009c28fd5ebac6de5c802639ae13636c6"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_regexp (cyclomatic 20): BytecodeGen::gen_regexp has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee829070eaef9055b1fa2491941340dc1e588a892051f4fe89f56042f24f6f43"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmInst::fpr_operands (cyclomatic 20): AsmInst::fpr_operands has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: AsmInst::dump (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03d166f59c8f5c56f8fa64e6a51c9538e8f0f47787460075b5bd7b68bed16a0"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::consume_virtual (cyclomatic 20): JitContext::consume_virtual has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de53785f5b080d290987e3c4d03a17d64ed6ab822d0dfdaf5e6e82e7ad0f0e8"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::consume_virtual_index (cyclomatic 20): JitContext::consume_virtual_index 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":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afdb2814847a31d21cc0c9e0bdc8d261fc469dacdbe19078bfc309df48481b8"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::try_splice_exit (cyclomatic 20): JitContext::try_splice_exit 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":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f83fe0c21d5f6cfbb23ba8253a75a6ffabe3e27fe10ab68b604438db7affb"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::probe_constant (cyclomatic 20): Executor::probe_constant 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":"monoruby/src/executor/constants.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc11101d5afb5564289a38620ef4495c7fde636cb69ca25b6231a46e54600567"}},{"ruleId":"D1","level":"warning","message":{"text":"IoInner::read_underlying (cyclomatic 20): IoInner::read_underlying 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":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b6bf63bef97db4cd4e786db75f1040e1216261aa40e861dcd714f1376ca355"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::argf::read (cyclomatic 20): monoruby::builtins::argf::read has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e080a9bd4b530952e523d4d9803c74eb72c2f8f9cbd185e4ddf782b0b8de80f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::rand (cyclomatic 20): monoruby::builtins::kernel::rand 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"12400bd765230f483b47e4058e8444dfd178ee772de839989ab7e81f4afe91a2"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::marshal::marshal_try_user_protocol (cyclomatic 20): monoruby::builtins::marshal::marshal_try_user_protocol has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: MarshalReader::read_value_inner (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0da1b76285ef7557dc55b4c498604119162c4e4f8f60aa6821f8a9ab7d75cb"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::regexp::rmatch (cyclomatic 20): monoruby::builtins::regexp::rmatch 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":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"54adff0b48145ce65455d6aa97d6b6606af18d603dba238040e17a0d589f2463"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::scan_to_c_number (cyclomatic 20): monoruby::builtins::string::scan_to_c_number 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":8849}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1cae5b243c1e86027fe902b34b41adfae47801d019473716e89f72c7110f26"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::squeeze_compute (cyclomatic 20): monoruby::builtins::string::squeeze_compute 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":11585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c229b440e7de9f3dfbd2d581d72d39145fafd4c35edb29ea414e392613474be"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::time::from_args (cyclomatic 20): monoruby::builtins::time::from_args has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"910184dc84e2e4a0cda7658e81c4a4798e912fd2bb4662a5ba7f4cda85686aff"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::kddi_source_stream (cyclomatic 20): monoruby::value::rvalue::string::transcode::kddi_source_stream has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::value::rvalue::string::transcode::encoding_to_rs (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac98f0c8afcfa83a40f8dd325a1c0060cef509fc91dd44d64b8e5fba90f4d4bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Open3.__drain (cyclomatic 20): Open3.__drain 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":"monoruby/stdlib/open3.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db53da55f015c658241bfd883c80afb618444c0df82f8ae7ee0691cc5ae03dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::object (cyclomatic 19): Generator::object has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69637b4571890448baf14245b255eca16566a8e268887e3b1ceb22f157cf6aa"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::build_return_segments (cyclomatic 19): JitContext::build_return_segments has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":4583}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbde0e3ea572d138838ec8e7ba028a885997f6bc2124db9c3b5203041e1931cb"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkMode::from_caller_inner (cyclomatic 19): LinkMode::from_caller_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SlotState::write_back (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"999b996bf6cc2f6ef7cee542dc9c8aee79024174a3825b11fe38e7b5e58ee95b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassInfoTable::search_method_from (cyclomatic 19): ClassInfoTable::search_method_from has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ClassId::fmt (cyclomatic 59) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0713e779518929d46604c356a27c484826d23642dbedb9d3ed5f935cb3702f"}},{"ruleId":"D1","level":"warning","message":{"text":"Globals::search_candidate (cyclomatic 19): Globals::search_candidate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/require.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"6078ef829a7c16c816c87a37892e12eddb4dbd4a5d96587e4bc645393297a860"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowerer::lower_call (cyclomatic 19): Lowerer::lower_call has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::parser::prism_backend::node_kind_name (cyclomatic 145) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec2102fa850d109b87eeb4765b004dc1e230ebae14f2e81601bd36a1b8711de"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::from_const_ast (cyclomatic 19): Value::from_const_ast has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3906}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e15b09d2c23d372b07aa9bbb99ffc3a2b5c61c321da72cc67a02c959a0e8d2"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::array::inject (cyclomatic 19): monoruby::builtins::array::inject has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"25697a28ed9be5825f201c6174301e111963cbd57386ec97421592def3d4359b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::array::sum (cyclomatic 19): monoruby::builtins::array::sum has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6435614b69bb8c3a0dfa4c8499c2e4aa3c535a34d709bf446dbf7524e279807"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io_buffer::buffer_map (cyclomatic 19): monoruby::builtins::io_buffer::buffer_map has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c4c40247d916017317d3f9ad5a0462f66fab648915e6c22a444607f157f85f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::module::constant_path_segments (cyclomatic 19): monoruby::builtins::module::constant_path_segments has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"87778f3c74ef0dd165655370bb5d045803af4ae7d321d97472e606a24d4e9fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::string_pattern_replace (cyclomatic 19): monoruby::builtins::string::string_pattern_replace has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e221b88f72cdfb39944e7cadeec05b0261c7a456294f70019d4143cb95db680"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::line_ranges (cyclomatic 19): monoruby::builtins::string::line_ranges has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8342}}}],"partialFingerprints":{"codehealthFindingId/v1":"be61bfa53e92b8a62f765359f3724a82effbd30bb4858f22777924303c7a400e"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::ascii_tr_translate (cyclomatic 19): monoruby::builtins::string::ascii_tr_translate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11017}}}],"partialFingerprints":{"codehealthFindingId/v1":"533d75cfc284a6584665d71bfe4842d8a3283e067d05fac8cbc674bc236276d2"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::enc_mbcput (cyclomatic 19): monoruby::value::rvalue::string::enc_mbcput has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Encoding::name (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d852707ceeb7224c2d1dac3590a46b350d01c6d283974c5200b338641c90e60"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.include? (cyclomatic 19): Range.include? has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faaf0e339acb66d1af65b8699d8099368b40eea8fefd162e219c822f12cb6ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Strptime.__compile (cyclomatic 19): Strptime.__compile has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8d5d3b72d4b1ab141a5f46179c8a0690ca363bc061716e20041844e1b3b665"}},{"ruleId":"D1","level":"warning","message":{"text":"Socket.udp_server_sockets (cyclomatic 19): Socket.udp_server_sockets has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa2213744dfe01a8b6b8f19d3d849ca8109015a8f452f764812511c857f8021"}},{"ruleId":"D1","level":"warning","message":{"text":"psych_native::yaml_parse (cyclomatic 18): psych_native::yaml_parse 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":"ext/psych/src/lib.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c363a4b38632f758d65060be365aeeaee345db64ed06157aabc5a7d93eb109bf"}},{"ruleId":"D1","level":"warning","message":{"text":"JitModule::gen_chain_replay_stub (cyclomatic 18): JitModule::gen_chain_replay_stub has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa5838284151092a24198d32d55b17be75b80570517ea20be44766d6671e3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::parse_f64 (cyclomatic 18): monoruby::builtins::parse_f64 has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42d09a06238e7515fa2ac095993ce8a123966cd7670305801015be9fcc8109"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::read (cyclomatic 18): monoruby::builtins::io::read 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"306bda3111a3dca2acf6c3ee53923756a589ec3fc028cccf9c068c74230b021f"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::collect_backtrace (cyclomatic 18): monoruby::builtins::kernel::collect_backtrace 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c74581d99dbcd90229c9adda1d320cd78927c420e463c5d08711bc6a9d4b81"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::string_match (cyclomatic 18): monoruby::builtins::string::string_match 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":6021}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e57467308e7fd8cdb67509cceffca47c28cc3f2836607754cff4d08c2e6a62"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::time::parse_utc_offset_string (cyclomatic 18): monoruby::builtins::time::parse_utc_offset_string 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":"monoruby/src/builtins/time.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f304fbc244a2a1064e01068c38bd3798bdc7a2ab9a4fa5749b74c87eed83ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::args::bind_keywords (cyclomatic 18): monoruby::codegen::runtime::args::bind_keywords 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":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a67a920403d0c4d0aed236fa0df52ba45e5d8d9a448239a604bf8d57a063ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::args::invoker_arguments_inner (cyclomatic 18): monoruby::codegen::runtime::args::invoker_arguments_inner 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":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d2c78dc38635aa920874bb295e39592bd79b3f2041b73ff20ed0abb0f44372"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::cp5022x_to_eucjp_from (cyclomatic 18): monoruby::value::rvalue::string::cp5022x_to_eucjp_from has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Encoding::name (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55d0baac30cd24fe3d93d6d392c080b36fa92ae5cfe06cb3883938f77a34e55"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::utf8_inspect_with_next (cyclomatic 18): monoruby::value::rvalue::string::utf8_inspect_with_next has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Encoding::name (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da75a69bd33b91b06fecf1b50f4e17a69b61d03f35b211e8b408a71fcdaf2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::base64_decode (cyclomatic 18): monoruby::value::rvalue::string::pack::base64_decode 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":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec77a41b4bfff8fcc8b93010365157eceb2333e236a7dc03c26fe4c1d052597"}},{"ruleId":"D1","level":"warning","message":{"text":"Kernel.warn (cyclomatic 18): Kernel.warn has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Kernel.test (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/kernel.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"591d043652e76e6b0d0c718e793b016565bdde6fa4a369ead381f42f562f9c99"}},{"ruleId":"D1","level":"warning","message":{"text":"Pathname.plus (cyclomatic 18): Pathname.plus has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/pathname_builtins.rb"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"75413dc8edab4e54424134cc235445b3fbde8e2e2d17008029e72c54f84c3e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.max (cyclomatic 18): Range.max 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":"monoruby/builtins/range.rb"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8294c8ea2680892489b5687a538d5eed57ed812415e23e2eb529ab36d3a208d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.__bsearch_float (cyclomatic 18): Range.__bsearch_float 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":"monoruby/builtins/range.rb"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b62a33b1d9b5204ac8321f08d96ad78689fd19faefaf628ef802430d9593ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.__range_step_generic (cyclomatic 18): Range.__range_step_generic 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":"monoruby/builtins/range.rb"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43d608741e5b67a4558d0804a9d79375127c25453caf93aa7bf688b28bd1ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.viewJit (cyclomatic 18): aobench-cpu.html.viewJit has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c0ab3cc4f140978edac33b05883de46fce03ef5fd5311ebfadbd199b46ee86"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.viewJit (cyclomatic 18): optcarrot.html.viewJit has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72eb60e4772db0fa1dab93ebfcc2d8ad741fcffb7e78a536e2a38dcab5ffe46"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.viewJit (cyclomatic 18): viewer.html.viewJit has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2dbc406f05e8f971b2dc20b0b96cb328818270eab3b39c83df2e355ed43fe3"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::gen_mul_assign (cyclomatic 17): BytecodeGen::gen_mul_assign 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":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3467bae51a4400346b791eb8f2f725c486db533166c9054ff9d2ba0ecb2e417c"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::eval_lvalue (cyclomatic 17): BytecodeGen::eval_lvalue 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":"monoruby/src/bytecodegen.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fce53fffad5cf25b713048112cc20d4ba2991e53c26f8a653c9adb3363c2f7"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmIr::push (cyclomatic 17): AsmIr::push has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: AsmInst::dump (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6df79a94f1e929a8984de64ec967c4d377fad6543197c5e6cb5c57fc112145"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::compile_basic_block (cyclomatic 17): JitContext::compile_basic_block 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":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8378e05d75d08c1f36ff737428a22be6e9cb66f99292ec14545ef62761c96e"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractState::binop_integer_gp (cyclomatic 17): AbstractState::binop_integer_gp has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ad571a9a92be082ab6555af76fe48c202779dfd7ed695a914e350e1899ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::a64_gen_chain_replay_stub (cyclomatic 17): Codegen::a64_gen_chain_replay_stub 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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc118b75f5d2d7aebef951b5942f72c52dfa653fe9343cd96e6f0a99503e6d4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::handle_args (cyclomatic 17): Store::handle_args 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":"monoruby/src/globals/store.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ff1a72aef41878407c9b5cfe3f699d15e0f0ff2cf8a0dd5503579cc10cc021"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowerer::lower_hash_pattern (cyclomatic 17): Lowerer::lower_hash_pattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::parser::prism_backend::node_kind_name (cyclomatic 145) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7b468cd80eb62c53df03d7b28031ea560748defdd0357ce89821221526beaa"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::float_step_size (cyclomatic 17): monoruby::builtins::arithmetic_sequence::float_step_size 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":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f46943d736a0d9e44f61cf32a1d4f948e621ab32c56569cc08c574038770cc"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_complex_literal (cyclomatic 17): monoruby::builtins::kernel::parse_complex_literal 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6aa761ca41df82c5fac8c27f12814ae20ec12e2bbf6c2dc539af07a3ea1892"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::kernel::sleep_thread (cyclomatic 17): monoruby::builtins::kernel::sleep_thread 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e02f6e7ed1c71d3c2c0406c697f428439cf4c3e594c6b41fabe626d64f6fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::numeric::integer::int_round (cyclomatic 17): monoruby::builtins::numeric::integer::int_round 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":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e183d579d26d387a66e3474b99fc12c7fd1dcfacf804c08aef42440aba757bb"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::proc::signature_string (cyclomatic 17): monoruby::builtins::proc::signature_string 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":"monoruby/src/builtins/proc.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f9c37fbdd7f9c0accda82a3213572296722f7e65435d0e991e413b34982b22"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::process::process_clock_getres (cyclomatic 17): monoruby::builtins::process::process_clock_getres 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":"monoruby/src/builtins/process.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9e0d3693355b6bfff6988be64ad38f5dcf78df1044645ffb32dc86acfae205"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::regexp::regexp_inner_from_parts (cyclomatic 17): monoruby::builtins::regexp::regexp_inner_from_parts has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b178c71f275cb29f9a716d41109949f2fe6c54ea5d6bb7f5a67bfe21db0068b"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::spawn::parse_redirect (cyclomatic 17): monoruby::builtins::spawn::parse_redirect 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":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d755c3b99cd4f3e6f28ec3a52c5ce97d8b8c6d17a928dee4fcff164ff3c7ac"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::regexp_source_desc_bytes (cyclomatic 17): monoruby::builtins::string::regexp_source_desc_bytes 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":5518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae766da9094f70d1cd7d312aa8b1963182b0c211ed237415fb0b8ca10b330165"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::parse_to_c (cyclomatic 17): monoruby::builtins::string::parse_to_c 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":8942}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bba23ca9438b57fed57627243296091952ae749ba2e2c63813aef9fe59a60ce"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::tr_translate_cp (cyclomatic 17): monoruby::builtins::string::tr_translate_cp 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":11300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c0c98ee71ec83d7abc328eb828796b29caa780b662cb5adf615d80bc842bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::tr_translate (cyclomatic 17): monoruby::builtins::string::tr_translate 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc5d8da819399c3c05460dfc81b8b2e5d152c9031d81f29aa922265027df4a8"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::shr_values_raw (cyclomatic 17): monoruby::executor::op::binary_ops::shr_values_raw 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":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ec876766f74153166b8835b80e1039e5abc806cac8a7282a64e1fc0b3739bc"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::shl_values_raw (cyclomatic 17): monoruby::executor::op::binary_ops::shl_values_raw 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":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47ace2548b354e91d57a558c921cda7881d78f2da9123b56bb0b0d7d1999525"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::native_pool::run_op (cyclomatic 17): monoruby::native_pool::run_op 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":"monoruby/src/native_pool.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d6188748fc5916385504433aedd24d53627455256429053706e7797a6e2184"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::parser::prism_backend::try_prism_inner (cyclomatic 17): monoruby::parser::prism_backend::try_prism_inner has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::parser::prism_backend::node_kind_name (cyclomatic 145) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c77c38bd422276d287fe18bc7aa8fee0ec1e9f6325fddb8ee1f36a622b749fe"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::coerce::check_funcall_args (cyclomatic 17): monoruby::value::coerce::check_funcall_args has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb6cdbcd9b9fc16df736f823c64486af1e1da8a504f10ceb878d22b4de4cfd4"}},{"ruleId":"D1","level":"warning","message":{"text":"Enumerable.minmax_by (cyclomatic 17): Enumerable.minmax_by 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c303148e3b9ab59dd9be40e55e5a4922d8f91597669599141c9053b513085e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.__bsearch_int (cyclomatic 17): Range.__bsearch_int 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":"monoruby/builtins/range.rb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eea0d7dc4fe3434f832a6fa67894e795e0ede162ead90ee553aa2a820991f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Packer.__write_integer_value (cyclomatic 17): Packer.__write_integer_value has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Unpacker.__parse (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9c50ef249bc95fd4ad25559c5c74f1845d1a212987753469977a4cc30f3365"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.makeTable::draw (cyclomatic 17): aobench-cpu.html.makeTable::draw 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":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6527aad88a3e04a3fa5222ec88c6b045d753d8bd01ccf4dc091126937cf214e5"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.makeTable::draw (cyclomatic 17): optcarrot.html.makeTable::draw 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":"docs/src/profiler/optcarrot.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9228fb8716f317fdb7bf013770a04f851440dd7a7b4a316840de7553f36254"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.makeTable::draw (cyclomatic 17): viewer.html.makeTable::draw 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":"monoruby/src/prof/viewer.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a9709a4037cf9bfda5470bab6b5b8dec1f94205a8204f9e29e7fbf3ca8627"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeGen::hint (cyclomatic 16): BytecodeGen::hint has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08859a23d9dfc35cdb6761e2e721813c06ae2c3ee23a60138f34b10ade89c78"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::specialized_iseq (cyclomatic 16): JitContext::specialized_iseq 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":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f49bec225f2fca3ed3e5500f6696fac9e8dc25622917bc4c51ee6bb96c02f15"}},{"ruleId":"D1","level":"warning","message":{"text":"JitContext::pic_groups (cyclomatic 16): JitContext::pic_groups 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":"monoruby/src/codegen/jitgen/compile/pic.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faf71c98e91f888e226874b21ed437ba9cbc342b6b5835fe0a6991d23f65771"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractFrame::apply_join (cyclomatic 16): AbstractFrame::apply_join 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":"monoruby/src/codegen/jitgen/state/join.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"013f14b9c204a1d4291b54fa06b220f9d2e05aa18d5b756af7e29a679c6fa004"}},{"ruleId":"D1","level":"warning","message":{"text":"Codegen::compile (cyclomatic 16): Codegen::compile 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":"monoruby/src/codegen/compiler.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d061eb1b81a3ae4bcd0f6fbe7f5732f0c1f26c7d4797b7a8f3a884dc5ca17f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::get_constant (cyclomatic 16): Executor::get_constant has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"494d640aa9e1700dda29f74980b605668a96c2e0087a3561ed2646f0146b52ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::mark (cyclomatic 16): Executor::mark 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":"monoruby/src/executor.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa92b34bb0705a1e138ff80f7a0b7e4bb1d2a4c166c8f6c9e38ca8352a17e1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowerer::collect_call_arg (cyclomatic 16): Lowerer::collect_call_arg 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 is NOT this file\u0027s highest cyclomatic complexity: monoruby::parser::prism_backend::node_kind_name (cyclomatic 145) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bbcdc003779372e5186701896fe4151b94f1938d569308ef9aef1c20ae8ef4"}},{"ruleId":"D1","level":"warning","message":{"text":"IoInner::seek (cyclomatic 16): IoInner::seek has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1248d4b38ccd5cad9fe1fe99a2404a2e0cdc27749a9a28d4ea4fa96c3b4391f"}},{"ruleId":"D1","level":"warning","message":{"text":"RationalInner::rational_round (cyclomatic 16): RationalInner::rational_round 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":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4e017347eaf4b93a81d25b8c70b786649b2fec368ee91f2b21af1c78ac010b"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexpInner::escape_in (cyclomatic 16): RegexpInner::escape_in has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"06369eb08d4d30c478597f73dd855a627bceb97b1cb8396e828f852adb0831ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::coerce_to_char (cyclomatic 16): Value::coerce_to_char 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":"monoruby/src/value/coerce.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75320faa8796dafa09a7cf6b65a1557f4d724af0341440bd4b90360d6af72e1"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::array::index_assign (cyclomatic 16): monoruby::builtins::array::index_assign 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":"monoruby/src/builtins/array.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5764bf0ab980a85fc74517891ddb41a1556e7e240df0ec562c26d8fc93d0c7"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::hash::hash_index (cyclomatic 16): monoruby::builtins::hash::hash_index 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":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7744cccd649de79ac37f8d9596ed8ab6306d2b3681f1130085a4f47d69a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::io::resolve_io_encodings (cyclomatic 16): monoruby::builtins::io::resolve_io_encodings 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"d705c5fbf1343d5b6d61a67113d8addd2ea622525a2d1ea4144dc2191340d5ba"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::spawn::run_exec_dup2 (cyclomatic 16): monoruby::builtins::spawn::run_exec_dup2 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":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee5c0280fa5ae83916793d8f84ae2080566337d6af7bc67ae7b2c5297b8afd0"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::prev_char_head (cyclomatic 16): monoruby::builtins::string::prev_char_head 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":4227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6655ce6f6b178d231acc9915b6e315aba75d272cd6b7a1e8de2cc8772b73ce44"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::strip_selector_offsets (cyclomatic 16): monoruby::builtins::string::strip_selector_offsets 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8a81b605b055f923b151738fdca06d3b55e1ae0fa7e6c51821a4564d1f26c8"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::string::apply_case (cyclomatic 16): monoruby::builtins::string::apply_case has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10008}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bad043411849bb7a11897b177e387ad01a90870060643b796815a2a2ce2113"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::builtins::time::time_build (cyclomatic 16): monoruby::builtins::time::time_build 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":"monoruby/src/builtins/time.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8daf6500c77d7d885f96685d5b0e92e2c6dadf09cc6cf03b5f3d93d765c7d06"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::append_piece (cyclomatic 16): monoruby::codegen::runtime::append_piece 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":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c304721468ef9181764d81cb68d80567844d485769959d0ea80b220d3dcba770"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::defined_method (cyclomatic 16): monoruby::codegen::runtime::defined_method 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":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f71d5e17d6837275f6ce66403ccd67f60c54da368f510176f5c38d6779049e"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::codegen::runtime::method_return_target (cyclomatic 16): monoruby::codegen::runtime::method_return_target 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":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"718ee0818ddc2789832c942ed0faa3e9d0fdd220f70aba2ce0999b00bd5a1660"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::format::encode_codepoint (cyclomatic 16): monoruby::executor::format::encode_codepoint has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf93d3017f2845f67005dde4f78562f2e25a4c48025a2a9a5fe84b38c9be155"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::format::format_hex_float (cyclomatic 16): monoruby::executor::format::format_hex_float 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":"monoruby/src/executor/format.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b92e83082c932eeff1ff74dce67c05c8014b4aa04a0938e65bc3cdfe403a6"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::rem_values_raw (cyclomatic 16): monoruby::executor::op::binary_ops::rem_values_raw has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dc6f380c2943d51cab6743719252dd24be43a7ba2fd3d27199b11237b6a490"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::byte_class_bracket (cyclomatic 16): monoruby::value::rvalue::regexp::byte_class_bracket 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 is NOT this file\u0027s highest cyclomatic complexity: RegexpInner::onigmo_encoding_for (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":4342}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d8ca94026104b5089d42813edf485fe3f40a16222bac5321ff05b415e39bec"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::mac_replace_pivot (cyclomatic 16): monoruby::value::rvalue::string::transcode::mac_replace_pivot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::value::rvalue::string::transcode::encoding_to_rs (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4966}}}],"partialFingerprints":{"codehealthFindingId/v1":"a308d90a586952b7006d65e89a7d84209882dbbabf7232ce8f1f9ed861cd12e8"}},{"ruleId":"D1","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::stateless_dest_stream (cyclomatic 16): monoruby::value::rvalue::string::transcode::stateless_dest_stream has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: monoruby::value::rvalue::string::transcode::encoding_to_rs (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5840}}}],"partialFingerprints":{"codehealthFindingId/v1":"93da7736ea3d1f236e25066e75c40d81681cd4901b1a6302d7894f9b233d5325"}},{"ruleId":"D1","level":"warning","message":{"text":"Array.bsearch_index (cyclomatic 16): Array.bsearch_index 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":"monoruby/builtins/array.rb"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84aa31bde1844076d2ab45a7e0ed358c6cbee668982d9e6a0f5668b7ba25c88"}},{"ruleId":"D1","level":"warning","message":{"text":"Array.permutation (cyclomatic 16): Array.permutation 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":"monoruby/builtins/array.rb"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30f19188be4b21201500ffcffbb1935edba96780988d045362c680b2d703c73"}},{"ruleId":"D1","level":"warning","message":{"text":"Enumerable.cycle (cyclomatic 16): Enumerable.cycle 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee292e359f9ca22c72aa64d2a742b26048e8f667688ac06c1b63776f4d501eba"}},{"ruleId":"D1","level":"warning","message":{"text":"Exception.full_message (cyclomatic 16): Exception.full_message 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":"monoruby/builtins/exception.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5066d6a3245d491a8bb872f80b5d3be92f6a356f56c356b046b6904bae12c44"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.overlap? (cyclomatic 16): Range.overlap? 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":"monoruby/builtins/range.rb"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9f01260279b0dd41e43a00dc296db61c5fa71c5a981265ae5e04175d6e11d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Struct.dig (cyclomatic 16): Struct.dig 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":"monoruby/builtins/struct.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d89169c845ae20a6b76813997b7c5da7980c0e3dfbd4ae7257a4bb3d8e8bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"BigMath.atan2 (cyclomatic 16): BigMath.atan2 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":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cc5ed94dedb6b768d7709a832541edea901ba2b33f1374e33d91b96d9bb1cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Gosu.button_down? (cyclomatic 16): Gosu.button_down? has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fae0d675da73283ffcde9d7e71d23326ab7c57955c7a81b97688141d2d906d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Packer.__write_value (cyclomatic 16): Packer.__write_value has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Unpacker.__parse (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"966b5ff65ae6e48ed9bbb18014531bf934bbfd68ed21833feeac62fe62bc83d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Strftime.__compile (cyclomatic 16): Strftime.__compile has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868350eabd3aaba1cc357368fac6428214a34cb32e9fa84513aac0a5a9b1986"}},{"ruleId":"D1","level":"warning","message":{"text":"Strftime.__exec0 (cyclomatic 16): Strftime.__exec0 has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"834574be7a7c15508a904ddf69af2de241e75df8b7b453a0aa1c58ec50950b73"}},{"ruleId":"D1","level":"warning","message":{"text":"aobench-cpu.html.viewOverview (cyclomatic 16): aobench-cpu.html.viewOverview has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf03096114f2e4a7d6e0cd3a9d06e1dd3f169fa1671833bc249c5db580fb108"}},{"ruleId":"D1","level":"warning","message":{"text":"optcarrot.html.viewOverview (cyclomatic 16): optcarrot.html.viewOverview has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a76c4d932959bf6e7701f28f3a54a02a123b7fcf3e7da10217910af3f0ce633"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.html.viewOverview (cyclomatic 16): viewer.html.viewOverview 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":"monoruby/src/prof/viewer.html"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4afd9a0cb576e354678d014b246a537cc0e2965b8f4f289fd473d6c3dd1a162"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::stream_convert (cognitive 469): monoruby::value::rvalue::string::transcode::stream_convert has cognitive complexity 469 (threshold 15). Drivers by points: if/else 145 (339 pts), boolean chains 46, loops 14 (42 pts), match/switch 14 (42 pts) (nesting depth added 250). 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":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":6310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb5d4665afb8e1c5c9bd6cb85e0a9510f847177cc7b2d5355663038081b68e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::format_by_args (cognitive 451): Executor::format_by_args has cognitive complexity 451 (threshold 15). Drivers by points: if/else 151 (366 pts), match/switch 14 (39 pts), boolean chains 28, loops 7 (18 pts) (nesting depth added 251). Of this number, 436 points are the body\u0027s own statements and 15 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eadf963871ff4b9972f7969400d73d193eaecfa3bf7bb4493c4c317a85dd4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode_bytes_with_opts (cognitive 444): monoruby::value::rvalue::string::transcode_bytes_with_opts has cognitive complexity 444 (threshold 15). Drivers by points: if/else 121 (256 pts), match/switch 30 (98 pts), loops 16 (55 pts), boolean chains 35 (nesting depth added 242). 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5600}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ca1907ca3186e7f1eb388a5d01074e7b152e65e9a171b54adcc7f87aeec0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::pack (cognitive 392): monoruby::value::rvalue::string::pack::pack has cognitive complexity 392 (threshold 15). Drivers by points: if/else 116 (296 pts), loops 20 (72 pts), match/switch 9 (21 pts), boolean chains 3 (nesting depth added 244). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"62606db0fa99a2c2b13543b8511a42ec1a091992b1315506450d25c39a7dd25a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::cell_decode (cognitive 358): monoruby::value::rvalue::string::transcode::cell_decode has cognitive complexity 358 (threshold 15). Drivers by points: if/else 60 (260 pts), match/switch 10 (55 pts), loops 7 (33 pts), boolean chains 10 (nesting depth added 271). 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":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"df16685f4dada22c5e1bdc4842ebf4a933d0705a394f16cb2c210768193d769b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::unpack (cognitive 342): monoruby::value::rvalue::string::pack::unpack has cognitive complexity 342 (threshold 15). Drivers by points: if/else 84 (228 pts), loops 25 (92 pts), match/switch 5 (16 pts), boolean chains 6 (nesting depth added 222). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"783e73d689580f66e03f2963c7ca50924ae637ede984e24d1e6af2b372369c77"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::split (cognitive 213): monoruby::builtins::string::split has cognitive complexity 213 (threshold 15). Drivers by points: if/else 72 (153 pts), match/switch 14 (24 pts), loops 9 (22 pts), boolean chains 14 (nesting depth added 104). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb81fd38b29c0ee2f05c6b497a140a617847295a7c97a9692a3b605391ee2d87"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::compile_method_call (cognitive 196): JitContext::compile_method_call has cognitive complexity 196 (threshold 15). Drivers by points: if/else 52 (134 pts), boolean chains 37, match/switch 7 (18 pts), loops 2 (7 pts) (nesting depth added 98). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c30aa87ecb938aba5866322780258a0b6ff9c3a843bf221b6deebc35a503706"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::marshal::marshal_dump_value (cognitive 178): monoruby::builtins::marshal::marshal_dump_value has cognitive complexity 178 (threshold 15). Drivers by points: if/else 51 (132 pts), loops 10 (31 pts), match/switch 4 (10 pts), boolean chains 5 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5ab890904daca90e4f1c4d864679fecb5c526a56244a472cdce9b5daf74a81"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::prof::report (cognitive 174): monoruby::prof::report has cognitive complexity 174 (threshold 15). Drivers by points: if/else 53 (113 pts), loops 23 (55 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e35c4b2faddd5a11fcbc98330528273c24fb22a0d11d7a0f1d2c8033b5080aa"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::compile_instruction_inner (cognitive 159): JitContext::compile_instruction_inner has cognitive complexity 159 (threshold 15). Drivers by points: if/else 68 (130 pts), boolean chains 17, match/switch 4 (7 pts), loops 3 (5 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ceb46f73c097bb20f655ffc12e5ef806d28d530af40b9d9095556835cd8d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket.tcp_with_fast_fallback (cognitive 157): Socket.tcp_with_fast_fallback has cognitive complexity 157 (threshold 15). Drivers by points: if/else 50 (97 pts), ternaries 9 (29 pts), boolean chains 22, loops 3 (6 pts), error handling 1 (3 pts) (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb32a51e06016c23122c0d01de74b1e17483b3a2947956194f4d47487bfa5df"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_expr_inner (cognitive 153): BytecodeGen::gen_expr_inner has cognitive complexity 153 (threshold 15). Drivers by points: if/else 61 (117 pts), match/switch 11 (24 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"063180c96c118d2cf8c3e001776f776ae393feb2b8c5a53d892337da7c315440"}},{"ruleId":"D2","level":"warning","message":{"text":"Strptime.__exec0 (cognitive 145): Strptime.__exec0 has cognitive complexity 145 (threshold 15). Drivers by points: if/else 49 (123 pts), boolean chains 12, loops 2 (4 pts), match/switch 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 78). 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":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1756505ab22c1f467d05be21cb9ba008066622d12fc3009daa3e61d4fbbc0d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractState::set_arguments (cognitive 131): AbstractState::set_arguments has cognitive complexity 131 (threshold 15). Drivers by points: if/else 36 (69 pts), loops 13 (31 pts), boolean chains 21, match/switch 4 (10 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58fed80b6ebd0558acdcecdbc96cdbd9f652a2032a1072f432209bce8824cbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocess::unescape_nonascii (cognitive 122): Preprocess::unescape_nonascii has cognitive complexity 122 (threshold 15). Drivers by points: if/else 25 (85 pts), match/switch 4 (14 pts), boolean chains 12, loops 4 (11 pts) (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be6f6c8b38b41bb05ff3b887a211ed312d990f21704978929030bbd50cf50d"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::integer_index1 (cognitive 122): monoruby::executor::op::integer_index1 has cognitive complexity 122 (threshold 15). Drivers by points: if/else 47 (104 pts), match/switch 6 (16 pts), boolean chains 2 (nesting depth added 67). Of this number, 106 points are the body\u0027s own statements and 16 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bba4db9073270e2d94343b0ff44dbe00b1df9b4550340893af873cb528ea72e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_select (cognitive 120): monoruby::builtins::io::io_select has cognitive complexity 120 (threshold 15). Drivers by points: if/else 38 (75 pts), loops 20 (39 pts), boolean chains 6 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1c4f6395ab6a7e0a2fa14c609ee352f8384b6696638e46026bb6aead2168ba"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::spawn::parse_exec_args (cognitive 118): monoruby::builtins::spawn::parse_exec_args has cognitive complexity 118 (threshold 15). Drivers by points: if/else 46 (89 pts), loops 6 (16 pts), boolean chains 8, match/switch 1 (5 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"514ca8950fecb63d0405cbc40fc5c9bee959cce80aebd537e6ad748f34aa9b14"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::main (cognitive 115): monoruby::main has cognitive complexity 115 (threshold 15). Drivers by points: if/else 53 (71 pts), match/switch 12 (28 pts), boolean chains 11, loops 4 (5 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"007102ac45d59bc09d1aba2f2e09cdfa479a0c8017901e65ebdfa61b7a4d3c63"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::loop_float_candidates (cognitive 114): JitContext::loop_float_candidates has cognitive complexity 114 (threshold 15). Drivers by points: if/else 28 (74 pts), loops 11 (33 pts), boolean chains 7 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0e440719079bb8f34967ceecd5eda3d45df87e470ca877a37808892d87ee00"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::set::divide (cognitive 106): monoruby::builtins::set::divide has cognitive complexity 106 (threshold 15). Drivers by points: if/else 19 (71 pts), loops 9 (29 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 75). 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":"monoruby/src/builtins/set.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4550c192150ef96c9a1f1c92e1ef48b8923d55038d1ac43077ab7312f4258199"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::fill (cognitive 103): monoruby::builtins::array::fill has cognitive complexity 103 (threshold 15). Drivers by points: if/else 34 (86 pts), loops 4 (16 pts), boolean chains 1 (nesting depth added 64). 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":"monoruby/src/builtins/array.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546c79e6c34c3e4fc60021a5f73b44c65c468e23a06bc5a2e70ca68fa5c85b2"}},{"ruleId":"D2","level":"warning","message":{"text":"BigDecimal.power (cognitive 101): BigDecimal.power has cognitive complexity 101 (threshold 15). Drivers by points: if/else 35 (60 pts), ternaries 7 (21 pts), boolean chains 16, loops 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3119b9793882d62389f6e2a967c7288ef33edb50ce31d3a66c7259e586cd90c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__range_step_numeric (cognitive 95): Range.__range_step_numeric has cognitive complexity 95 (threshold 15). Drivers by points: if/else 25 (60 pts), loops 5 (19 pts), ternaries 2 (10 pts), boolean chains 6 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d10ed93f21d0cb5a0dd1454c084dee84547d47396fb1b9dcdfecfa7608f63b6"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::slice_ (cognitive 91): monoruby::builtins::string::slice_ has cognitive complexity 91 (threshold 15). Drivers by points: if/else 31 (54 pts), match/switch 12 (31 pts), boolean chains 6 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"18277906ffdb5776af0a6974e130b757618c7a0f85a2f6920c44e9291c86e83e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::copy_stream_fds (cognitive 90): monoruby::builtins::io::copy_stream_fds has cognitive complexity 90 (threshold 15). Drivers by points: if/else 21 (51 pts), match/switch 10 (24 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 48). Of this number, 87 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":7168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d63979cc61ffb9c016966b45f9f0aed3d2f2440ab7b12266a7758c29cd2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::range::range_include_impl (cognitive 90): monoruby::builtins::range::range_include_impl has cognitive complexity 90 (threshold 15). Drivers by points: if/else 31 (60 pts), boolean chains 18, match/switch 7 (12 pts) (nesting depth added 34). Of this number, 87 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1704c6f5f216bc9669615fea2e9c971593a011b65aad5484cf4ab390d1f54c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.minmax (cognitive 90): Enumerable.minmax has cognitive complexity 90 (threshold 15). Drivers by points: if/else 36 (90 pts) (nesting depth added 54). 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbaf8c86a78190835f11b7cb140a4299912ae38cc72b51c89aaefca4f1f8a07"}},{"ruleId":"D2","level":"warning","message":{"text":"Numeric.step (cognitive 89): Numeric.step has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (51 pts), boolean chains 16, loops 4 (12 pts), ternaries 4 (10 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a09f90b4bd549b9018b06c2222f2854b9c2deba9918ead74768d5aed4b5739"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::expand_array (cognitive 88): monoruby::codegen::runtime::expand_array has cognitive complexity 88 (threshold 15). Drivers by points: loops 14 (55 pts), if/else 18 (30 pts), match/switch 2 (3 pts) (nesting depth added 54). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca529f96f37465d34b896adf80719d4606c7fb11099e7599bbc889f9dc4809c4"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::region_summary (cognitive 85): JitContext::region_summary has cognitive complexity 85 (threshold 15). Drivers by points: if/else 13 (44 pts), match/switch 7 (24 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"523275f5f7d2feddefb4b85bb8f8fef5fe346cd41f89947bdefc74ccb75442fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::lower_node (cognitive 83): Lowerer::lower_node has cognitive complexity 83 (threshold 15). Drivers by points: match/switch 18 (38 pts), if/else 13 (24 pts), loops 7 (20 pts), boolean chains 1 (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":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4d65a93b733379d5bed49f291c87f623be9831f0f427f8649327a1330a82e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Plain::node (cognitive 82): Plain::node has cognitive complexity 82 (threshold 15). Drivers by points: if/else 32 (59 pts), match/switch 3 (10 pts), loops 2 (7 pts), boolean chains 6 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"73829078fcb3a4fa9fb2c944e03428e377544ed5781efe699850dded562786d6"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_copy_stream (cognitive 82): monoruby::builtins::io::io_copy_stream has cognitive complexity 82 (threshold 15). Drivers by points: if/else 31 (56 pts), match/switch 10 (14 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445f9a2114a77cabd53782f95270aecf4931036901664105988ea80bd7af0b5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float::round (cognitive 79): monoruby::builtins::numeric::float::round has cognitive complexity 79 (threshold 15). Drivers by points: if/else 38 (71 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f07fed850862a337a8835983679859d9edb8dc51e7af3f79e9273043fa0b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::encode_linst (cognitive 78): Codegen::encode_linst has cognitive complexity 78 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 19 (36 pts), loops 3 (6 pts) (nesting depth added 36). 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":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f39a07beb65cbe165fe238e15dc95b52cbe211fa1ae26536405befc6819e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_popen (cognitive 77): monoruby::builtins::io::io_popen has cognitive complexity 77 (threshold 15). Drivers by points: if/else 32 (55 pts), boolean chains 10, loops 3 (6 pts), match/switch 4 (6 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a2e2f6d754e174b1bf96b5b0f4bea3fae161d7c1d83895742f7f2e04dd85c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::byteslice (cognitive 75): monoruby::builtins::string::byteslice has cognitive complexity 75 (threshold 15). Drivers by points: if/else 38 (67 pts), match/switch 3 (8 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50cab235dcbd10d3e18ce66917728a5dcbf1e3cfbae86392b025517d8ef1edc"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::set_callee_frame_arguments (cognitive 73): monoruby::codegen::runtime::args::set_callee_frame_arguments has cognitive complexity 73 (threshold 15). Drivers by points: if/else 30 (51 pts), boolean chains 11, loops 3 (8 pts), match/switch 1 (3 pts) (nesting depth added 28). Of this number, 72 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e8f6bdd069c1980b27c03269c5df040e59331755be6d750127b7969128aafc"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::expand_unicode_braces (cognitive 73): monoruby::value::rvalue::regexp::expand_unicode_braces has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (56 pts), loops 2 (6 pts), match/switch 1 (6 pts), boolean chains 5 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccd53b6b586442362c29c9c444e1856b6a0c19ca9ef7a99bff0b958de66480c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::integer::index (cognitive 72): monoruby::builtins::numeric::integer::index has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (65 pts), match/switch 3 (7 pts) (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e830d39b9d516bf93e347e297475e249aaca3218e14caf879aa10dfac9eb88b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::bytesplice (cognitive 71): monoruby::builtins::string::bytesplice has cognitive complexity 71 (threshold 15). Drivers by points: if/else 39 (68 pts), loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8000}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab07330475e63f8843d5bb305c152ae113fa01592281cd8ebf83cfa618925a2"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::struct_class::initialize (cognitive 70): monoruby::builtins::struct_class::initialize has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (47 pts), loops 7 (19 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 39). 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":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a7b34534b77a99e089171e7029427b26bd03cd52313e5a3a8bf45524b1abb2"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::level_down (cognitive 65): BytecodeGen::level_down has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (49 pts), loops 5 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 36). 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":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0ea62e3fca9298e8b56a8b92480b0964dedc5ebfddc578708f8c174327391c"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::describe_func (cognitive 64): Store::describe_func has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (49 pts), match/switch 5 (9 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2947c9a2b9153a7278b1171d720c1973c10a987162d4c32347d265a41a3e3b6"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_begin (cognitive 63): BytecodeGen::gen_begin has cognitive complexity 63 (threshold 15). Drivers by points: if/else 29 (53 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32a7a865a176d76194a058265f99b6416b6cd4b81ce038c99292b75178809b4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_init_from_fd (cognitive 63): monoruby::builtins::io::io_init_from_fd has cognitive complexity 63 (threshold 15). Drivers by points: if/else 32 (39 pts), boolean chains 14, match/switch 7 (10 pts) (nesting depth added 10). Of this number, 62 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2720cf27a96402cb2f89583fb49abf2ff5b70f4ff915f2b0f7218ac760e07f25"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_case (cognitive 62): BytecodeGen::gen_case has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 7 (24 pts), match/switch 1 (nesting depth added 36). Of this number, 56 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"808313e15955df739284560e2849684a4717f209164aeaf4f6e3205aa503e25d"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::record_pre_fixpoint_outer_floats (cognitive 62): JitContext::record_pre_fixpoint_outer_floats has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 6 (11 pts), boolean chains 9, match/switch 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59f4c257d2cad00519cd95324303106f805c2a67265fa0d5183155a1b7edeec"}},{"ruleId":"D2","level":"warning","message":{"text":"IoInner::getline (cognitive 62): IoInner::getline has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 5 (14 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39702344171f5a913de411d56ffc24e1e41bbea4328c37148c59fc2e2a99610"}},{"ruleId":"D2","level":"warning","message":{"text":"MarshalReader::read_user_object (cognitive 61): MarshalReader::read_user_object has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (38 pts), match/switch 4 (14 pts), loops 5 (9 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"af02e74fec17a861bc462afc8a859d842f04659812f729287e1ccdae5acc8dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::index (cognitive 61): monoruby::builtins::string::index has cognitive complexity 61 (threshold 15). Drivers by points: if/else 29 (51 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa808231afc32ec2c790a175daf7746c61a0b86676037aabe21483839c66063"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::parse_template (cognitive 61): monoruby::value::rvalue::string::pack::parse_template has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 4 (9 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3951e132f71d827be69988cfea375fc4952f1c3baaa841f11fff2ec5bdd7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::encode_linst (cognitive 60): Codegen::encode_linst has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 10 (20 pts), loops 3 (6 pts) (nesting depth added 29). 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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d4e694f472e8c529c88670927b90cb3ff6fbdbcb8696486bacf69be7264510"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::converter_primitive_convert (cognitive 60): monoruby::builtins::encoding::converter_primitive_convert has cognitive complexity 60 (threshold 15). Drivers by points: if/else 34 (43 pts), match/switch 9 (12 pts), boolean chains 5 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"37123ef8c08462d4f206f1ecdc1bb68d25ede1c82bc62b71af8d47d0ef0b371f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::index_assign (cognitive 60): monoruby::builtins::string::index_assign has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (35 pts), match/switch 8 (20 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee2d3e1cd2a5931ba18f6e7967a6acee3be65ee1d58cb550172730d9f6da0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::incoming_context (cognitive 59): JitContext::incoming_context has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 13, loops 2 (7 pts), match/switch 1 (4 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6e63438311e4f7b099da6f85cda37d1ad00c53a833877b180846f984723f54"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::jit_module::handle_error (cognitive 59): monoruby::codegen::jit_module::handle_error has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (53 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5d7a658b1372f2ebc600fa05b6d50594094970c07ed93f9f254b5443fbc35b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticSequence.each (cognitive 57): ArithmeticSequence.each has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 8 (22 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/arithmetic_sequence.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6457386a3f8acfd40c24fb4a7e160ae7d57759498005d664140b83e19a42aae3"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractFrame::bridge (cognitive 56): AbstractFrame::bridge has cognitive complexity 56 (threshold 15). Drivers by points: if/else 32 (51 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d269111ef8672652bfd07d267c649bfccf0a303996bd51ef1321ce5774f3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::marshal::marshal_try_user_protocol (cognitive 56): monoruby::builtins::marshal::marshal_try_user_protocol has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (47 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf490a5a9b0bc1d2f590c50f8a9da19be690e1469de7a1fda0c8edaaffc6406"}},{"ruleId":"D2","level":"warning","message":{"text":"MarshalReader::read_ivar_wrapped (cognitive 55): MarshalReader::read_ivar_wrapped has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 5 (12 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 33). 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":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b87c13df1e88055126d453331cdde30ea2cd812db177067fcc1e7ee50cdfc4b"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::check_defined (cognitive 53): BytecodeGen::check_defined has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 7 (16 pts), match/switch 3 (8 pts), boolean chains 2 (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":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f516cfb0b4e3fb1fb447c78c84103b1900becf0e1ac3cf20cda1cb28c9aed58e"}},{"ruleId":"D2","level":"warning","message":{"text":"Globals::require_lib (cognitive 53): Globals::require_lib has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 5 (11 pts), boolean chains 6 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/require.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7c16368ea89b2778483aba1ea7456ffd963e4c07ed5c316c8743ad3ec2492f"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoding::classify (cognitive 52): Encoding::classify has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 5 (12 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef029a878f811cde34523547523f97fa87b695a160dca499246aad9d430e5e40"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::file::open_impl (cognitive 52): monoruby::builtins::file::open_impl has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d575ce1b163143f9a1ce451502fc58d242a7ecd75251dcddca94313e3a5b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::system (cognitive 52): monoruby::builtins::kernel::system has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 6 (12 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a31d0d71e5c6764138514523ac142f6e211543eefcf321f7a410bc42f192eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexpInner::expand_backref (cognitive 51): RegexpInner::expand_backref has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (39 pts), loops 3 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"481fb062b56a19ec92c5bc2446a377ebb5939a8866eb3dc06c5b05147165bcb4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::dir::traverse_dir (cognitive 51): monoruby::builtins::dir::traverse_dir has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3 (7 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e3cebacefebccf0f05e99b1c9ffed2d44faa1bc49c4519dffdc7c5f76b6115"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::pow_values_raw (cognitive 50): monoruby::executor::op::binary_ops::pow_values_raw has cognitive complexity 50 (threshold 15). Drivers by points: if/else 27 (49 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d90802eb20d21b3d6469d6144765983a7abcc25197397771b0d1f632a463a84"}},{"ruleId":"D2","level":"warning","message":{"text":"nokogiri_native::node::relink_namespace (cognitive 49): nokogiri_native::node::relink_namespace has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b614c9877f8e2ba80ad43fb78ee4e3e33f4116a43557526cceb7a33c01fdddcd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::fnmatch::match_segment_chars (cognitive 49): monoruby::builtins::fnmatch::match_segment_chars has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 3 (8 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fnmatch.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a4671bb0ded4c2cd8106f23ab7c9d93bf04ed4819f4a643f0c14c311409c53"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::index_assign (cognitive 48): monoruby::builtins::array::index_assign has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (48 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e592ea11809b6bdebba7d7010d0cc6722b830200d07c29366d4ddb92328237"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::proc::build_parameters (cognitive 48): monoruby::builtins::proc::build_parameters has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (32 pts), match/switch 4 (12 pts), loops 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4399e52d0ce443d940d305aeaa033ff85ba38861fdc0a1a10b754f138edbb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.reverse_each (cognitive 48): Range.reverse_each has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 3 (10 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce786718d9ca9690313413918b882dc8f3d03bb79a83c0118d3cfe896b18b35"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::byterindex (cognitive 47): monoruby::builtins::string::byterindex has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1a97b539ddd551a38a6fc1e674c6885e871b66354625288aadd10c99a3d0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::compile_binary (cognitive 46): JitContext::compile_binary has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 19, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e97f43d0137e427bd738dda2494d742e364ee36bcec510f39e5f575231a366"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceIr::from_pc (cognitive 46): TraceIr::from_pc has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 3 (7 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f1846ab9d0efd0cfbed8112782126aea25ee63bea16c8f5c544e4d564e747b"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::require (cognitive 46): Executor::require has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 5 (8 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fea34eeabbeaec921b4c5eaaacf9e789544c6394c5970d99cace98fb0811f89"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__range_step_size (cognitive 46): Range.__range_step_size has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 8 (26 pts), if/else 12 (14 pts), boolean chains 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7069a724dbc6ef62dee85b46fc61f0986555b1e8ec69bbd4493d62d8bad246"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::object (cognitive 45): Generator::object has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (34 pts), match/switch 2 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c550b82a50b85d08943ed16de670f7c736dc6445d19a8567986d496517cd71"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexpInner::expand_backref_wide (cognitive 45): RegexpInner::expand_backref_wide has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 4 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3995}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d8987351f96915d3f2178b7bb5fc76d4def78cc3a34f2197de03a819f3024b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::jis_direct_one (cognitive 45): monoruby::value::rvalue::string::transcode::jis_direct_one has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (34 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"6474cdbdbe3b734aa142c4708210499925cdf8968a2daa8cf7de78c15e7fac8a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::kddi_source_stream (cognitive 45): monoruby::value::rvalue::string::transcode::kddi_source_stream has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 3 (9 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55d769280fce1e9c9984095d432c7d00a1174a91cf3d54ab78ca9e72d6f746f"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.each (cognitive 45): Range.each has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (7 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77a0424bdd5cc0d14b2b6e65b762415509cb28695e3db07c23341a47ddea721"}},{"ruleId":"D2","level":"warning","message":{"text":"Loop.__ev_run (cognitive 45): Loop.__ev_run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 11, error handling 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/cool.io_ext.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"682370cff14cf14e9990582bf332bdee3f4d6d21b7aafbda7ada4905b784f0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.drawFlame (cognitive 45): aobench-cpu.html.drawFlame has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 3 (6 pts), ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c69a2788305d389dab93402eeb9fafedb66441990bc83ffdc74cc24d3702ba"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.drawFlame (cognitive 45): optcarrot.html.drawFlame has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 3 (6 pts), ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0fecd288585cd9774af569b4a7514df8f5a99d736ac0f249d138a776a6a724"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.drawFlame (cognitive 45): viewer.html.drawFlame has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 3 (6 pts), ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2649ca5fcbe5df0117539447e2c2d8fcdfc35ff816800cadf9fb5490ddad5ef4"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::gen_machine_code_inner (cognitive 44): Codegen::gen_machine_code_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 12, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc66585ce13000b4812679996db30e8cb9b0126167deeeb158fe2ede0dc6e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"IoInner::getline_universal (cognitive 44): IoInner::getline_universal has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 4 (11 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af8c19a1be2aa4f92d62541761509a975b6ba2eb09ffc2e6e7cbd8a6d8ac820"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::collect_backtrace (cognitive 44): monoruby::builtins::kernel::collect_backtrace has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (35 pts), boolean chains 4, match/switch 1 (4 pts), loops 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"421397316cc854d0dd22b982f2a94ac562e29b95ed0e171b47f4366e8a816844"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_method_call (cognitive 43): BytecodeGen::gen_method_call has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26 (31 pts), boolean chains 9, match/switch 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e632926e5f30295b0e33f2d89d82859141ff1829b9d61cc3b752d39d6c499ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::probe_constant (cognitive 43): Executor::probe_constant has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 5 (12 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"f901bd097fdfaaea4ce1bcc503f480e0155b64730723aa2d43f1c5775634d8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::sample_inner (cognitive 43): monoruby::builtins::array::sample_inner has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 6 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a234f15b57d3e2848b3225e151bdf62a5606d9450298973703c9e821864507cd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::rand (cognitive 43): monoruby::builtins::kernel::rand has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6b299f3cbe54421d90e425d59cf23f9c233304e8074e0b7cc0bc47f6422067"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::spawn::child_exec (cognitive 43): monoruby::builtins::spawn::child_exec has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 6 (8 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"777a783bac426d84596d4b299ea3c4d6faf4cf54cce1e326b5dc9670a40f1f89"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::read_escaped_byte (cognitive 43): monoruby::value::rvalue::regexp::read_escaped_byte has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf2caa7750f760264c462d45091bc1c0826fa21a0802732118bc3b888d2e760"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::carrier_stream (cognitive 43): monoruby::value::rvalue::string::transcode::carrier_stream has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 11 (29 pts), loops 3 (7 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":6092}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9c6876c5c68506c5e0bc88f67520fedf7b744421c09ebdf4d001db24af3f82"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.__lex_number (cognitive 43): Parser.__lex_number has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0236afb7e335ab9ea00d1b54cd629d2671e0077b103d4f8d94aaa9600d09b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::gen_asm (cognitive 42): Codegen::gen_asm has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"59baf9e28b5fef15938a53cf6b3b6766225819d32e9ea30eaf1411f1614ce01a"}},{"ruleId":"D2","level":"warning","message":{"text":"RStringInner::scrub (cognitive 42): RStringInner::scrub has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"da89b295ed5d314628cf5abee5e6795a33cb9bff8e570e38dff1f67bdf6b4d41"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_wait (cognitive 42): monoruby::builtins::io::io_wait has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (35 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9013d0dabee51c3f834d8fd4093b7c4fa8a26f918774344c8f26c14bb0f251c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::caller_frames (cognitive 42): monoruby::builtins::kernel::caller_frames has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 2 (8 pts), boolean chains 3, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c923c6d6ac09141da5da676c66478f412fc7c0e3f980ac10488e0e220e79ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::kernel_complex (cognitive 42): monoruby::builtins::kernel::kernel_complex has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 5 (9 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ea0cd69ab77a4f0554d4f9f446ae0f503c08d47d1d27d555c55596cad0778f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::substring_char_index (cognitive 42): monoruby::builtins::string::substring_char_index has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7028}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8af2bcaf43c58f25b2909067057ff86449c717d9e838db01c86603fe51b8a37"}},{"ruleId":"D2","level":"warning","message":{"text":"nokogiri_native::html5::fragment (cognitive 41): nokogiri_native::html5::fragment has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 2 (6 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"569af24fee747538b5090abfb45840a6d4907751cff2aabff88f7ba7e3c07dad"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_store_expr (cognitive 41): BytecodeGen::gen_store_expr has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2406b16d8d53fd4b193ceb5611151b34de6903111b7fd9af3f4736a29c042fee"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotAnalysis::new (cognitive 41): SlotAnalysis::new has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 6 (10 pts), match/switch 2 (5 pts), boolean chains 3 (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":"monoruby/src/codegen/jitgen/slot_analysis.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69e6bfd6c96879ad47bcd22caaf1a3a8c4f1d26a7b2beaebd22a4121cfabb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::compile_asmir (cognitive 41): Codegen::compile_asmir has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18f030479333368147d09aad93bc10370d7c678006b62f8d7897f63a3f7ea11"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::init_encoding (cognitive 41): monoruby::builtins::encoding::init_encoding has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 8 (13 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"557862376eaab6c324c9a37c7d269a2aa85738cf9e54e8511b690e61a51ba6a1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::preprocess_strftime (cognitive 41): monoruby::builtins::time::preprocess_strftime has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (10 pts), match/switch 4 (9 pts), boolean chains 7 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa1ad527ed9edbd3d4b38650c97bed9a5592451f49038737884f99d88db9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::search_method_from (cognitive 40): ClassInfoTable::search_method_from has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (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":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bea98286de7262f90e7359aebe59e0ec3cbc249a6fd6112d7bbebc2b5ffb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Array::get_elem1 (cognitive 40): Array::get_elem1 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 2 (5 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/array.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2021165f2b337dcd2ba6b6a0dddcc947dcbb27c400c9a30890aa22a3a2978d"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexpInner::replace_all_hash_plain (cognitive 40): RegexpInner::replace_all_hash_plain has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"594d58002c5008f4194adf07a49a36129f2eee27511ffec0784fc8c97425f8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::str_next (cognitive 40): monoruby::builtins::string::str_next has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"128403bdef9fe5be1a44cf1cca8ba4531f77ef85b6ace614a3f786bf4b8f2339"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::parse_undump (cognitive 40): monoruby::builtins::string::parse_undump has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (6 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12983}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c98d43b9dee9dbcc79f07f9bb73e2a8f7847abf0396cdd78f886bcdd2805c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Integer.fdiv (cognitive 40): Integer.fdiv has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 5 (19 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/integer.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"083b9c0f66345bacec109423955773c9fab96b99a712a77f6295df46e824e99d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.__do_parse (cognitive 40): Parser.__do_parse has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 8 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"99898268b6cf647fc183baf59e5ad66ef6dbf2d0de09356845aba4fb2970d3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::lower_parameters (cognitive 39): Lowerer::lower_parameters has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 8 (17 pts), loops 4 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5092}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8471494232a2559e700c4e5ded492b438f7cfa17fbda3155e8e93e108f9d0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RStringInner::inspect (cognitive 39): RStringInner::inspect has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 8 (20 pts), loops 7 (19 pts) (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca78ddefa355d928e2704bf3622a54c4a6877f8a6b9e84f6122481b4ea694e9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float::cmp (cognitive 39): monoruby::builtins::numeric::float::cmp has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (32 pts), match/switch 3 (7 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":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c41bb7d5b23f5c4f20119289b4a0deb30fd3a09bea4c29c35c39892d13531"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::ruby_float_to_s (cognitive 39): monoruby::value::ruby_float_to_s has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26 (31 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0371d6c7df6afe316c3e2641c9a5906243909cbede2184a8439885d6653e91a8"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::resolve_dyn_var_offset_in (cognitive 38): JitContext::resolve_dyn_var_offset_in has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 3 (8 pts), loops 3 (7 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"759b2fa8a7ec4ceced9542c348ff83154ef578947e0a8e1d43f34602e1451a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::gen_asm (cognitive 38): Codegen::gen_asm has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e71f86615af6ace4a51a415b0a4bfcb908b5f29e9dd7b3f9da228a4332a3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::take_ex_obj (cognitive 38): Executor::take_ex_obj has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad61f2fdaf89880344781a01e118f9eb38702b34e82b9cabb92c0cfadcd7531"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::first (cognitive 38): monoruby::builtins::arithmetic_sequence::first has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (34 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a991478beae1d7485859812feac0ca2939c041891c90f3e62a92ed015c3a8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::index_op (cognitive 38): monoruby::builtins::arithmetic_sequence::index_op has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 3, loops 1 (nesting depth added 8). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b176a5ee1749a5af2720f9934758e5c89b85a3da5ffd23612f0541a25aacc7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::sort::merge_sort (cognitive 38): monoruby::executor::op::sort::merge_sort has cognitive complexity 38 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 9 (14 pts), boolean chains 8 (nesting depth added 15). Of this number, 28 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5e06bcae2cb6830ad45546acf48893425cb87d2ed6e6def847f4bfd13fb289"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.cycle (cognitive 38): Enumerable.cycle has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 7 (21 pts), if/else 10 (17 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8c4b2415da7a775e7850a61cff4f79ef8d93a39d8328b866203bdbda5c2921"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.__decode_string (cognitive 38): Parser.__decode_string has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 4, ternaries 1 (4 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb5ed44f193842a42259e13d87cdfa5a653981d3b9cbbf40cbaf2a767cbaaaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::unescape (cognitive 37): Parser::unescape has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c655724a172fe598f7fb09550c2a24e4e43b0f681b7fcf002a00b3a889591dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::from_ast_inner (cognitive 37): Value::from_ast_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 6 (13 pts), loops 2 (5 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae816651241e30ebe5d2b369545c271e014d41e4c07773feae2f5ddd395ac5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::sum (cognitive 37): monoruby::builtins::array::sum has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf96e468d54383b3fdb8e18a2d13df2b9a4dcb06904f00a9392bd5f5a240b72"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::string_match (cognitive 37): monoruby::builtins::string::string_match has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdd3343dc51292d30f6b3f0381b4d416dd6dc58d2d4c2f8b1797ef71b2dab98"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::string_rindex (cognitive 37): monoruby::builtins::string::string_rindex has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6851}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e1ac0b29576fd1669f41ae5bfab7a6140e981faa3aa3a49da6ebf8ff431d99"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::ascii_tr_translate (cognitive 37): monoruby::builtins::string::ascii_tr_translate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11017}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f85ce3707355b9fc9956a87cefcde94fd25bad19a708d495d32f9765ea5701"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::tr_translate (cognitive 37): monoruby::builtins::string::tr_translate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"21680a6a49fde4bf719334c7ef39d99dae9787e9fc85962a856795697518415e"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__range_step_generic (cognitive 37): Range.__range_step_generic has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (14 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c22501ff8ffa6310d32e1af32bb42a08a81104d0482c48001935bf1004f8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Open3.__drain (cognitive 37): Open3.__drain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 4 (12 pts), boolean chains 6, ternaries 2 (4 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/open3.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36eba7270dbbe037d14283204ee8861e14d6c8f4ed52df6fb18e669bcc784d6"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::inst_to_bc (cognitive 36): BytecodeGen::inst_to_bc has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 7 (11 pts), loops 2 (4 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2188249eed542c912d33d77be19b2197d19e514905753e4678e5ef013716eaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::inline_class_new (cognitive 36): JitContext::inline_class_new has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 4 (6 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"58075796e583353c99e235624d6b7e0a229c3b72ee6cf7ffc975357a020e5b71"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::inject (cognitive 36): monoruby::builtins::array::inject has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"047371b215c35eee95c7edfeb33da739f558a042cdc62d1352ac379733a1395d"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::file::file_join (cognitive 36): monoruby::builtins::file::file_join has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 5 (8 pts), boolean chains 3, match/switch 1 (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c4f07f9f2de40803fde9fa240a13a20e16df641ef7a92d7294c5401aea6204"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::file::check_realpath (cognitive 36): monoruby::builtins::file::check_realpath has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (5 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 16). Of this number, 33 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"f995c67ba5ab4437ff2ac544d2d01a756f7e78d481253850c6ceaf0bc518a36c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::regexp::regexp_union (cognitive 36): monoruby::builtins::regexp::regexp_union has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d5ef8f361a84f71951d478435200fba193503df100639ce5d3c1edb148d2b2"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::parse_time_string (cognitive 36): monoruby::builtins::time::parse_time_string has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 10, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3114d6c398c98bc12e7ded9927dcbe441b188cecbce5a2b0e759133a086adee8"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::parse_short_cluster (cognitive 36): monoruby::parse_short_cluster has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (7 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"282ee781927411770b7f953ffdbc223e7e51c1f3f4aa78f8178513906e1501de"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.viewFlame (cognitive 36): aobench-cpu.html.viewFlame has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 6 (8 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 11 of the 36 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 930, updateCrumbs, updateMatched::walk, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"6601882d6a32a51fdeb8816c99274140b4d583e5fd0b1040452beeb06f4733ed"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.viewFlame (cognitive 36): optcarrot.html.viewFlame has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 6 (8 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 11 of the 36 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 930, updateCrumbs, updateMatched::walk, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4063e0ab1e1e0f85b6961d50f65811e570b83d4ac3af27322241bc17072128"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.viewFlame (cognitive 36): viewer.html.viewFlame has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 6 (8 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 11 of the 36 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 930, updateCrumbs, updateMatched::walk, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"8396de9215de6fcc940b7ecb2e0d58f6ff0fce99ebe18920881c93bc685aa531"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceInfo::get_location (cognitive 35): SourceInfo::get_location has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ast/source_info.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1335f61d2ea7d561997f61a40c3e9f0ab729f82f0301ec7a4aa51e8d4589af"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::method_call (cognitive 35): JitContext::method_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3922fb1af0d9bf97c8ad9c10e7ed6ca238f8f5b0b24cd7e5b7f76e4ec6a211b"}},{"ruleId":"D2","level":"warning","message":{"text":"Globals::search_candidate (cognitive 35): Globals::search_candidate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/require.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3383eea7b40a831354924952d405eb8bf98667321f00d2a247ec7d0175e939c5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::array_join (cognitive 35): monoruby::builtins::array::array_join has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ef39fa31ebb5395a3dce381c262f470c54d51e8a0e829ac6ce70f3572f17b7"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io_buffer::coerce_int_for_type (cognitive 35): monoruby::builtins::io_buffer::coerce_int_for_type has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"368e0b3de654a6612c78b2becb6c165ab7c4ae7d0198a35fd5fd19284cdbe1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::sleep_thread (cognitive 35): monoruby::builtins::kernel::sleep_thread has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"2499bb38796d782a4ef08e30111c42b2641a4669499ffc2fa6600ee29b1551d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.__lex_string (cognitive 35): Parser.__lex_string has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cca4c323026a3efdd7c69f66315c19f3d3c72000e0bd00265e46cad492e018"}},{"ruleId":"D2","level":"warning","message":{"text":"RationalInner::rational_round (cognitive 34): RationalInner::rational_round has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0f3e3fd19338defd85e162b282eb21499077229d1a5ba8a4c1c55387075636"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::coerce_to_char (cognitive 34): Value::coerce_to_char has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 1, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0ce8757263786650bcf4fa68eeb4d0fb956bcae0ed41e06aba9fd11a2649e3"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::argf::read (cognitive 34): monoruby::builtins::argf::read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"924a32a5100662c762940b1ac33b8bedbbe086d2fb86a84fc2b056da83bd6760"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::read (cognitive 34): monoruby::builtins::io::read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0689965cbf5a6da794507ef30337e5cc16eb2c7f1f67d76b02144b89e0b941"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::regexp::rmatch (cognitive 34): monoruby::builtins::regexp::rmatch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf28dbedd8b78186f581333ac24238ab101d674dc4a62975744fea8915bff72"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::enc_str_succ (cognitive 34): monoruby::builtins::string::enc_str_succ has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (10 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9bb0dcd8d80616b25e34f39cd3463e5364c4bc7cc15d37401ba62636b0c53f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::split_paragraph_ranges (cognitive 34): monoruby::builtins::string::split_paragraph_ranges has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8621}}}],"partialFingerprints":{"codehealthFindingId/v1":"79858b2c9d146cf573535e810e77d59b51987cb7d9305abff540d9579aef0cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.min (cognitive 34): Enumerable.min has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (34 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Enumerable.max) 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbd84e2b855e2c46043eafc2d2f26f54bcd9cf679392aceede5c2de30ce38ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.max (cognitive 34): Enumerable.max has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (34 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Enumerable.min) 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8680022be20720c2f319061cbec56cdf0621917bee7b54701676ea3cc91fd84"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.step (cognitive 34): Range.step has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (13 pts), ternaries 2 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c54f4244764ec7f71ddc511086ed68c7bdd956f61075c71bcbfa11d4ddbc2c"}},{"ruleId":"D2","level":"warning","message":{"text":"IoInner::read_underlying (cognitive 33): IoInner::read_underlying has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf7c580f36cd611112b6c6dc55683f193abfdaceb742075dbd757c444ad4b27"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::set_encoding (cognitive 33): monoruby::builtins::io::set_encoding has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 8, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5777}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472a206adae6abc8c996133c80e50a105598f32bb15d9b0e8668134bb5bab73"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::kernel_integer_inner (cognitive 33): monoruby::builtins::kernel::kernel_integer_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"005506eff11f3c4665ad1505dade5747fb06f8d704cad663208d98db302133bc"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::math::ldexp (cognitive 33): monoruby::builtins::math::ldexp has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b6c8f620d4a8f495f9b1bac3922e6442d070f2bc321278ca3f9bb7eb3b4002"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::apply_case (cognitive 33): monoruby::builtins::string::apply_case has cognitive complexity 33 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 4 (9 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10008}}}],"partialFingerprints":{"codehealthFindingId/v1":"37af37880a3d26dd932b62ca2c209949cba2f4a80fbf1c2b9ac5a2abd4afc2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::squeeze_compute (cognitive 33): monoruby::builtins::string::squeeze_compute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11585}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dd726f893319e37a191b556684635c873200653b3d8f1e67e9d3ab37c52f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::execute_gc (cognitive 33): monoruby::executor::execute_gc has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":6483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d08a6bbfc7bbbb4e4ed09b566ce849aad4d8c8ca13b6d810510e302f9708d0"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::shl_values_raw (cognitive 33): monoruby::executor::op::binary_ops::shl_values_raw has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd81387fd8532ef10cae66906f8a36a021585215a3214f5ddd696117298b2366"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::unicode_units (cognitive 33): monoruby::value::rvalue::string::unicode_units has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2 (4 pts), boolean chains 1, 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed1045aade27564236003851ecd8c7cdb783ed0624da9bb56383aa0d71b2f82"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.makeTable::draw (cognitive 33): aobench-cpu.html.makeTable::draw has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 4 (17 pts), if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb461998a377fca4c70b99ef411552a9751eb0539f96fb4e766ab0d78efbbc47"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.makeTable::draw (cognitive 33): optcarrot.html.makeTable::draw has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 4 (17 pts), if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc9e0adcb4c6c549b90f0bf4fc5d29f5321fdb621afca43a89b6a0a44b81007"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.makeTable::draw (cognitive 33): viewer.html.makeTable::draw has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 4 (17 pts), if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1c5dcd3d81fce1b1a5736283acb5a2a2ab2d31f28e0f28b6cbc053e0780e70"}},{"ruleId":"D2","level":"warning","message":{"text":"Globals::new (cognitive 32): Globals::new has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, match/switch 3 (5 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb961d5cdcd1c733438c9c99d7478e9d2a07bbcaf591046b6ee7a07008ba66a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::handle_xml_option (cognitive 32): monoruby::builtins::encoding::handle_xml_option has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 5 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"655f61e668eeac24032c5056db63c22b2b0e577601ff7a5a40cacde245c05e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::method_return_target (cognitive 32): monoruby::codegen::runtime::method_return_target has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (7 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1a61536585dca65914f6636f3cfe69dc03e465332502fef06e487441834450"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::bind_keywords (cognitive 32): monoruby::codegen::runtime::args::bind_keywords has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b47118d0a26bf86110893be529838febc7722dccc53495398351cd6837200"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::collect_call_arg (cognitive 31): Lowerer::collect_call_arg has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (9 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8170513efef575b60181f4ca939f2dbe410273ac90e2fb6bd43ea6ed1c776f4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::prev_char_head (cognitive 31): monoruby::builtins::string::prev_char_head has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44cc273df4d34030b5c2374438bcf8163f20b207bd5503bcc75da3b7a2389a0"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::cp5022x_to_eucjp_from (cognitive 31): monoruby::value::rvalue::string::cp5022x_to_eucjp_from has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1237b2c4c1329a8e74aa8b12f943109177022f96615f4422db488458183e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.minmax_by (cognitive 31): Enumerable.minmax_by has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (31 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c2847618504b0424b01d3451cb57c1fcb85d37a89e5158dc7f80412eaedfc3"}},{"ruleId":"D2","level":"warning","message":{"text":"String.upto (cognitive 31): String.upto has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 11, ternaries 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/string.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9b39a459e5f0e38d59e49cd69117d0475450b8369a66e5a2f14265d9f8fe7b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::slice_ (cognitive 30): monoruby::builtins::array::slice_ has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 4 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4454}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c99531c4fc5e226dffdcfb3da02f2db6b0336735a6d468ef131390284b5735"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_class_read (cognitive 30): monoruby::builtins::io::io_class_read has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 6 (8 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d32f24b173ced96d7f0df38281fdfd1eedde81bb18c849a68019a3371e338f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::module::constant_path_segments (cognitive 30): monoruby::builtins::module::constant_path_segments has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 9 (12 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68984d9730c13c91167086d0216442dc5eaf5a5f7f3dc6871ab28f29db4f0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::expand_tr_spec_with (cognitive 30): monoruby::builtins::string::expand_tr_spec_with has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11140}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e61f07eed74baa14724c51f2bd39566287cc89a0d2541809adf21b501bf7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::collect_grapheme_clusters (cognitive 30): monoruby::builtins::string::collect_grapheme_clusters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (11 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12167}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3fd6dc706e331d242e95cb8fdd54f2e58973242ad6576e290ad7821dcef05"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::mac_replace_pivot (cognitive 30): monoruby::value::rvalue::string::transcode::mac_replace_pivot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4966}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d574472767575f323dcc56ef9b4e529d99119580a9603b1af6cf210accc0a1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::kddi_dest_stream (cognitive 30): monoruby::value::rvalue::string::transcode::kddi_dest_stream has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d0f8338fcac006471c6324f82cf1557ed6d4d02669c744ba576bb4418e5cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.max (cognitive 30): Range.max has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8796d1f73ada06e78be6ba6a3efd13e2f568aaa4b7e499f40f4f1b0e577153a"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::generate (cognitive 29): Generator::generate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6897bce5e2d2cdedf4a77abd5bebccb01b29407151afb8b9b8a6ce461c6501"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_mul_assign (cognitive 29): BytecodeGen::gen_mul_assign has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (6 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6284418d0b8704be5723deadf0eb71fde933ddad1629d81c605eee09df3054e"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::callsite_args (cognitive 29): Executor::callsite_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24843431225d187f7fda21c5055a40b087de0ff6d24373eaf4009adf99e7e15"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexpInner::tos_bytes (cognitive 29): RegexpInner::tos_bytes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"38efda9f5edfcfd409fccba2e7350ec3c1cf446775adfc0fa1efff1ac001f204"}},{"ruleId":"D2","level":"warning","message":{"text":"CharByteIter::next (cognitive 29): CharByteIter::next has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56f6eabb8a786e596330775aac748dcdb6c341df3389aa91d644f5ea3031767"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::rb_enc_compatible (cognitive 29): monoruby::builtins::encoding::rb_enc_compatible has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":5228}}}],"partialFingerprints":{"codehealthFindingId/v1":"197d585597f6cb4dd3cf112740aa85999ddf9373c8e934e0ac81e3dd98eed8af"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::resolve_io_encodings (cognitive 29): monoruby::builtins::io::resolve_io_encodings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e120e8bd71a5982187a39bf8610fb7386d603bc22c86a6ba33c578a57292aa2e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::integer::to_s (cognitive 29): monoruby::builtins::numeric::integer::to_s has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca4713704c2132fbaaa4b2ff755a8faa1bd068f470af431c3aac31bc74b26e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::shl_inner (cognitive 29): monoruby::builtins::string::shl_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (5 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"51062eb3582948d79809da887ee98a07af0538df6f9f9f75537c52cd4ec7cfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::tr_translate_cp (cognitive 29): monoruby::builtins::string::tr_translate_cp has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0205b6e160e94afbe100ba5633155878eacecd89077aaa83ef9d1c199a2d3610"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::scheduler::native::terminate_all (cognitive 29): monoruby::scheduler::native::terminate_all has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec7326cc7861044fb357ffce91e26c877ed77ddebd25619b00eac3b0fe7e7c9"}},{"ruleId":"D2","level":"warning","message":{"text":"IO.__class_write (cognitive 29): IO.__class_write has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/io.rb"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c2f9132f4a2c24076a45b2fc88db6423eb79ec1880fb1c5639dcf63779b573"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.overlap? (cognitive 29): Range.overlap? has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f753ceb99c207c506591bfe6ca95cd3a03e2f934cbb4b6f58b801146261d14b7"}},{"ruleId":"D2","level":"warning","message":{"text":"LUSolve.ludecomp (cognitive 29): LUSolve.ludecomp has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (12 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":"monoruby/gem/bigdecimal/ludcmp.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e3874c9b6c860e471abc886b045be3a82af2161943f090846bba30738b6032"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder.__escape (cognitive 29): Encoder.__escape has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8d1d9c1338ce58db8ce9590e40c0b1c476fe6d7ed506a8883eee163533f9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"psych_native::yaml_emit (cognitive 28): psych_native::yaml_emit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 1 (3 pts), match/switch 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/psych/src/lib.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3911121e3167c08cff543548e0239d44f646bb80f8f67571cbb3dff7331c513"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::build_return_segments (cognitive 28): JitContext::build_return_segments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (9 pts), match/switch 1 (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":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":4583}}}],"partialFingerprints":{"codehealthFindingId/v1":"6541f8b1f8b66dfdffd4b103030fcb12cfd1ae0523a08d0f1d110b3bfcc45986"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotState::new_method (cognitive 28): SlotState::new_method has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e60aca464200383d3feafbca6c8bfbb629d3d210d1a005e5e05ea7ce5f735f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::match_data::values_at (cognitive 28): monoruby::builtins::match_data::values_at has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ea5b23eb77a118da3e2ae539c0590046e94c1c45eacc74749d36ec1b474386"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::integer::int_round (cognitive 28): monoruby::builtins::numeric::integer::int_round has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f77af6a9f40e321c3a906f0d0794a8d54bc1102d25b8be77386273c1924465"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::spawn::run_exec_dup2 (cognitive 28): monoruby::builtins::spawn::run_exec_dup2 has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a31a57b008cbe1db7e6b6588d1ac42461d0d3abc9e227724112940df7bb8a46"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::strip_selector_offsets (cognitive 28): monoruby::builtins::string::strip_selector_offsets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc671a0c908a1974bb4276d207ba80b248485590243bb67a1c3a94bd38a1c86"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::string_pattern_replace (cognitive 28): monoruby::builtins::string::string_pattern_replace has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, loops 2 (5 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00c92e1689b173f04a3691de1fdc9ffe6f128169cdb09d69741b6c82533491"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::string_strscan_match (cognitive 28): monoruby::builtins::string::string_strscan_match has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb435642aa8bccfdf6665a8bef80868d101bd2a5e6ef90b9c1bd2ae909f9ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::scan_to_c_number (cognitive 28): monoruby::builtins::string::scan_to_c_number has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8849}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf028bef6ec05830136d12c301cad1c0d10a4474f4ef4ccd9c06c3210ea80bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::time_build (cognitive 28): monoruby::builtins::time::time_build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"27368f2807d8f85e3e49ee97aee42e5d7b13e8f1ab1569dee9429390610458d3"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::fill_positional_args (cognitive 28): monoruby::codegen::runtime::args::fill_positional_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fbc7072e47fdb30e2097b5f966a411f9414f7e985430f2e1c97dce88cc4d21"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::native_pool::run_op (cognitive 28): monoruby::native_pool::run_op has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/native_pool.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1876e40091c9a58711ede93f7fe7e8f9407fde7af684ba4629c8f71eb4d6c65"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::incomplete_tail_len (cognitive 28): monoruby::value::rvalue::string::transcode::incomplete_tail_len has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (9 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3190ec2b8e50d6c2fc393d1ecfcdd1e0b580cace518469051e48a24afb5ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::stateless_source_stream (cognitive 28): monoruby::value::rvalue::string::transcode::stateless_source_stream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5385}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a6b0e8b05aa3a8688b94feb87b06f50b25213c367b2c5d34c965d0d2012bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.size (cognitive 28): Range.size has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 2 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc80d71945decc4ed994589b36db05a71067ea9edc9f31f6795e2b909e40bff"}},{"ruleId":"D2","level":"warning","message":{"text":"Packer.__write_integer_value (cognitive 28): Packer.__write_integer_value has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a9f59b9d7d78c14318189fe97c7e1291b451eb4c9ba5107d099849df5eb074"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::settle_virtuals (cognitive 27): JitContext::settle_virtuals has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (10 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 5). 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":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"07078bf6f3e63a5fb88757ecb5f78aaf74c9fe1e670726b4ab721de352e16594"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::consume_virtual_index (cognitive 27): JitContext::consume_virtual_index has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11779f2a26ae9864c6b02a2691597ef636eeab7c5a4ab23f5619cf6d7935723"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceIr::format (cognitive 27): TraceIr::format has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cf0e9745c8beb804c6063e05648ca558d897adf8fa9e7be9a6b0b36505eec3"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::float_step_size (cognitive 27): monoruby::builtins::arithmetic_sequence::float_step_size has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b99d42729863895d25793d9cb1d4364825e64e517c8a67108af369e78b8bf3b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::zip (cognitive 27): monoruby::builtins::array::zip has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66fad1e7a80bfb2caa6c13f556dab1621abb111f6e409ebee191eacc1ad9de1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::dir::process_glob_pattern (cognitive 27): monoruby::builtins::dir::process_glob_pattern has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"75599a8f91e30ee6d10bf4c04522b63afe54a7e5dfce2302b505387e1ccbe7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::module::lookup_constant_with_owner (cognitive 27): monoruby::builtins::module::lookup_constant_with_owner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (10 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d52c7849c3c06345bc40300c04bcb698d73a2022ed57959bce6c2a70f4cf36"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::spawn::parse_redirect (cognitive 27): monoruby::builtins::spawn::parse_redirect has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbeb8515ca6f7012c03c15325b2623032741516b13c8c26cdc9f023117749bd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::shr_values_raw (cognitive 27): monoruby::executor::op::binary_ops::shr_values_raw has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"1603239473ed43d4919aa84161b6ed29137ec1117dbaa315b835d3e200a11c15"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::globals::prng::limited_rand_into (cognitive 27): monoruby::globals::prng::limited_rand_into has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/prng.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e33cb897489c7607e796162cbf6b3492105c88bb87c366170ea2b925f4438fc"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::enc_mbcput (cognitive 27): monoruby::value::rvalue::string::enc_mbcput has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4b4d80acd9d7aaf9b3f423ce736296ae683db5c0158cd847a254b6b6a2bfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__cover_range_q (cognitive 27): Range.__cover_range_q has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"670b8b00ef54090c7556cd2b76f5009063b68b9acfe4bc818cfba301dd5c689f"}},{"ruleId":"D2","level":"warning","message":{"text":"Window._pump_events (cognitive 27): Window._pump_events has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aecc0d3400daf311515e94434b31a5a05a944c6b41dca5b5e974fa3d6d6972"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket.udp_server_sockets (cognitive 27): Socket.udp_server_sockets has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4e5d5b7a15202cce9bbc1f2c11d9ba3550b1712296f5edea2d77e76ff61e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"StringScanner.[] (cognitive 27): StringScanner.[] has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 1 (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":"monoruby/stdlib/strscan.rb"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad3775ad7d8be3d5489899d3d01f0e038bcd5bc475675c9069288626a37083a"}},{"ruleId":"D2","level":"warning","message":{"text":"nokogiri_native::html5::output_node (cognitive 26): nokogiri_native::html5::output_node has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (7 pts), boolean chains 4, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7b6c24248df4777041371d49ece4331c5985eddb6f8e8a5f6f3708e4829c13"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::handle_super_forward (cognitive 26): BytecodeGen::handle_super_forward has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call/arguments.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4033f01636b0e38d018326df01946dcc35e92836fe56c1dd9348660628ac67"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::parse_f64 (cognitive 26): monoruby::builtins::parse_f64 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 20 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa457d8a444e12a4e3bd704b621a4a1daad4d71f418d0b036548452c767351a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::retain_with_block (cognitive 26): monoruby::builtins::array::retain_with_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d788b88f9835600e8116a45e47a94a7ad798e68526d559c5a056f5dce385ea"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io_buffer::buffer_map (cognitive 26): monoruby::builtins::io_buffer::buffer_map has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (23 pts), match/switch 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e43c96f02cdf72ee8c23848174ec7bdb99bfa9a9d2102a75553ec82791e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::proc::signature_string (cognitive 26): monoruby::builtins::proc::signature_string has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (6 pts), loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70e852fe9bad2c983a7db05544821d3dfc2fe221ba0193ac2f6a8894180b71"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::set::disjoint_ (cognitive 26): monoruby::builtins::set::disjoint_ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (monoruby::builtins::set::intersect_) 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":"monoruby/src/builtins/set.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"830b9dd1d80eb4ab2f621b1bad6df4ae598328fd787a4d5531fa4ba1aa274767"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::set::intersect_ (cognitive 26): monoruby::builtins::set::intersect_ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (monoruby::builtins::set::disjoint_) 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":"monoruby/src/builtins/set.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ae706867e8de48197819790b3e78d04df5134b4656410d2ebf2cdfc37cb842"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::chomp_byte_end (cognitive 26): monoruby::builtins::string::chomp_byte_end has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4118}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b75870a859a3e7bb19d36ee399de8a36305f21dca983971f352aa3dd9387fd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::from_args (cognitive 26): monoruby::builtins::time::from_args has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 17 (23 pts), if/else 3 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"monoruby/src/builtins/time.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"5166f6bb9cfb4a9e8c98a8cca0c77355b014ace4d8f0c78adc6fb0ef2010fe92"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::format::format_hex_float (cognitive 26): monoruby::executor::format::format_hex_float has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (23 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb47159420612694c629a45fd764bb4d00d85aef0faf69acd2368b212a0c3392"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::globals::gvar::write_special_check (cognitive 26): monoruby::globals::gvar::write_special_check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 4, match/switch 1 (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/gvar.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d7b4207f43c5173c100cbda521a8107c557c52d8acb600b0dbb847bd11af9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::base64_decode (cognitive 26): monoruby::value::rvalue::string::pack::base64_decode has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec1179fd1f7ceb77e73eda324a14a2dc723b2d3c8c7e1ec1cb205ebd069fb59"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::stateless_dest_stream (cognitive 26): monoruby::value::rvalue::string::transcode::stateless_dest_stream has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5840}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5430481f42260d7339611b1098b6d2ffb11e6bacd05bf521d5db4e04193ebd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.bsearch_index (cognitive 26): Array.bsearch_index has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 2 (3 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4576b36fe122545de749fb94b8d6fae097108fb4f74ad0890956cdc90a6b615d"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.permutation (cognitive 26): Array.permutation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1341b42bc27a07c33fa78f5dc0038ffc7b6c7c23f790f6011d63e64a2b1b6507"}},{"ruleId":"D2","level":"warning","message":{"text":"Exception.full_message (cognitive 26): Exception.full_message has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/exception.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df0f378544fb91a91a46744656dd700247cc4cc35e8c6654bc8bb6764f2f3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Hash.transform_keys (cognitive 26): Hash.transform_keys has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/hash.rb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5e736efab760bb1d727f19df4f67adf124b7455c6ff1f18b4ed614acd21fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.drawTimeline (cognitive 26): aobench-cpu.html.drawTimeline has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa618632e5e91316a3cccc198d90272a940f0bdf400ea81f364d77aa611ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.drawTimeline (cognitive 26): optcarrot.html.drawTimeline has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc8fd06ef2323cc18f5b12d929be213e6085182a4409f335c66cb3baad647a8"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.drawTimeline (cognitive 26): viewer.html.drawTimeline has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bab37a062dda0e9762e4091f1fcadef24811f4568cb7f9c84019c35951f24c"}},{"ruleId":"D2","level":"warning","message":{"text":"nokogiri_native::node::reparent (cognitive 25): nokogiri_native::node::reparent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10b5f8a68bce1e5d8c4da80d53527973ab0c897906c29ea3996f509deda1597"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::specialized_iseq (cognitive 25): JitContext::specialized_iseq has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b236149f0adcdbc73f346c5ff363af82dfed047d6df8d70777ce93cfdd11db51"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkMode::from_caller_inner (cognitive 25): LinkMode::from_caller_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 7, match/switch 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d1c74f41fd5e50edd5ecc9a8dcf19cabfa8e3ea17ecc4ab8c45fdd6003f343"}},{"ruleId":"D2","level":"warning","message":{"text":"JitModule::gen_chain_replay_stub (cognitive 25): JitModule::gen_chain_replay_stub has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (12 pts), match/switch 4 (11 pts), if/else 1 (2 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"4728a0a090a4a1e2c5f8f55a892862851c946f310b440175fa46376fbf3c6c61"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::get_constant (cognitive 25): Executor::get_constant has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 6 (10 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5238bf6d3a335772e0eb9dbb5ed1b3bc1f1112cce05ef2669152cec89483eb95"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::str_escape (cognitive 25): monoruby::builtins::encoding::str_escape has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e98f79e036443683470aeb0fe1021b7cc7f21d89007c44a2f34db0de1a415f5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::range::minmax (cognitive 25): monoruby::builtins::range::minmax has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e041ab05c50fa9384cfeb58712cacdab92136980ed0964b1c94adb1aed1a673"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::enc_succ_char (cognitive 25): monoruby::builtins::string::enc_succ_char has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e550a822d48ddc38c57afc39f30f9818bd0cdcfd71a7c98e8ca52f836076da"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::regexp_source_desc_bytes (cognitive 25): monoruby::builtins::string::regexp_source_desc_bytes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5518}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a926fc02dce377aa9aff18177c8627578f6ca4cbdce3ccb778cfd3ad13b7e82"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::split_with_separator_ranges_aligned (cognitive 25): monoruby::builtins::string::split_with_separator_ranges_aligned has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8563}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fcc932294d097c0fb608917c7fec12cac25c96705508404f8c08e9b071ac50"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::directive_core (cognitive 25): monoruby::builtins::time::directive_core has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 6 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e20402393266c5451c912da880b80f25dabc45a4b81a6f3fdef9d6b55cc40c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::invoker_arguments_inner (cognitive 25): monoruby::codegen::runtime::args::invoker_arguments_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea78278c0221e297a1f44d6fad9d2a92ce9f93e2c5921ed36c6fa9b05af093b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::carrier_hop (cognitive 25): monoruby::value::rvalue::string::carrier_hop has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (10 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":7191}}}],"partialFingerprints":{"codehealthFindingId/v1":"74765ebdf2899679f7f17161b5b136ae820de22b3fbd8a0f6cb3c060241534dd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::base64_encode (cognitive 25): monoruby::value::rvalue::string::pack::base64_encode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a8c008cfac1d5ec85e4224bfa716b9fa2891a01846e9167d1b51b351f6d94c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::qp_decode (cognitive 25): monoruby::value::rvalue::string::pack::qp_decode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f24e758cace5e4f960474694bbd08076d8952d558dedfa28b6aba838d5e4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.initialize (cognitive 25): Array.initialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"02824d7d0f4b6974b7230f3a47f1680f7e0b6c89ae42295857c526890af67a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.inject (cognitive 25): Enumerable.inject has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"be501c8c6af1def56102b73069b0383d95db56bc09c03be63f957e160b3f1387"}},{"ruleId":"D2","level":"warning","message":{"text":"Pathname.plus (cognitive 25): Pathname.plus has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (6 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/pathname_builtins.rb"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c690d56483ccff9ccd681496a20deaf14a960f39d0008b7500b559450a2a06"}},{"ruleId":"D2","level":"warning","message":{"text":"BigMath.atan2 (cognitive 25): BigMath.atan2 has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 6, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c63afe5ef096327beb4dd166a53b88cd9d973c16e1406cac3425e37cea7891"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.initTimeline (cognitive 25): aobench-cpu.html.initTimeline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4, loops 3, ternaries 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 638, 657, 647, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"260d72c782d5b79398565a134d3658b586955f135b845573daefafe45ebeb716"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.relatives (cognitive 25): aobench-cpu.html.relatives has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 11). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 972). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfb0abdb6fde08af6c95de013fafca068867b644429bc3df2328af4a5f1ba10"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.initTimeline (cognitive 25): optcarrot.html.initTimeline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4, loops 3, ternaries 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 638, 657, 647, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6292e64055badb521d004a1258db5c34e96fbba80defca54583d0a3946dfc3"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.relatives (cognitive 25): optcarrot.html.relatives has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 11). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 972). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c676c37b86f5d91012ba2c8a58e20a9b9e264c29162f9c34064e4f08a7cc4b"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.initTimeline (cognitive 25): viewer.html.initTimeline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4, loops 3, ternaries 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 638, 657, 647, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c449d723e1de160458b0e9bf056d28715881807e7b9b1b7f153259127ee024"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.relatives (cognitive 25): viewer.html.relatives has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 11). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 972). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2ca88fd39c672edf36551efa2adc3307c65afb5f29ea3a6d55f7219ded7dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::analyse_backedge_fixpoint (cognitive 24): JitContext::analyse_backedge_fixpoint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c41bb01bac8701c00a754267a75e48dd6d09bb307d0570fa1b9fb457fb813f"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::attr_reader (cognitive 24): JitContext::attr_reader has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f0677b8686509385673a31bf82f62db6070d1cae562ab47bb34bd4a0187280"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::try_splice_exit (cognitive 24): JitContext::try_splice_exit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5, match/switch 4, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b259150b728b5aa8255dfc324ea84b9b5a39ae6cf8e88476531ecd771f7a247"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::gen_bridges_for_branches (cognitive 24): JitContext::gen_bridges_for_branches has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5e29d1cf91252e7362970e5407bc6a6421bd6a2f4df20598fb318f18af5f18"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::search_constant_no_missing (cognitive 24): Executor::search_constant_no_missing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b92856e6b65f9043efa553fd2e044ff2917a6e0e0102ad35b12b8eb918a036b"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::check_super_at (cognitive 24): Store::check_super_at has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5a516d901a673387f4c7f396a7ea3716e987a18e22dc9a6066d6dc65801aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::lower_hash_pattern (cognitive 24): Lowerer::lower_hash_pattern has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (8 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eda15add1aa89e9a1d6fbaab0e50d2abbbb0846b371d1ab7ad15692988548c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::lower_call (cognitive 24): Lowerer::lower_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1666020199d4ed19e1c2ffec7f72dabf220082c373573d8be6ae922c0036227"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::converter_new (cognitive 24): monoruby::builtins::encoding::converter_new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9c9f476d3a9f56104951ce08236c685c3c11ba654b9f05ff00e700cf8d8202"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::hash_bracket (cognitive 24): monoruby::builtins::hash::hash_bracket has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (9 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a1c4a34cc24379f5200ec9222ccb9b0714943030e7c82529d51b15850e87e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::env_merge_bang (cognitive 24): monoruby::builtins::hash::env_merge_bang has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"105935cfa755fd2c3b74a4584b27d742f8d4c7cac08e95eee2e846de40b85d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_reopen_path (cognitive 24): monoruby::builtins::io::io_reopen_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"111c156199bb39925b54698de8ee0ecfcfd6820d18d3f46878e02d1de30b3c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_complex_literal (cognitive 24): monoruby::builtins::kernel::parse_complex_literal has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a12efbe654c9af6192f472e2be9207239b1d85d2d76556dfef3c9dfe2e05c03"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::scrub_inner_with_block (cognitive 24): monoruby::builtins::string::scrub_inner_with_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (9 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12876}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c22da47b6d4b5a497be82f113d56e2d12bbd82b02f9f632367c33f3191505"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::format::format_g (cognitive 24): monoruby::executor::format::format_g has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a41ef6c05a6c43d76e6bfa23fe4bfc091876eba9f311219d03bbd0dfd07b8c3"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::byte_class_bracket (cognitive 24): monoruby::value::rvalue::regexp::byte_class_bracket has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":4342}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc84376209132a4d64c01c8ecef765cb6c8b16cc1a0c6d7435cec200b824d26"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.bsearch (cognitive 24): Array.bsearch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"164897854a5c8321338f2293ebb58aab3ac240601f3b108d8f2c027ef6d76487"}},{"ruleId":"D2","level":"warning","message":{"text":"Kernel.warn (cognitive 24): Kernel.warn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 2 (3 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/kernel.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca315a0d27d152ecf14aaa801ede62aac3ba89ba8ac4c64ffc40c48981c0e8c"}},{"ruleId":"D2","level":"warning","message":{"text":"XPathVisitor.visit_function (cognitive 24): XPathVisitor.visit_function has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, ternaries 1 (3 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/css/xpath_visitor.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9a13e9ab3f888f45e9f27f3881413a7ade12c6799454be240771a77b3ac7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder.__encode_part (cognitive 24): Encoder.__encode_part has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce885de382cf39329112e1458631ba53467c4e0beed06ab1be160aeace27e310"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::may_consume_virtual (cognitive 23): JitContext::may_consume_virtual has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 10, match/switch 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":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"be23584984db3ff242f910716a733cae45f710382301abe6ea560b1a3cf6a298"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::a64_gen_chain_replay_stub (cognitive 23): Codegen::a64_gen_chain_replay_stub has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 7 (10 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1670dfa0e6f58749a1bc65fcb7fab318fe392452350225dc6fb1a59341f1d5ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::compile (cognitive 23): Codegen::compile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/compiler.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc20c3cbcaeeccf443d9e50ad2b44b7f8f1e59f62af1506d8bedc7908a025957"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::get_method_names_inherit (cognitive 23): ClassInfoTable::get_method_names_inherit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec4c1861360e554a479c0da7fe5f978c822b73bc28057f3f2a76556c195dd4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Stacks::json (cognitive 23): Stacks::json has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc05ecfcf10e9bfa9d340297bf72ccb4d1763b578fded9961d6e28ff9b1b0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayInner::set_index2 (cognitive 23): ArrayInner::set_index2 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/array.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c539dec36160ce06e14febbd56574bf8e3fc3f4d040ff4dcfb8147fc5a97e6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"IoInner::getline_units (cognitive 23): IoInner::getline_units has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4683354c49bdc83d028cdb063026266d85b31b9c3e35e9464dbdacc67db53d9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::array_find (cognitive 23): monoruby::builtins::array::array_find has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4acc159a4f41d3f19373688a6c28550ec718f79fd3d43cb5f72bf0844d5719f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::parse_open_encodings (cognitive 23): monoruby::builtins::io::parse_open_encodings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5c6547b76c98fc65d41e85f92a2cd7a7965712f7364b6e1bcdc7d74891621c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::blocking_io_region (cognitive 23): monoruby::builtins::io::blocking_io_region has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eceda95742be09996483c5de42da576e9b1c4028f9ef503ec7ebba85838e3c5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_hex_float (cognitive 23): monoruby::builtins::kernel::parse_hex_float has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e7212f6fe0a7916c13f58eb2b510ea9a321e2d23b17f501b23300fc09096a6"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::module::probe_constant_path (cognitive 23): monoruby::builtins::module::probe_constant_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"168ec555382eb1ef1f513e6699acf002f74a77abc4bdfbec85364995d22c6f38"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::spawn::num2uint (cognitive 23): monoruby::builtins::spawn::num2uint has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b448aefe1f0c45daa6b2fa79c4ef98401b71f3a560fc00647cfe05366ee78a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::string_start_with (cognitive 23): monoruby::builtins::string::string_start_with has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (8 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb719cffc259f8efd709f16132aa87063e77c525c89dc43d6596b11452e1b16"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::line_ranges (cognitive 23): monoruby::builtins::string::line_ranges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8342}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff63973e16f555edef332d8931c1e7449db7367ce08c8171ec143a5e4a11a29"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::byte_case (cognitive 23): monoruby::builtins::string::byte_case has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4 (7 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":9495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7955783c9533adb1ca2c597c59832d98c8f9d132cdd22b0e06702de5faaf6e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::materialize_lazy_at_callsite (cognitive 23): monoruby::codegen::runtime::args::materialize_lazy_at_callsite has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de4d5cf8fbb272095ed6c52307f9c55ab098837cef3c6354fbda6086961bcba"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::binary_ops::pow_ii (cognitive 23): monoruby::executor::op::binary_ops::pow_ii has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc3d3000ea02ede03be855a2a4e3122866f91a12dbd0c3f57f07472e59ac220"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::jis_family_chain (cognitive 23): monoruby::value::rvalue::string::transcode::jis_family_chain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":8782}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1049d523e954d5aafdd7424a31eea76bc03dd998f50936e74a1ecbbf0ec688"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.one? (cognitive 23): Enumerable.one? has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (23 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f6d825327582ace0edd369ee141294761735c32915e1d92bd010aa14e06f12"}},{"ruleId":"D2","level":"warning","message":{"text":"Allocator::gc (cognitive 22): Allocator::gc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b24a4382e10b49342fefeace2060be3c3f3dd562b4b80126cafe558fb911ea"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractState::binop_integer_gp (cognitive 22): AbstractState::binop_integer_gp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd6c4d789112feaeaf35c0daeca79717e18bcc0ca4fa69694820e2b71bdacb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::jit_set_arguments_forwarded (cognitive 22): Codegen::jit_set_arguments_forwarded has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (8 pts), match/switch 1 (4 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a60bb17898815636064b7d276c42d8660af5e128e1eb689e572eb0ae159446b"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::find_constant_impl (cognitive 22): Executor::find_constant_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"8237492c3f70a0cba27355b1f2575cc83e82db980c96b9d018bb23f3922c8116"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::argf::force_stream (cognitive 22): monoruby::builtins::argf::force_stream has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f22be2c386bd4cbc640974b32137e7f9e0a0c0882d2b81a40407324a7a9ff1a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::transcode_with_fallback (cognitive 22): monoruby::builtins::encoding::transcode_with_fallback has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3ef759ed7c2ff66647acdb62743760c4e8ea50df1036687903c543d9c56055"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::econv_opts (cognitive 22): monoruby::builtins::encoding::econv_opts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbd88e9429f1e057c1cb42bb642966ba0f41496748b5a0913adfd9a6fa240a5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::inspect (cognitive 22): monoruby::builtins::hash::inspect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8f2cdcc5dd8dbb51f78e4e4928006ee921d74b8ccf6f233dcc82657dba187b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::class_read_opts (cognitive 22): monoruby::builtins::io::class_read_opts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff28c197c6c29ab798c1bf1d3c0aaa183f40cac12858ec7d6d1c36b7f37f35f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_pipe (cognitive 22): monoruby::builtins::io::io_pipe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3140}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd22f17a3e358429dbe4f5e63a4927b94a2825d3bb31bb2976ca6f91d888930"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float::truncate (cognitive 22): monoruby::builtins::numeric::float::truncate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bdd3fc74098422bb4d0711fe286bb6fc25d9587981f20d9456402a95efc850"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::process::process_kill (cognitive 22): monoruby::builtins::process::process_kill has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c040204f819e1265b26d548684c53e889268ce174fdc74a58f8a458ea764e10"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::enc_pred_char (cognitive 22): monoruby::builtins::string::enc_pred_char has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bcae0d8b508808c2e3b2e38e7d3ef12fd31d158bc593cefde172ccbb59b024"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::jitgen::context::max_virt_fpreg_id (cognitive 22): monoruby::codegen::jitgen::context::max_virt_fpreg_id has cognitive complexity 22 (threshold 15). Drivers by points: loops 10 (19 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177a8d7fd10bb2dea32cb40b056a596b8b22f98f889cd9ecf5d99234b2c6434"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::range_fold (cognitive 22): monoruby::codegen::runtime::range_fold has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd98eb8db15a8c0009cc5b56fc4c7713912999bb3ef57544934c975f2593f51"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::get_index (cognitive 22): monoruby::codegen::runtime::get_index has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"09970615e4416223892ca8be70c3a421036ef92cac279dad147daf1afba2673e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::iso2022jp_to_stateless_from (cognitive 22): monoruby::value::rvalue::string::iso2022jp_to_stateless_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cad329c63264acfe37bd8eec8d2c9e4a9315f22bb663d14c31393638e8652c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::pack::qp_encode (cognitive 22): monoruby::value::rvalue::string::pack::qp_encode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb498eeb4767f424bf96e628883b786260b6a147b92c618b7550b0899a823a04"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::first_bad_utf16 (cognitive 22): monoruby::value::rvalue::string::transcode::first_bad_utf16 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":8508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a414a7bee4637b4cba9ca97d76597e49d50bc196a91bd06cd16c7c20b9f139a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Comparable.clamp (cognitive 22): Comparable.clamp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/comparable.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba4478ca5eeac516e270ef9937d1307139f20634ae1289799e8277b27dea250"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__range_step_succ (cognitive 22): Range.__range_step_succ has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 4 (7 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4c8f709b471aa24cf87aade1e1d87250b252fc8c8505b05c295831982a820c"}},{"ruleId":"D2","level":"warning","message":{"text":"Struct.dig (cognitive 22): Struct.dig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/struct.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da5d3294da2757cff37b2de8e9cad36ba2dbf8f4d469d30b472d225d8cb70aa"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.viewMethods (cognitive 22): aobench-cpu.html.viewMethods has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 6, boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (drawDetail, a function literal at line 1034, a function literal at line 1007, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233eae95a634ae01068679e572ec1a06fa759781661153ecff0d4070d0eb75b"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.viewMethods (cognitive 22): optcarrot.html.viewMethods has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 6, boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (drawDetail, a function literal at line 1034, a function literal at line 1007, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"46baeb807fc99a32319a5210b86a22e2b2943eb580efe8675c8370c6f0e039b1"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.viewMethods (cognitive 22): viewer.html.viewMethods has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 6, boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (drawDetail, a function literal at line 1034, a function literal at line 1007, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9211b727a321128914f9c3c595572f8d2f6808030d8771c403e2af43abb371"}},{"ruleId":"D2","level":"warning","message":{"text":"nokogiri_native::node_set::slice (cognitive 21): nokogiri_native::node_set::slice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 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":"ext/nokogiri/src/node_set.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ec4e06e5ff864b27c8d440c013427684dfafb061096dce8def9217206c8b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::consume_virtual (cognitive 21): JitContext::consume_virtual has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 5 (7 pts), boolean chains 5 (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":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81e14a3894a6ff2f13aac41605d128c047cac5cbf580629d6a94afff4498ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::pic_groups (cognitive 21): JitContext::pic_groups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/pic.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"658d9b5e66ffbac6ef937397d18a28ff2dd72e5d7476b1bc8eb916463855a0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractState::fill_window (cognitive 21): AbstractState::fill_window has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5, match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcc9d9c717a42b560fac41ace936595d109ee4a013fc3e459ff621a2a963a39"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::propagate_prepend_to_subclasses (cognitive 21): ClassInfoTable::propagate_prepend_to_subclasses has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c7a3c49a0aa82b2b80e279c146fc064a0e7408295d84c6c1746d9acd0bdb58"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::fnmatch::expand_braces (cognitive 21): monoruby::builtins::fnmatch::expand_braces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fnmatch.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3186d97dba3f7fe3b55be141bd84d4e5591842268a395af4b3d086bbd893afb"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io_buffer::initialize (cognitive 21): monoruby::builtins::io_buffer::initialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"153180a52ba0076f74de325f4999f0adbd16eefb7f82ffb60f60289df9d3b3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::make_exception_error (cognitive 21): monoruby::builtins::kernel::make_exception_error has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da74a6a9b1dedf94417359444162c272224b1f464e95afbc18297847d1ba7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::module::define_method_in (cognitive 21): monoruby::builtins::module::define_method_in has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86d3cbb3ce9b630eddcbca732c9214c3747c8fd21bd2d526fb89d1fe3833377"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float_divmod (cognitive 21): monoruby::builtins::numeric::float_divmod has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc597a152e76f19a6d5ec62068f6757aa11ada87715f237e2bea88bdedf05673"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::range::count (cognitive 21): monoruby::builtins::range::count has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce228db2309ef25310a0551e27e8ce70ae5449f9074324c2bd27c5f106bb671e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::byteindex (cognitive 21): monoruby::builtins::string::byteindex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1222f716f125200f4828929c0537f08851074bdd4fef24eb0bb4ada8b1791b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::concatenate_string_inner (cognitive 21): monoruby::codegen::runtime::concatenate_string_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"83283b156263622896833967de0a32c71133e27f88d729910a4c155f99cb06c1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::append_piece (cognitive 21): monoruby::codegen::runtime::append_piece has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5626fd34c8e5061e78abb5a8f3b3df71bc7713a7e34a189e07264963a01a10d6"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::defined_method (cognitive 21): monoruby::codegen::runtime::defined_method has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"debce223095bbad61d513f105b2261e5f614c58649569a47ca101d96fcf4ceaf"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::utf16_32_first_error (cognitive 21): monoruby::value::rvalue::string::transcode::utf16_32_first_error has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4795}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1bc26985bfe14a6a6248aed34694674847827ed15fe47cb6b5db1b06c2efb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Hash.to_h (cognitive 21): Hash.to_h has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/hash.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d6899db5468339a61df5f7024c23cf46b7fa62ec3629e926e4ebe71f0747d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Ractor.__shareable? (cognitive 21): Ractor.__shareable? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/ractor.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06e9672a06f3e409a6fe763d24e0fc237f2d521a565ab81d782954425b71b21"}},{"ruleId":"D2","level":"warning","message":{"text":"Struct.values_at (cognitive 21): Struct.values_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/struct.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d435c3c61044c26252be39160fe8c56730536a780af5b7f698b4bf4189857"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder.initialize (cognitive 21): Encoder.initialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (21 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb70dbede9ab18a4c126dd132c306368b60b4832ac6d942f10bd70aa68e4bb91"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.el (cognitive 21): aobench-cpu.html.el has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"76031c836683b1c7bd7885dd4a2b0b8229e9cec9ebc8d80166572c8984416bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.el (cognitive 21): optcarrot.html.el has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f924f01d090680a50b6f86ab18e3beed95d21b2c5587226b1e01f9bee5a2d81"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.el (cognitive 21): viewer.html.el has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e74cc70469118c9d96eb17edce2f480a5eee4e33904c789460be41daeb20f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::ensure_valid_encoding (cognitive 20): Generator::ensure_valid_encoding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fd97ab6b58ed1e647e4e73f51ce225cbf241461deb2b2f86828e6f19c935b6"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_for (cognitive 20): BytecodeGen::gen_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c60a8bea888ce48a8022225fc035d5011f27cd1598369248819f262ae0f4bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::compile_pic_call (cognitive 20): JitContext::compile_pic_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/pic.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b98ec1b0f763546eaa6e0a509093e12f055d664fe63c8d09673a79e0547e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::jit_forget_unit (cognitive 20): Store::jit_forget_unit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"988fc265a8ca5e2ed766421c26b4c9a7059443936ea01bf43f6c3cb2b82cf44d"}},{"ruleId":"D2","level":"warning","message":{"text":"HashRef::debug (cognitive 20): HashRef::debug has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c556a9a99b6391ad6e5dbe4277701c5fc1923a64937cf3c788b5d1b0745e130a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::all_any_inner (cognitive 20): monoruby::builtins::array::all_any_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3774b6f4708adf4971393eb0c3a244165eb2cfb5e41ed8defdbde3ff821a9484"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::enumerator::enumerator_inspect (cognitive 20): monoruby::builtins::enumerator::enumerator_inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/enumerator.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd59b09095667766a3f0c18eec7bad5d8b65e7a667c5699dfda05da73663e27a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::file::file_binread (cognitive 20): monoruby::builtins::file::file_binread has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d108639deb59cbb06ac0a23a15c698784e64511697da5f4802f58c182ed95f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::fnmatch::match_bracket (cognitive 20): monoruby::builtins::fnmatch::match_bracket has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fnmatch.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cd67b9c64f68e9dc205216d4d28c338c3d2de0b4e669f4b571f85d8708c70e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_kernel_integer (cognitive 20): monoruby::builtins::kernel::parse_kernel_integer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee12025560748e99010f988c1558da90e3579674e46d7e9560ab666ef7a577a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::rational_from_value (cognitive 20): monoruby::builtins::kernel::rational_from_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea6fc3c684c62ef96d04f554498570f7ae5bfa853303dbb568818c584844f84"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::match_data::inspect (cognitive 20): monoruby::builtins::match_data::inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae856cf585c81f71af5ad4449cc38f12fcb36fed977125cd262df6d5ff605ef"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::range::max (cognitive 20): monoruby::builtins::range::max has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70b0220d59a89bf7f435d9d0bf370aab3f03ad617dbdb8ec34b8aaf700267b7"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::regexp::build_regexp_inner (cognitive 20): monoruby::builtins::regexp::build_regexp_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8188319aa8cfab2c37e2b34d2dfe1f1bb04c93f947f9f0fd5907a8dcc2791433"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::wide_regexp_source_desc_bytes (cognitive 20): monoruby::builtins::string::wide_regexp_source_desc_bytes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2710428e30f83b1b00ec039f2bfccee7a2cdd92f6d9b44911159a73e8e26cbce"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::delete_compute (cognitive 20): monoruby::builtins::string::delete_compute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10699}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0d4ff1678780d23cfb3cf649f52e44435eae5d06913c4ffba67b97b3b1010a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::time_at (cognitive 20): monoruby::builtins::time::time_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8505bbf54f61b54bf66d1947b659cde2a48d731f6ef216bc47e5fa08e43625"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::globals::dump::render_cause (cognitive 20): monoruby::globals::dump::render_cause has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 3 (5 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/dump.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ba506772e179231742376d203b6a62e4c3013a5bb54fb5a55f9dd533f3c2ff"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::prof::elf_functions (cognitive 20): monoruby::prof::elf_functions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc82ffae18809c2d01f6e3c3f347f23163d2f89a9a62ea929b5ea19b63d03260"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::scheduler::pass (cognitive 20): monoruby::scheduler::pass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b8b39ef13ff220391d33cbae73be3436cb1eff8646d828ac3e1ad4dad36434"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.rindex (cognitive 20): Array.rindex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fdd5c91d6182997a3fbbf55f1ae2fa4b02e139aafd8fcb46fe90a5554e2e91"}},{"ruleId":"D2","level":"warning","message":{"text":"Numeric.__step_size (cognitive 20): Numeric.__step_size has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6, boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1954e11240a0398d5b6871968a5b94b8f3ec41630f56963a663ed73c451274"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.include? (cognitive 20): Range.include? has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f4cf2448c9f400a99ffde03ab1661ce12543ef8d8014e78323875664585d52"}},{"ruleId":"D2","level":"warning","message":{"text":"XPathVisitor.visit_element_name (cognitive 20): XPathVisitor.visit_element_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/css/xpath_visitor.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38dfc0586980bb9a269726684191b091fd57e8f71f0d92e2b9be2ac379cbe9a"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.viewOverview (cognitive 20): aobench-cpu.html.viewOverview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae3e24b561133e6075d6558b92c9256a7524f3f695f923d0b1a9cc0956ca900"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.viewOverview (cognitive 20): optcarrot.html.viewOverview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f01c3ec97fae81d17b6ff298dc3524c71aa4bc9956049ac097f961ff09c60e2"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.viewOverview (cognitive 20): viewer.html.viewOverview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38ce4a72eb47a7382a393ab553729823dbefb90ed0dcce576a3912551f116cf"}},{"ruleId":"D2","level":"warning","message":{"text":"psych_native::yaml_parse (cognitive 19): psych_native::yaml_parse has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (13 pts), loops 2 (4 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/psych/src/lib.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aa0cd13699d9f29387be447c6bf48d50362e29c8f6e9229e7581071d34583b"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::gen_regexp (cognitive 19): BytecodeGen::gen_regexp has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (7 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f1075a710906d42053f3da734d751b8973571ab1f562d5ca162380cfdbfd0e"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::consume_virtual_expand (cognitive 19): JitContext::consume_virtual_expand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecae09998ebd3512a2eede6c175a2189983bc79b58597fd2d329fe2a62e0a40"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractFrame::guard_class_state (cognitive 19): AbstractFrame::guard_class_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"170bc1d6933a80fb5ece373ade30996e5e16d65b95d45fb9fc4ffd8b986a44ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::eq_values_pure (cognitive 19): Executor::eq_values_pure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2db0f28c8be7150831a0ad9cf300e5b3b248814f8d2296400d412b1fe8f5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::mark (cognitive 19): Executor::mark has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 6 (7 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f37f85d99fc7eb36134154923e1201a30dd1519ef44f3fd4f6cbdee93b01f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::propagate_permanent_name (cognitive 19): ClassInfoTable::propagate_permanent_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class/constants.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"31461ee7d52c7cf522cd68f49c457e9a28d15c4d564ecc3f03253efe64637072"}},{"ruleId":"D2","level":"warning","message":{"text":"RStringInner::propagated_cr (cognitive 19): RStringInner::propagated_cr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa3f7ce5515b84d8766f2a53ba67c63342d826c1287c83f3da388b5251d8bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::encoding::parse_transcode_opts (cognitive 19): monoruby::builtins::encoding::parse_transcode_opts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc26decd1facb7e1964bbc8a70014c7de2c30c99d6924491ec0a032679988a1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::respond_to (cognitive 19): monoruby::builtins::kernel::respond_to has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":6066}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab1a8fd5104fca9a4715a7eebe9efcb53bbb7a757efe532b039965c93141aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::match_data::index (cognitive 19): monoruby::builtins::match_data::index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a7494e2b94f12b0db9583402d09e86723c28e11a06010bb462a0068445381c"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::object::object_ne (cognitive 19): monoruby::builtins::object::object_ne has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8568eb08b9e7374a78381311bad433783cbf2711d3c602a1231cf38420bd77ce"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::regexp::regexp_inner_from_parts (cognitive 19): monoruby::builtins::regexp::regexp_inner_from_parts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 6, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8195d3cf4d5db164426105eca8e25393540108c8157802a40ee8e7d7949275"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::format_offset (cognitive 19): monoruby::builtins::time::format_offset has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 3 (5 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3732}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4cdf88842ecd3182a850fdf61a81b5f443865dd199643b2a6112b919495d02"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::forwarded_set_arguments_core (cognitive 19): monoruby::codegen::runtime::args::forwarded_set_arguments_core has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fe120431d0e08f1b76f6ea52b3d9c379189b53a16d88c19a23890668e92e46"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::fill_closed_std_fds (cognitive 19): monoruby::executor::fill_closed_std_fds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c497d73aed9c25597acf7832adba724ca46a804a7620fbd3e158dc1fec83f304"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::format::negotiate_format (cognitive 19): monoruby::executor::format::negotiate_format has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b72a39957bbc7d4c7f02730a86ca851f6c45c5bc47e911a1d993b46febb3b25"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::ext::ext_method_trampoline (cognitive 19): monoruby::ext::ext_method_trampoline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"561e0e9c2abee17959a296686d0fa751e051d7268af75d0de793d292d6e94c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::parser::prism_backend::parse_coding_directive (cognitive 19): monoruby::parser::prism_backend::parse_coding_directive has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), boolean chains 5, if/else 2 (5 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dbf8294b5b89e8a1e46338637a03999f646a35c9cd80df6f1d08f2f50caf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::parser::prism_backend::parse_bool_directive (cognitive 19): monoruby::parser::prism_backend::parse_bool_directive has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), boolean chains 5, match/switch 1 (3 pts), if/else 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aa65e9e439bef4d1aa3c8b01a729f2ed296ce9c851f8c599cdd0bdddaa01cd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::eucjp_to_cp5022x_from (cognitive 19): monoruby::value::rvalue::string::eucjp_to_cp5022x_from has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 4 (6 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e7b7757814c79b69e7b97ea02957661a23fc5eb7725ed112b5f0a2d5237f23"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::jp_encode (cognitive 19): monoruby::value::rvalue::string::transcode::jp_encode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b493a8bc216e784e93389b8939a789a55a6dd1536e408512dfe14259af059364"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.cycle (cognitive 19): Array.cycle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c3776126021a6ef3ff69aec977ede7a99e69f57938fba3881de1bfe02439c"}},{"ruleId":"D2","level":"warning","message":{"text":"Factory.register_type_internal (cognitive 19): Factory.register_type_internal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb98a15858fca2ed445667ea4401b9dd59be00cc281195071739461931339d7"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.flameAt (cognitive 19): aobench-cpu.html.flameAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49fb888a75c25a1613b64dfa38d59725e37d8addf14c80b94ed799602b7a05c"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.flameAt (cognitive 19): optcarrot.html.flameAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82f6e0a5ed2d57f5bf8b1acb78e9f6c336ce453a91a4bf24509b8811a41b16a"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.flameAt (cognitive 19): viewer.html.flameAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2369c9e0d87decaffeddaf306cff831f9be87db494d0337f6fcace79a8a91f"}},{"ruleId":"D2","level":"warning","message":{"text":"markly_native::build (cognitive 18): markly_native::build has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8a1f7e78d722f2034e233b683d09352df06e7a5e7b516ba750b84ca59a930"}},{"ruleId":"D2","level":"warning","message":{"text":"nokogiri_native::html5::options (cognitive 18): nokogiri_native::html5::options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e6901fb3566a95521cfb255c5e9cfc7aaaa92ad1af42a1e7b4563fd6d6d11e"}},{"ruleId":"D2","level":"warning","message":{"text":"RawTableInner::rehash_in_place (cognitive 18): RawTableInner::rehash_in_place has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"085c9db442efb683833f8c1a62c3806ff93d0077dc181b011cd113f610a07f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::load_constant (cognitive 18): JitContext::load_constant has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/variables.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"415013566fc63decfaf73e77900f0e4284567a386cf5a34e3be5afd05f4907cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotState::discard_above (cognitive 18): SlotState::discard_above has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84758d072bdbe040bdb47758f38c380e93d7f7e0aec25c6c860da57a16586b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::find_method (cognitive 18): Executor::find_method has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":4023}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fc9538afff6db2e81379bbe3638149f8cdb9e845eeb304d4ac5866a498c97a"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::get_parents (cognitive 18): ClassInfoTable::get_parents has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c176a3bd001b88c7175837c9f7311b48f4b8f50949d20cd3e1337a084099aba"}},{"ruleId":"D2","level":"warning","message":{"text":"CallSiteInfo::format_args (cognitive 18): CallSiteInfo::format_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":3658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a55b319dcc8420ddffd508563104b08d08be4f7dc0adcb2a6dac03d98fc842c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::lower_integer (cognitive 18): Lowerer::lower_integer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc2ad72ebb9bbf1c98f7eca032caf6d5da864745270b0249dc8396f0ee161c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowerer::lower_array (cognitive 18): Lowerer::lower_array has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 2 (9 pts), if/else 3 (5 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abca97b006a6dc582b9aa34f7bf97d5a42ef536a5d92432f3aee3e473b97c93"}},{"ruleId":"D2","level":"warning","message":{"text":"HashRefMut::insert (cognitive 18): HashRefMut::insert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a951ad983145324bbd367ab7eeb9d1c5ae4b0f85dd5681a13770b174c6325347"}},{"ruleId":"D2","level":"warning","message":{"text":"IoInner::sysread (cognitive 18): IoInner::sysread has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4ac884e1bee2ac072a706f7e89fc2c76dce0004e2bc6230f8c956cf6498eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"RationalInner::round_small (cognitive 18): RationalInner::round_small has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"b644adcd7ae23521ed5189815f03995bbdd30a5fa84fa5a3afd7eb08c8c32d20"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::bin::irm::main::main (cognitive 18): monoruby::bin::irm::main::main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd1795dd3428eed9d8fd69d62c18bc853d477d8ae9058e0760493f6be50c1ac"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::ary_and (cognitive 18): monoruby::builtins::array::ary_and has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c983fedd60b1c69c7aeed97e43109731699ba861e54cb2a7236162974b495822"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::minmax (cognitive 18): monoruby::builtins::array::minmax has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e28a8cb52fae6ea3501bf1592e888677901b93059572b964ca3cf7323e3105"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::uniq_ (cognitive 18): monoruby::builtins::array::uniq_ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4868d25346ce181ae8edead9c75490155e4ff624de02ee16bab71daa17bdbe"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::crypt::des_cipher (cognitive 18): monoruby::builtins::crypt::des_cipher has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 4 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/crypt.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f7b8e8e8d3580c1c76d9b7fed30bafd895fcd2e6f0ae428a1f6858ccbd7f50"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::hash_index (cognitive 18): monoruby::builtins::hash::hash_index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"331a6ff09f07f7c4a1dc1894239cd9c87a9ceb8d7dd18277a08ac6742d267cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::block_splits_pair (cognitive 18): monoruby::builtins::hash::block_splits_pair has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca041bd7e50284459e5925f2ff0cd6f75bd196bd66086bfcf157918341bba1"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::dispatched_name (cognitive 18): monoruby::builtins::kernel::dispatched_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4415}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde0b15421977ab4ef172187a735af4f168b2eab546443eff2455bb8c1b7a34a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::inspect (cognitive 18): monoruby::builtins::kernel::inspect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":6263}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cf13a570f544007e3e00d6ce8cdcd65acd248e91da7ceadd4c677f549207fc"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::method::method_inspect_str (cognitive 18): monoruby::builtins::method::method_inspect_str has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ace5db3e02035826167e33df73873bc8297c75b6f2283ae3a72aa149612ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::module::autoload_resolution_candidates (cognitive 18): monoruby::builtins::module::autoload_resolution_candidates has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 6 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb62e2177a2d2607e5af52742320f2fddc21079721326010051050cc29a978f0"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::module::import_methods (cognitive 18): monoruby::builtins::module::import_methods has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7249cb2b8a68d8bfc3a8a294f6529ddae006ef25e5e2fbe731edd8e0c7bba5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::rational::pow (cognitive 18): monoruby::builtins::numeric::rational::pow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/rational.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3717e89cc42de65147082325151c8ec1ae4b0eb0842d69be41298f17340b7f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::spawn::check_exec_fds (cognitive 18): monoruby::builtins::spawn::check_exec_fds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1dbd90614f522f3ea5d6b6d52777a26b7cce00e5e437ec1c3fbf0b092b0464"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::scan (cognitive 18): monoruby::builtins::string::scan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (6 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e0a2912a601b0d0a08814b7f9190902558f023f867e400a7891094828d5e45"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::scan_block_loop (cognitive 18): monoruby::builtins::string::scan_block_loop has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 4 (6 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5932}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b97386324c92dc23f0db6feafcbe662eb627b9f12236497272c68f4966be40"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::tr_sets_cp (cognitive 18): monoruby::builtins::string::tr_sets_cp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7095c5a4179c674e8d500201693b3b708c2e0722ad52cd5a5a89c5aaed1ea34"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::struct_class::struct_new (cognitive 18): monoruby::builtins::struct_class::struct_new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4f2738abc8758c08b8f10614873652a774124dfab9e8e4f342a5bcf98ec41d"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::getlocal (cognitive 18): monoruby::builtins::time::getlocal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe4383f0bc1c2af2488664dc4837820380815a931f88230f8a8555415755fb"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::runtime::args::set_frame_arguments (cognitive 18): monoruby::codegen::runtime::args::set_frame_arguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fbf5ef7a07789a08ea481f4bb7de7e5423d3dc67a42b965b41212855bb6cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::ext::dynsym::elf_exports (cognitive 18): monoruby::ext::dynsym::elf_exports has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext/dynsym.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3ea385ed333d5ef9ebecf2e627a616dcfb124fbdddcafdbfb85a9fdeab86da"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::parse_long (cognitive 18): monoruby::parse_long has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bf12c606320161fdb205637157b38a615509b7a4c0d0c0e3c3df056cba6239"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::parser::prism_backend::try_prism_inner (cognitive 18): monoruby::parser::prism_backend::try_prism_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8631458de1de27d36b02b9f999c2a9f1ea343751af6f5115921bc98e426a32"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::scheduler::poll_io_waiters (cognitive 18): monoruby::scheduler::poll_io_waiters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"76564766497f724ebb088d0a6420f0a1344627d20a3775e39af8c48f3d07e42d"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::coerce::check_funcall_args (cognitive 18): monoruby::value::coerce::check_funcall_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf67dfcc64c5cb7c88687072831ab25469effe9a1a5979d4c655871e6959fff"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::pre_validate_regex (cognitive 18): monoruby::value::rvalue::regexp::pre_validate_regex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e6160906b744f72061bcc12ea1da54c42a68ec659493fdf2bc2e3c218b9464"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::mac_source_stream (cognitive 18): monoruby::value::rvalue::string::transcode::mac_source_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d7a417450b7ac14675ff2ce36f9fbc6f90c9ce8fb8c350262e8e2c56f0424c"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.combination (cognitive 18): Array.combination has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a230923d8cf1a8c0cc4fc6e084f7dbd6d8d285a6752cc139e2d216bf7af0db2"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__bsearch_int (cognitive 18): Range.__bsearch_int has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7336080c3a844b07645554319cf6ad9b7936ff65bbc2935fa152ef7f00e426"}},{"ruleId":"D2","level":"warning","message":{"text":"JSON.load (cognitive 18): JSON.load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/json/common.rb"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf0bffe0dc64e644011dbc5ce47b431b9589b6a36b976076056515d361fa6da"}},{"ruleId":"D2","level":"warning","message":{"text":"Document.parse (cognitive 18): Document.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 1 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/html4/document.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dcc399a6ce289bb40b1072ac8720b29212085dcb176c47b76b89586c62707d"}},{"ruleId":"D2","level":"warning","message":{"text":"VersionInfo.to_hash (cognitive 18): VersionInfo.to_hash has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"monoruby/gem/nokogiri/version/info.rb"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"608cebef4662a07864cc9b8f627971569b6a58113a97a00d9511e4b628b743aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.__lex_comment (cognitive 18): Parser.__lex_comment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7648d84732be34c6c14345762b4a438e97831c6dd4a67cc8895b5a7bf85e9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket.tcp_without_fast_fallback (cognitive 18): Socket.tcp_without_fast_fallback has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (4 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3497b7f0c4884f1a908707eff52176a822c33dc0f1d90a07b0241879e90603"}},{"ruleId":"D2","level":"warning","message":{"text":"Allocator::sweep (cognitive 17): Allocator::sweep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (7 pts) (nesting depth added 5). Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"db79c293e5f3e0b36bf0f8718824f7768a16a52815a4fac2388af66964682aae"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeGen::handle_forward (cognitive 17): BytecodeGen::handle_forward has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call/arguments.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36f3c2fe2d317b2decd18a082ed1ea0342c2dc56dd574f2badce27d681e03cc"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::opt_eq_assumable (cognitive 17): JitContext::opt_eq_assumable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be398cb33bdb30dd02f2da2541d8c8d756644c21f801f43db4f6587f702b468"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::try_elide_range (cognitive 17): JitContext::try_elide_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ef97a57cd5e84a36a07dc38a06136e91fc999820f547b2c45558278d5b4e4"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::adopt_outer_loop_views (cognitive 17): JitContext::adopt_outer_loop_views has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4987da37d9b22958dbecf75dd4fc4f2b309bad9a9a4b78d08895af71077114"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::define_class (cognitive 17): Executor::define_class has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (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":"monoruby/src/executor.rs"},"region":{"startLine":5260}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e61338b2151ffb09eeabc639e53a04f4db2abf8b16dea4e47a5c12c241f4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::walk_method_names (cognitive 17): ClassInfoTable::walk_method_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"005451cf32214b449d1d8544910c2adf1fad7341b4edd1458fc9d752dccf16a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfoTable::duplicate_module (cognitive 17): ClassInfoTable::duplicate_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebfe01e26136d2b7a0e850f77f8a500759a916b009023c5a13a36e8f1987e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"EncBuf::append (cognitive 17): EncBuf::append has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb19e03317a70b87c1ef66867215240971b22c17004349c985a37b7cc7881e78"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::arithmetic_sequence::last (cognitive 17): monoruby::builtins::arithmetic_sequence::last has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fd55479d76edef757b6290afee6a4034ddadaed3faec8b16e3e7e85efb3b3a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::fiber::fiber_raise (cognitive 17): monoruby::builtins::fiber::fiber_raise has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a163c54950552059c48b3ff52b1ff775895a6613cecfe566a66ddba73d16ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::file::file_basename (cognitive 17): monoruby::builtins::file::file_basename has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"monoruby/src/builtins/file.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc1ab7c9364b79da4093be5caf63923bb3102a464e3039c657f26eebf6e69d5"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::merge (cognitive 17): monoruby::builtins::hash::merge has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (monoruby::builtins::hash::merge_) 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":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1abf053be919edd4398ad8714ba559b60cf54e138467983f18e7a97ee8bf64"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::hash::merge_ (cognitive 17): monoruby::builtins::hash::merge_ has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (monoruby::builtins::hash::merge) 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":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f36d4d8fbd647d6d90d43582d4eaf3d65687cf797757b40ad86330484bf2ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::puts::decompose (cognitive 17): monoruby::builtins::io::puts::decompose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6154ccc66830cac5fceff84a19d8e22dea4aa2d55dec58e64d781025143e19a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::time_interval (cognitive 17): monoruby::builtins::kernel::time_interval has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3897}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8624cebce1a38831c4396224baef172a5896707b32ca764020fba57a171737"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::define_singleton_method (cognitive 17): monoruby::builtins::kernel::define_singleton_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1d6e782219e01914df15c3c7cedfef114b74f3d341227a0f612190cb827790"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::marshal::marshal_write_fixnum (cognitive 17): monoruby::builtins::marshal::marshal_write_fixnum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbbbb77a619aead0726eab53d4bb0900704007d67daa7731e9bb6346971ffbd"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float::float_rationalize (cognitive 17): monoruby::builtins::numeric::float::float_rationalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ba33298913717599e30a1bbaa54c857f1154bab8b89be684ce79fb516ad6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::regexp::match_ (cognitive 17): monoruby::builtins::regexp::match_ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"50390c9cae9f1a85d84933e3c4c7353c74263882ddf704b2ec76ff9763ba232b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::min_char_bytes (cognitive 17): monoruby::builtins::string::min_char_bytes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (nesting depth added 6). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf0fc437b6962e71b4b3886a53735a0232b33ecb817cf2f3a580b276dada722"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::pattern_pieces (cognitive 17): monoruby::builtins::string::pattern_pieces has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 3 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5441}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab64fd1e882fec5145d1580cab7531e7f71bfe2e22fc3ccb476e6f871845fde"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::count (cognitive 17): monoruby::builtins::string::count has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c78d6109e8e0c1f4ea22bd15f58e40157326ae74e102f2fa84fa0b5124782e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::time::deconstruct_keys_ (cognitive 17): monoruby::builtins::time::deconstruct_keys_ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb2d9f027274796913487362154c61ccc35ceaeb36d755cb79e278465f83ac"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::scheduler::join (cognitive 17): monoruby::scheduler::join has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"597cb9ba1afd3ed311dd2aa1543ce05570128e7ecd6df1528d3e1b026c2f6961"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::regexp::single_byte_class_of (cognitive 17): monoruby::value::rvalue::regexp::single_byte_class_of has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5cd385f9d84cad73fa052cc8af57643468eb62edcea9730cec736f9501ebf2"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::stateless_to_iso2022jp_from (cognitive 17): monoruby::value::rvalue::string::stateless_to_iso2022jp_from has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d17be4c80f209a15ce93b9ccf9454f110da98623cdccf0511b31f6270e047fb"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::transcode::error_stage_encodings (cognitive 17): monoruby::value::rvalue::string::transcode::error_stage_encodings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":8718}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d78be3a3d5ab75dcc2d56f5aadd747160193b03483882ad6087f4c69e9206d"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.repeated_combination (cognitive 17): Array.repeated_combination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1906181b7fe9ba671f529b262c16bb85f874d3f43beee142f50c71ad258297f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Array.values_at (cognitive 17): Array.values_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd678f51bd393b53a9cd636f118d6af008077b55bcc224f78a9306b30027a8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.chunk (cognitive 17): Enumerable.chunk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e62ed04f859aaf936adce88a3b72badfb79957160f8dd4d9f03719a90c348de"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.__cover_val_q (cognitive 17): Range.__cover_val_q has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"1212cff884e30e0500b9805dc84a05a35b210772764b9268ee25139f8c67267d"}},{"ruleId":"D2","level":"warning","message":{"text":"BigMath.atan (cognitive 17): BigMath.atan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9650348b8b86f3ee261ec4df827c65021f63eb30ccb485fc34549e8ea5febea6"}},{"ruleId":"D2","level":"warning","message":{"text":"BigMath.lgamma (cognitive 17): BigMath.lgamma has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"473425f6eeffde8c2ee7df1d41c61e3c2fba1fb83a011d1664f8252bb6f79527"}},{"ruleId":"D2","level":"warning","message":{"text":"Addrinfo.connect_internal (cognitive 17): Addrinfo.connect_internal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cb3345182ce9febcdcdfbc629b21d57f23c88b9d312ce4412351ddd9604bda"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicSocket.connect_address (cognitive 17): BasicSocket.connect_address has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c702efc5635dacc3eb21003d0f625c41fcd4a9a73e4b2e0a57ee29b909f250d8"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.methodStats (cognitive 17): aobench-cpu.html.methodStats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 4). Of this number, 9 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b277157d7162b55a5e3f055b0c22d7d7871bddd8790d24fda2fe761cc40b4604"}},{"ruleId":"D2","level":"warning","message":{"text":"aobench-cpu.html.viewJit (cognitive 17): aobench-cpu.html.viewJit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5, boolean chains 4, loops 1 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"60304714c8f072a375d64cb1c015dc7ee28102bd98efc207c82af23533fddb87"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.methodStats (cognitive 17): optcarrot.html.methodStats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 4). Of this number, 9 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d4c396aa05983ade1b556e8546e572d178541c03c1986e9e8f47f26746980c"}},{"ruleId":"D2","level":"warning","message":{"text":"optcarrot.html.viewJit (cognitive 17): optcarrot.html.viewJit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5, boolean chains 4, loops 1 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"b907bd8f8df5f1b8d6b05a21caa23706e8a366193ffc75cbe91c0aaef5483828"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.methodStats (cognitive 17): viewer.html.methodStats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 4). Of this number, 9 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"daca8e21542b7c258b9c8a8f9de9743ca0bd1ca96b54fd5e5d18485de91a24f8"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.html.viewJit (cognitive 17): viewer.html.viewJit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5, boolean chains 4, loops 1 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefb687e1b9c8c76342fe7f84d827a1a613be387b362efd9e0627d6f08279137"}},{"ruleId":"D2","level":"warning","message":{"text":"Plain::out (cognitive 16): Plain::out has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcf605269404cfd3e6d2ab09e6722f6effddda38fa758ad0d9a20be764fa960"}},{"ruleId":"D2","level":"warning","message":{"text":"markly_native::to_tuple (cognitive 16): markly_native::to_tuple has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 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":"ext/markly/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae12026e8238fcdf0417ea121178d68eed9f5fdc8514afb0b1781c0c568bcf0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_object (cognitive 16): Parser::parse_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff0f6cad01e723361d08025be19ed22b1b1d3ac019f80bab746527db18cb7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_number (cognitive 16): Parser::parse_number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e15d0ab5024bcff3b78ed67b534b14c72e507c67d972cd923f615d13162a7"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmIr::push (cognitive 16): AsmIr::push has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0d226b24189a3e2f6313e951b82a012beb259f92cd57975a88aa2228783b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"JitContext::emit_range_plan (cognitive 16): JitContext::emit_range_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"316ad9c2f053fa5dfa970b25a66fc6ebb9d990c96e5f0b55a2035ecab9d00bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractState::unbox_to_S_for_outgoing_block (cognitive 16): AbstractState::unbox_to_S_for_outgoing_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e5a5f1972bfac1e0871cb83e942544aec1d703f13fc83608299e5838cd0636"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::emit_range_cover (cognitive 16): Codegen::emit_range_cover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3450}}}],"partialFingerprints":{"codehealthFindingId/v1":"db40f05fa17df753a7728c985a64342eaecf5d4305d2dfbcb1c23dc7e2fee705"}},{"ruleId":"D2","level":"warning","message":{"text":"Codegen::emit_range_cover (cognitive 16): Codegen::emit_range_cover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f901414c3135856ad873d2a59778c17fdf392951c872f1c385fd7381f6a2f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::nearest_caller_location (cognitive 16): Executor::nearest_caller_location has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9ee52cf01b3af255a6c6dd2b14c81dc0e1e7a9436f23da3503c343b460246f"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::materialize_escaped_block_handlers (cognitive 16): Executor::materialize_escaped_block_handlers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":5590}}}],"partialFingerprints":{"codehealthFindingId/v1":"347d70b23875ecaf418957de56fb6fa5fc5902f20c39263a4914f970e7e69163"}},{"ruleId":"D2","level":"warning","message":{"text":"Globals::compile_script_eval (cognitive 16): Globals::compile_script_eval has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 4 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"316659023bbb620cab0a10caf199631c68f71376837ac2906c8ae889372015db"}},{"ruleId":"D2","level":"warning","message":{"text":"IoInner::seek (cognitive 16): IoInner::seek has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05afcf58398dec00b49491a0d1ca7cc5a3930bd79faaf768e3316dca1042eee"}},{"ruleId":"D2","level":"warning","message":{"text":"RStringInner::sub_splice (cognitive 16): RStringInner::sub_splice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee94ae2a74d18f9b923875983a804b8afaeb780c5db6a9bf40f4c6362cbc870"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::argf::argf_getline_raw (cognitive 16): monoruby::builtins::argf::argf_getline_raw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3b34b8c5452f1b29562e5855b9ff2603cf24ae40654441abaf477974a215b4"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::array::mul (cognitive 16): monoruby::builtins::array::mul has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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":"monoruby/src/builtins/array.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ec046d451c024a7225c54125202224e7e02013b8d86de5ffaf490bf495c53b"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::io::io_read_nonblock (cognitive 16): monoruby::builtins::io::io_read_nonblock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bba84e7b384b7014ec56ceca2d9414c5b686e543f40ad8daf43e6ae0f7ade8a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::json::convert_utf8_to_ascii_only_json (cognitive 16): monoruby::builtins::json::convert_utf8_to_ascii_only_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a9a44e27f9ebea64d0cda3a3825b11428e32d0d6e8965518c5192e2c0fcbff"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::parse_rational_str::number (cognitive 16): monoruby::builtins::kernel::parse_rational_str::number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (8 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"af621dd92b0e6ffdf2dc8d1bf8370b3c4546aea60ec878474d37d0a4c73ceb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::kernel::val_to_rational (cognitive 16): monoruby::builtins::kernel::val_to_rational has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"88baf63ffa97698f919ff141bd4e5d01884a9999eaad1ed1499d99930655251a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::match_data::deconstruct_keys_md (cognitive 16): monoruby::builtins::match_data::deconstruct_keys_md has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c654b3c25d0af79d72130f97304003fd0f532f0bc1b054b609bd71c41edfc14"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float::floor (cognitive 16): monoruby::builtins::numeric::float::floor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (monoruby::builtins::numeric::float::ceil) 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":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"238ae75f40c0ab696ab8a17d0d45b7c743cac0db51ab31f4e3e897f6ae3af676"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::numeric::float::ceil (cognitive 16): monoruby::builtins::numeric::float::ceil has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (monoruby::builtins::numeric::float::floor) 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":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2bcba8d9eca9062b0a3e9264eac1d48b8dbd8ae9d46426a7486ee3a56a7553"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::process::process_status_wait (cognitive 16): monoruby::builtins::process::process_status_wait has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"708c8f160a4e51362af52c53c8a89a4af89cf3d54359c2005e232afa452efe78"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::range::str_range_walk (cognitive 16): monoruby::builtins::range::str_range_walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df305a38b02f787668fd8bb6956059875195636955fa396187e3fef861749a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::parse_to_c (cognitive 16): monoruby::builtins::string::parse_to_c has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8942}}}],"partialFingerprints":{"codehealthFindingId/v1":"108ffb6b722a053e6a83571cb96cf4c181a6a8b9c857b2ef3adac8654fad0d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::builtins::string::expand_cp_spec (cognitive 16): monoruby::builtins::string::expand_cp_spec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40026858b60228ee083233cb1a34bbe7913b235d1681eb1c5ef6618527fe01d"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::codegen::jitgen::compile::loop_analysis::float_ops (cognitive 16): monoruby::codegen::jitgen::compile::loop_analysis::float_ops has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da38fe7bf3c6c3b7033e5c920a63bc5bdc871be1ada56f17be50a0da7a6c758"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::executor::op::sort::merge (cognitive 16): monoruby::executor::op::sort::merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca71a4bc55ac6e8451e6a75302448cc4db5d758061fc497f1b6436f3d75351ff"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::parser::prism_backend::detect_bool_pragma (cognitive 16): monoruby::parser::prism_backend::detect_bool_pragma has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e279f67537018d43286160fa640eeca08b62bb72a78b6d930afabd1009ab18e"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::utf8_inspect_with_lookahead (cognitive 16): monoruby::value::rvalue::string::utf8_inspect_with_lookahead has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (monoruby::value::rvalue::string::utf8_dump_with_lookahead) 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67c3c61cb59c77fb6cf175938c17db78622a3cc0f610b0dd0fb2dca986d173a"}},{"ruleId":"D2","level":"warning","message":{"text":"monoruby::value::rvalue::string::utf8_dump_with_lookahead (cognitive 16): monoruby::value::rvalue::string::utf8_dump_with_lookahead has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (monoruby::value::rvalue::string::utf8_inspect_with_lookahead) 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3907}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b3507374d14340e260b722aed008b4dcfc4eef14789c68bf34ae24dfce4e45"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.min_by (cognitive 16): Enumerable.min_by has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Enumerable.max_by) 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b15097e250c5ed1656d1bbc271b1033e7015e68255aa65e6879d47e82b900c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Enumerable.max_by (cognitive 16): Enumerable.max_by has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Enumerable.min_by) 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66b568a4719bafe8e117be8dbaae8186ec5d69bd1665c7d416c7f07710fdb91"}},{"ruleId":"D2","level":"warning","message":{"text":"Pathname.cleanpath_conservative (cognitive 16): Pathname.cleanpath_conservative has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/pathname_builtins.rb"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"376c240e80c1e2323d953286f2e6ff075abed24b6098a505f58c7ecfe1331e49"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.reject (cognitive 16): Range.reject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa0f170880fd3393e59d5015786220ebe66f93d2139efc951ccf458586d103d"}},{"ruleId":"D2","level":"warning","message":{"text":"Backtrace.__slice (cognitive 16): Backtrace.__slice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/thread.rb"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac4da7e7844eade0f8df83bbbd40f15acce562629d3ccc058331e525514457b"}},{"ruleId":"D2","level":"warning","message":{"text":"Function.initialize (cognitive 16): Function.initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (5 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/ffi_c.rb"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3b184fd74348b1587a3cb6fb56d39eec45b601b21bfcff7adb634aea9cf5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"XPathVisitor.nth (cognitive 16): XPathVisitor.nth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/css/xpath_visitor.rb"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd61efb6e9ffc9520cee66df74b2941a40dcec7fe073ace962b4710ba6f8150"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Codegen: TooManyMethods \u2014 631 methods, declared across 42 files: compile/mod.rs (110), x86_64/vmgen.rs (63), aarch64/vmgen.rs (56), compile/builtin.rs (39), \u002B38 more file(s). The bar is 30 methods; this is 601 over it, 21.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a25c3f2c5d54ee26127b5bd32775e5f93a8a9076d79176eef50cda6f3e41e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/string.rs: FileTooLong \u2014 7455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 308 free functions. The bar is 500 significant lines; this is 6955 over it, 14.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce37dbb87f58c1c7b8cf6cdb09815b40d8a9100621b54001704744a8499e9384"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Value: TooManyMethods \u2014 314 methods, declared across 2 files: src/value.rs (283), value/coerce.rs (31). The bar is 30 methods; this is 284 over it, 10.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"62676b09ce106f62e1aa22a9ac21193e0f3bc7abd8aca68ef5b35c9ffff460db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Executor: TooManyMethods \u2014 308 methods, declared across 6 files: src/executor.rs (248), executor/op.rs (28), executor/constants.rs (24), executor/frame.rs (5), \u002B2 more file(s). The bar is 30 methods; this is 278 over it, 10.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7118b587c803d3d0c0f0df50cbc6f7a7e205cacadd56a913d87e8bc715fd7dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/io.rs: FileTooLong \u2014 4455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 174 free functions. The bar is 500 significant lines; this is 3955 over it, 8.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd03afe913b7a87cbfec87938878a44a4a74c2beda8dbcfc99b9a67092b4655"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/kernel.rs: FileTooLong \u2014 4102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 192 free functions. The bar is 500 significant lines; this is 3602 over it, 8.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f750b070d7e9c46a276141ab7fa4589cff86addfd540f4acdba9232ab89bd0ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/transcode.rs: FileTooLong \u2014 4069 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 138 free functions. The bar is 500 significant lines; this is 3569 over it, 8.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bd923331f9b864c336cbfc85c923d95c702ebbd640ef8e0f129286a5ccb2e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowerer.lower_node: MethodTooLong \u2014 lower_node runs 801 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 701 over it, 8.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0843a0c2c70a573ff9dcc3a9581618fdac7f706d0cdfa0fa8b157f9b98585d69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rvalue/string.rs: FileTooLong \u2014 3873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 104 free functions. The bar is 500 significant lines; this is 3373 over it, 7.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde8a0ef19ad3748433c92d8597154f0e14f9ece04b62857bf7f54f9cac967d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/prism_backend.rs: FileTooLong \u2014 3728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: Lowerer (2 blocks, 657-5584), declaring 43 free functions. The bar is 500 significant lines; this is 3228 over it, 7.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bea68a88c9abcbd8ac2f7d087468c50a308da96bcee160626d456a11b08934"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lowerer: ClassTooLong \u2014 2979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 86 methods, 2 blocks, lines 657-5584. The bar is 400 significant lines; this is 2579 over it, 7.45\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e36383c3bd18d37dd4259a99f718fb199928f97337ca4d747ba61a7c02fcd8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Executor: ClassTooLong \u2014 2888 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 308 methods, 13 blocks, lines 275-6099. The bar is 400 significant lines; this is 2488 over it, 7.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf22e5f22c59ddebd9926563391d6a91ecf47652fac3c61f646dee4c8d5b7ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BytecodeGen: TooManyMethods \u2014 204 methods, declared across 8 files: src/bytecodegen.rs (107), bytecodegen/expression.rs (44), bytecodegen/method_call.rs (12), bytecodegen/binary.rs (11), \u002B4 more file(s). The bar is 30 methods; this is 174 over it, 6.80\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bfbe9cd4c3a9260fa7107b5e7e5fd0cb3c616213f63e9823b9701252201f22"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 199 methods, declared across 6 files: globals/store.rs (142), store/class.rs (32), store/refinement.rs (9), class/instance_var.rs (7), \u002B2 more file(s). The bar is 30 methods; this is 169 over it, 6.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac9e13282c39e7cfb51d533a3f3e8051df280b188a5c59706c0fec16ae6e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/executor.rs: FileTooLong \u2014 3286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Executor (13 blocks, 275-6099). The bar is 500 significant lines; this is 2786 over it, 6.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"091fa76453a7b9a220bfaaff5623b28df4f9754ee8b2121a3bc063661d3b3710"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::prof::report: FunctionTooLong \u2014 monoruby::prof::report runs 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 525 over it, 6.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a6cdc19cebe1e7601b4098f8c00db1467e8b01ef397efe33127d18c38bd258"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RValue: TooManyMethods \u2014 181 methods. The bar is 30 methods; this is 151 over it, 6.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e01ebd97ebef9f27c3151add38a7a2666df892c0add4f725acb80ecf4c30e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Executor.format_by_args: MethodTooLong \u2014 format_by_args runs 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 502 over it, 6.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"82032adccf5073e7f9249d09c913b36da3891e7746de8a3935aac51e8de82e5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/encoding.rs: FileTooLong \u2014 2995 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 134 free functions. The bar is 500 significant lines; this is 2495 over it, 5.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a2b92dc1793fb81e1420cffa19365a2eca5a819cafa515a5602319ec04f2cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/array.rs: FileTooLong \u2014 2979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 146 free functions. The bar is 500 significant lines; this is 2479 over it, 5.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac95025324f9e2efe43c69a6e352242faf35d8d16d55978a39dd84cf6f3043"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Globals: TooManyMethods \u2014 171 methods, declared across 7 files: src/globals.rs (74), globals/method.rs (64), globals/require.rs (13), globals/gvar.rs (11), \u002B3 more file(s). The bar is 30 methods; this is 141 over it, 5.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d39f77cd63c63a14cb9c0c535b98846b722258154fb856df2186a090fd42fca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.gen_expr_inner: MethodTooLong \u2014 gen_expr_inner runs 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 421 over it, 5.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df61302a5edbb782b2a78a85bade9b7a046aa34b5111bbf738b4b9d38c5d52b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rvalue/regexp.rs: FileTooLong \u2014 2530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 2030 over it, 5.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a9ac2245d101c3a213844c1ce014746debd3a89b5ac9fcbcf3faaca3801e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/time.rs: FileTooLong \u2014 2514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 146 free functions. The bar is 500 significant lines; this is 2014 over it, 5.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60735413bb174552c9ef3a3db3d7eb7413fecb764473fa05e3446c1ce81b96a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MonorubyErr: TooManyMethods \u2014 139 methods. The bar is 30 methods; this is 109 over it, 4.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34b7c774ce02c4781fa35e8494eaf2f55c5e5b9f7869f9c365e1e9a27c82c69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value.rs: FileTooLong \u2014 2201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Value (20 blocks, 240-4090), declaring 33 free functions. The bar is 500 significant lines; this is 1701 over it, 4.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f696d919c67a93149edf3cb6d25169c9767f5cd408e0a537ada852ffa5b30164"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/module.rs: FileTooLong \u2014 2197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 116 free functions. The bar is 500 significant lines; this is 1697 over it, 4.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65526508ffe6584d44c37845d639c680e9574934813dc1bf8cfdb9d74a84be77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/hash.rs: FileTooLong \u2014 2158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 141 free functions. The bar is 500 significant lines; this is 1658 over it, 4.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20c14154306bca7f8e0ad43ec99410028382bde4a4f8a4aa001388d5de16ed7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.inst_to_bc: MethodTooLong \u2014 inst_to_bc runs 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 307 over it, 4.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10a9f3cc8662535603c4b6e224b543dbfdf7d74d7a148a26c3034e5464a1684"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: globals/store.rs: FileTooLong \u2014 2007 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: Store (20 blocks, 110-3083). The bar is 500 significant lines; this is 1507 over it, 4.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"079598012e8a46beef02a2ac229cecc5851e42e35979b67da1cafc89438337ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/json.rs: FileTooLong \u2014 2001 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 84 free functions. The bar is 500 significant lines; this is 1501 over it, 4.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7fe8b43aa603a47c1e1a5f9e1dfba6ab4fd97fe001de117fbb62dfa614ab52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::value::rvalue::string::pack::pack: FunctionTooLong \u2014 monoruby::value::rvalue::string::pack::pack runs 393 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 293 over it, 3.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c48506d2da0a871955a1f4461c3e948e09e23293b5e02aa62f0b589d223a5a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Store: ClassTooLong \u2014 1549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 199 methods, 20 blocks, lines 110-3083. The bar is 400 significant lines; this is 1149 over it, 3.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e77951a240bdd939d86cb92dcc4f23b18d52e71461bbdcb79c72535f153b5b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::marshal::marshal_dump_value: FunctionTooLong \u2014 monoruby::builtins::marshal::marshal_dump_value runs 384 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 284 over it, 3.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4a42e5752ce1c5f49265e455e6664dbcf544509c1bfc6b294d100b0ad8add7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/rvalue.rs: FileTooLong \u2014 1861 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: RValue (12 blocks, 659-3133). The bar is 500 significant lines; this is 1361 over it, 3.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13930031e54cbc4ba043911337596efa56016cc3f08816ed10946a761dd83c73"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Value: ClassTooLong \u2014 1486 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 314 methods, 20 blocks, lines 240-4090. The bar is 400 significant lines; this is 1086 over it, 3.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1810e8e62b3a62475d22545f9ae2556f723ce7386ba779decc563c4caf9987a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RegexpInner: ClassTooLong \u2014 1475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 78 methods, 7 blocks, lines 179-4119. The bar is 400 significant lines; this is 1075 over it, 3.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed08b53c6b9d5838d0866090660c80f18739c48e976b369342a440f448eff607"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IoInner: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"624188109225dd2c3f54eabdac31884569bb2784ef21d6b722f2b37960bec148"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/prof.rs: FileTooLong \u2014 1810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 1310 over it, 3.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c592276a402889c7ef3fb2f5dffeca381b6a39bf43d5b03ebc1322119d092"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ext.rs: FileTooLong \u2014 1804 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 128 free functions. The bar is 500 significant lines; this is 1304 over it, 3.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dbc8d44ae2ebc9450465c07b9071481667e6c661f551154d65a683f1efb626"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractMemory: TooManyMethods \u2014 108 methods. The bar is 30 methods; this is 78 over it, 3.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/ffi_c.rb"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3503d1915e16d7cce24b820049a5e479d226949f438751b4a928b3975d033846"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::kernel::init: FunctionTooLong \u2014 monoruby::builtins::kernel::init runs 359 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 259 over it, 3.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a85128d81b9a688887c4a59617957b1e256996befbba3e1c890378a4ed07dc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/marshal.rs: FileTooLong \u2014 1776 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 1276 over it, 3.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3dc38f8ce0349a674ae8c0042ec66e592ee2328c0446693d8c733c59d702e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/file.rs: FileTooLong \u2014 1764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 106 free functions. The bar is 500 significant lines; this is 1264 over it, 3.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5611e0435f16d1754d47c36f88efe4a940318f3219abf566f70f7821917f2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/class.rs: FileTooLong \u2014 1712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1212 over it, 3.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a840f007756830f29f7cafdf3df57ede10d1b202cc135fd035f947684610ad99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bytecodegen/expression.rs: FileTooLong \u2014 1690 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: BytecodeGen (5 blocks, 52-2674). The bar is 500 significant lines; this is 1190 over it, 3.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78078ee1c5eca0e0ea61102ae3eb6247c3adf8c3e3f65ad4806a16e9ec3705b3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RValue: ClassTooLong \u2014 1344 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 181 methods, 12 blocks, lines 659-3133. The bar is 400 significant lines; this is 944 over it, 3.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0c4ed0255dc034135753f0a11b6641816e0fa394f92f8781aedc08728d0fad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::string::split: FunctionTooLong \u2014 monoruby::builtins::string::split runs 331 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 231 over it, 3.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed530d76af56e1f486ea1ea7b47ddcde1185df8cb0162579acbcc57d571276b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JitModule: TooManyMethods \u2014 96 methods, declared across 7 files: x86_64/jit_module.rs (27), aarch64/invoker.rs (26), codegen/jitgen.rs (19), src/codegen.rs (9), \u002B3 more file(s). The bar is 30 methods; this is 66 over it, 3.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557419170383b9f702c086cc0ed141a6d63330eca14e238a29cb53b0b9dbd6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gem/gosu.rb: FileTooLong \u2014 1588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1088 over it, 3.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a52b329cf094caa8a664009fbad4b20a290fa51aad61b3afd2620e188af663b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: VmHandlers: TooManyFields \u2014 95 stored fields. The bar is 30 stored fields; this is 65 over it, 3.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3341256afd10942681aada82ce08cbf303403a96a3cf92e4aec245d065233c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MrApi: TooManyFields \u2014 95 stored fields. The bar is 30 stored fields; this is 65 over it, 3.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby_ext_sys/src/lib.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52adc2b2d96cf83bead00ebc8a4d2e891d821ce669f269075e515382f3673e2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubyMap: TooManyMethods \u2014 92 methods. The bar is 30 methods; this is 62 over it, 3.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":"rubymap/src/map.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15dac348677a96ce5e57290dfc61155f19b9fb369c25476947458e02f6f1a95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::value::rvalue::string::pack::unpack: FunctionTooLong \u2014 monoruby::value::rvalue::string::pack::unpack runs 302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dac907a32319132f4fdb0bb3cf42f7369a8ab65de61e475dbb4f810552a90c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/pack.rs: FileTooLong \u2014 1491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 991 over it, 2.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c5b80a3bb74f21560bbf553f81b7b2270b0b615f7dea8e758ea6516415db4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rvalue/io.rs: FileTooLong \u2014 1472 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: IoInner (2 blocks, 621-2811). The bar is 500 significant lines; this is 972 over it, 2.94\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd81dae5cba9954503f622f5a0c81f5b0b8d53f441bc0724bc1209d69a0e614"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lowerer: TooManyMethods \u2014 86 methods. The bar is 30 methods; this is 56 over it, 2.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"5702774da8ec03f3cc0212f463cd7cf5784e578dc387b632300d838e9f82b283"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::encoding::init_encoding: FunctionTooLong \u2014 monoruby::builtins::encoding::init_encoding runs 286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 186 over it, 2.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a87c862a1d7058acd2e7381d48ad551bb18024aa4b18167d7494c4f38028ea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IoInner: ClassTooLong \u2014 1138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 109 methods, 2 blocks, lines 621-2811. The bar is 400 significant lines; this is 738 over it, 2.85\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eac5ca0cce18e98dc19ee6688ef8033a1727ce98b005f997be175eec566f564"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Globals.new: MethodTooLong \u2014 new runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2711cb179edde596947dd9aac244ff86f2e3825d65dec2887cff4dfd00feb99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::main: FunctionTooLong \u2014 monoruby::main runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d625bb6859249f8147aea71ed691243c1deaa0c2eeae5bcd61a607ba8944316b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bytecodegen.rs: FileTooLong \u2014 1372 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: BytecodeGen (7 blocks, 648-2452). The bar is 500 significant lines; this is 872 over it, 2.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7674b138e77d3692e168a41dd35fe41d1ed0ca2239960847c5818f83e3bd8ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/process.rs: FileTooLong \u2014 1362 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 71 free functions. The bar is 500 significant lines; this is 862 over it, 2.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f764bab25bb0a251bf120e5b48b5db39f9b987830d34e00d16dd9d924462fd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassInfoTable: TooManyMethods \u2014 80 methods, declared across 3 files: store/class.rs (57), class/constants.rs (15), globals/store.rs (8). The bar is 30 methods; this is 50 over it, 2.67\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ccfcd9c9e64a051fe1c54668c5ffd0eba02d4fa78d4a4918d7a5d687b8173a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codegen.rs: FileTooLong \u2014 1302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 802 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2150580134e7047350c6fd221fea69f01215489d9c307c83a8a1cc2f12bca06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegexpInner: TooManyMethods \u2014 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2c7141b43d12e81657370a5e7fd49a6200aa68e02f2e42a30ec5737d0b0216"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::string::init: FunctionTooLong \u2014 monoruby::builtins::string::init runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d9c68ca8dab41f63aaa4e00b7df3480b0dae5438c8cc04fe8dba9fbf63bca1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Node: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/node.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b68d100fe7eba9740d7980ad01dc5246c7398d4c67ec9a41553313e7780380f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Allocator: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553bea17f085dd1bca1556271299273cc3b01f55face234b1af2fa0f2eec587"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ISeqInfo: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15767e0b9032ccd19961432c367ad709fc4034a8a5ad9957cfb25021c80a630"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RStringInner: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3079}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d5982b304de6d194bb328ea30753caae7be903c6829a029cf783b5d6a2e667"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.check_defined: MethodTooLong \u2014 check_defined runs 240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 140 over it, 2.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a9c921a2426c777302a358e0780dded8a72466a096f5a08fd990b7997cb22b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MonorubyErr: ClassTooLong \u2014 957 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 139 methods, 5 blocks, lines 110-1851. The bar is 400 significant lines; this is 557 over it, 2.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"96af0411ac82a3fd4bfea2ea56845a1e9a9c6a2eb2c8f2b5fcd39410c5e95214"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::globals::gvar::init_builtin_gvars: FunctionTooLong \u2014 monoruby::globals::gvar::init_builtin_gvars runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/gvar.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd08be8c359ce4b363077f8fe0834cf79303c1aa45c71fe703f1b4298340e1ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BytecodeGen: ClassTooLong \u2014 950 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 204 methods, 7 blocks, lines 648-2452. The bar is 400 significant lines; this is 550 over it, 2.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a0a86b5929c09dc5a82294d473177e81234d23ccfeb25cf6266c2b86f70be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FuncInfo: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd89448a0813e716b2bd3a01fffd4cf314be5ca6ffe3c83720fb3f544f9903bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.gen_store_expr: MethodTooLong \u2014 gen_store_expr runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff594658c94ce9f312074dab517b3c309b0ccdd1a9b3312338a6147ad1154b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scheduler.rs: FileTooLong \u2014 1162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 82 free functions. The bar is 500 significant lines; this is 662 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a3ecce80671608c5dccb3ab92c2abfcd502e3aa045b75f46edee35c09e99a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io::io_copy_stream: FunctionTooLong \u2014 monoruby::builtins::io::io_copy_stream runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6806}}}],"partialFingerprints":{"codehealthFindingId/v1":"119e0cf68ff5a831a735575dbb87cfaa63039b7119a5b0e5402519010ea7495b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/regexp.rs: FileTooLong \u2014 1147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 62 free functions. The bar is 500 significant lines; this is 647 over it, 2.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3989b4ba2b874ec588ef03ddc2ce04ea626d8e3f36bff66893f78c0dc261bf96"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Globals: ClassTooLong \u2014 913 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 171 methods, 12 blocks, lines 360-2358. The bar is 400 significant lines; this is 513 over it, 2.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6f37df050cde2c4be432cb551e0dd448c278c6e58ddf2e58abc83ce871a797"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/enumerable.rb: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 618 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96939a1195f03163c17b8c29b561a5f30c7cdf6f11bfad4bbded6d0af9939146"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/op.rs: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 618 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448b5bf496b37900cbebeaff6da1ae10504ed8cc58ba2e5c5e1b597c6b8f00e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numeric/integer.rs: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 617 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da50bf949346dd10e40de5b31f70c161f7513b397f6233171b51262e2e72ebc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/io_buffer.rs: FileTooLong \u2014 1115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 68 free functions. The bar is 500 significant lines; this is 615 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a93c6ab6ba6c2e7f99a8157ca36e9cac22fb50e58784d01868e8959044b7093"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/format.rs: FileTooLong \u2014 1103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 603 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4398b2274a30d595179e7832981ab06a6d3b6db3e7566a027d97e2725eeb34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: raw/mod.rs: FileTooLong \u2014 1102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 602 over it, 2.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc26a7f8e2dc3b35b6b556dd67f3295448805127ca71e0e4de2ab4fd9f2ff381"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rvalue/hash.rs: FileTooLong \u2014 1101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 601 over it, 2.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce43d3002ea075bebbf95f4234c839b2ad60ce9aa4ad2207d4ff09ec4a9ccb2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassInfo: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"80485af1a77fb92f2e13453f87a4b2f9968ff8e545091fe0320fe405f26d5b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/globals.rs: FileTooLong \u2014 1100 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Globals (12 blocks, 360-2358). The bar is 500 significant lines; this is 600 over it, 2.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee853e3dfa935fbc78bb6c734709d1ca96ddd71cd90e815d8f3bae28414a6e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/map.rs: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 592 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c80746f73b8711e7802899dfe14ad35ac26e4e5abd7edcc175fee803caaa304"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1084 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 94 free functions. The bar is 500 significant lines; this is 584 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beee1ca4f20c8391f062834dd44d919abbd068d99faadea874da5e7bca98a281"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/alloc.rs: FileTooLong \u2014 1076 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: Allocator (5 blocks, 789-2558). The bar is 500 significant lines; this is 576 over it, 2.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d6c59d0fdcb94eb5d66245f46d44a0fa884bc8c32432fc7657bbf6eabaabea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: globals/error.rs: FileTooLong \u2014 1072 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: MonorubyErr (5 blocks, 110-1851). The bar is 500 significant lines; this is 572 over it, 2.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc52a46b0a13dc9706468f99efeb2141e41fef02298bd9f84c466bf358505a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ctx: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby_ext/src/lib.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab1d35fdcdbc6f1e28f8d3c66aa050fc564751978d6803bdf3d7b833ea4c900"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubySet: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/set.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce819bbf648bec4ebd31b5db7473630669a455542fca2b74c509cba7205914cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.gen_begin: MethodTooLong \u2014 gen_begin runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"198f37db44be7beaf89f691afffebb9c1b689d013c77acaef58e200be7dd6206"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pointer: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/fiddle.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"484cfeb2d0c18803c8aa08b478dcf4d457206d524102734a2e181252f96e1bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::hash::init: FunctionTooLong \u2014 monoruby::builtins::hash::init runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b848dd0314339911d1ec3b6ffa97391784f805cf0d2b1a6ec1324d056a1aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::module::init: FunctionTooLong \u2014 monoruby::builtins::module::init runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7b3756ba51fd68039b2873544b3d52df28d4a9add8d3feeb1a6bb36fafbd81"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::spawn::parse_exec_args: FunctionTooLong \u2014 monoruby::builtins::spawn::parse_exec_args runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"934ea3420e3c5bf0d80e3d2743e8f544a923faad4c198738e3d63c40eda3a5f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1024 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 524 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f389ca4135ea7b78d972631efbb90f2b7677fb2e82cb96e780517c0cb2d361d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StringScanner: 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":"monoruby/stdlib/strscan.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f8be66daa5de52e688e9641c3654d11e4b03793a6ae11fa38a3aee95055b61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msgpack/msgpack.rb: FileTooLong \u2014 982 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 482 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aec9f4b0ec3d2489b71674409aa0878b1d25b83b101b279f5744578441861c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io::io_select: FunctionTooLong \u2014 monoruby::builtins::io::io_select runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ddcde32290dbf92fec3ea46cd69ee2e44f0e2c54004ab1cd1a93cd50969d36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node.rs: FileTooLong \u2014 956 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 456 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc30d0dde438225943df6e17b27798940f49e2ff8ebddaecb3c20542ee5bd63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: globals/method.rs: FileTooLong \u2014 945 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: Globals (5-1170). The bar is 500 significant lines; this is 445 over it, 1.89\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"501a2427aa76820c3d6a2e3976a9eef2c6c1a1f550a4e78e30ab3e19ba07f385"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::encoding::converter_primitive_convert: FunctionTooLong \u2014 monoruby::builtins::encoding::converter_primitive_convert runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b2ddb38cd403dd632c44cc3fa315ff8906d04ec234e29b56e841ae7db866bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: profiler/aobench-cpu.html: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/aobench-cpu.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"277c2616be16afd9da4152e88d80779d6c2b24d82819a70417929aa614905698"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: profiler/optcarrot.html: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/profiler/optcarrot.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bfd6c134896ca2360adc913fdf600ec2c02f3f9efadd0092ad40f7b52fbfa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prof/viewer.html: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof/viewer.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16e4f3106c9d85f28b0683fb08f6d37064b9a1e0158cd7cee4acc9ca292d78a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gem/ffi_c.rb: FileTooLong \u2014 936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 436 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/ffi_c.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf88077f284c26055eebeadc38f711760c9f0711e30cc2a3fad256b0d386c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Enumerable: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"351f025a5193a180993bbf3975b79fb1cd4f5e6263dcb0123443cafad822d965"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MarshalReader: ClassTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 2 blocks, lines 255-1570. The bar is 400 significant lines; this is 326 over it, 1.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b693222ac9245180b0517577247eb4c29c497017ee3d2e372134a073e4f74f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yajl/yajl.rb: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 403 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d77f95763e2fde9f2ef8ae3f7ef27fbbec2e8a61e9f37060d7932b3bdca877"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.level_down: MethodTooLong \u2014 level_down runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ab021271bb486ac646e0d4b5f5d02c32433933e6018a99c4b4d992c92433f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gosu: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"549b3f10b68071ebf498cd95d477fc41815cf39e815d0ae40ebf336286b5238f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/spawn.rs: FileTooLong \u2014 879 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 379 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fd65e3a4aabdeeba7324b4fdc5070aa80239b2788a6d6b1dbc21fed19e7683"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/function.rs: FileTooLong \u2014 878 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 378 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7556b80e32fa6d230699da8e97a09382d36c920c29d661861492efd90c9937"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/iseq.rs: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: ISeqInfo (4 blocks, 262-1539). The bar is 500 significant lines; this is 365 over it, 1.73\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a775480769d4951866dc0459a614e2ac1f2a91d7ff218582a73a8383c8b7e49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Codegen: TooManyFields \u2014 51 stored fields beside 631 methods. The bar is 30 stored fields; this is 21 over it, 1.70\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b7ad1d0113bc27b1586048fa594ef5c225c7cd3f5a3e3699928e232a2d2586"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/set.rs: FileTooLong \u2014 850 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 350 over it, 1.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":"monoruby/src/builtins/set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1234693186eaeab8cc2783da0fd7faaeb41cdf287d1462ba31540845f606443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stdlib/socket.rb: FileTooLong \u2014 834 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 334 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f256b6b596ae6800afb37f27ed2a6370f36e807f10d54376c44218deabf5a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Node: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/markly/markly.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97c882e1579fa028c5de8742d3f051598788c8369c68eb74b82f5f629f135e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Allocator: ClassTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 74 methods, 5 blocks, lines 789-2558. The bar is 400 significant lines; this is 263 over it, 1.66\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b03aa81c56cd9d1c0a2318b30c577b1b4f9c53da405a0935034f717aeae576"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io::io_init_from_fd: FunctionTooLong \u2014 monoruby::builtins::io::io_init_from_fd runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ed042f4064f2296d724a8014f9b02ae4f3939c983ef8619f9693505391e52d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::array::init: FunctionTooLong \u2014 monoruby::builtins::array::init runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"752dcdc4be471db8455e600d7968c69a2e8675056a5c7ee29d7979bff1b772fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/range.rb: FileTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 317 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ba8497e98148bb646ac2fdad7174d0cee51ea88e52d9daed33da826e3da60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::process::init: FunctionTooLong \u2014 monoruby::builtins::process::init runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c4b214d38a9a73e6038d51463df3c56b7745f31cafbf9a2fa57923e554e184"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io::io_popen: FunctionTooLong \u2014 monoruby::builtins::io::io_popen runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"789f90daec6c39d0c7c3657c495f1dd3b057d49e7b5bdffef143f42cb026a764"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/argf.rs: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 67 free functions. The bar is 500 significant lines; this is 309 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e58d6446e2eaac7b231dde3f322483d06e774e5cf8fceab4fc94bcc97a5147"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RubyMap: ClassTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 92 methods, 18 blocks, lines 76-1728. The bar is 400 significant lines; this is 247 over it, 1.62\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50e5367a272d8f042afd6e564b8e8bb577700ed9e5b48bb4ab99028ac8dd710"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::file::open_impl: FunctionTooLong \u2014 monoruby::builtins::file::open_impl runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcba7af5696887a10414b721454d391fe513906de05e63035409d5e6cc27625b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nokogiri_native::node::init: FunctionTooLong \u2014 nokogiri_native::node::init runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"61391f0e2ba4b12b1428f2bb4f06d4249e9897a795f394b7a3feb6c38fd2849a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94822678650198f73e620eea68d509c42e8ef2bebd92da7fbc1ee20c7be612f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io::init: FunctionTooLong \u2014 monoruby::builtins::io::init runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f21f213ecc65db173fe4790a03763251bb5abc5a6083b0e6ff4870791f4c537"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numeric/float.rs: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd0a047eb4b79b62efa176cccfe9c709ef0d63b2fb6358ba648539fda7bec0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io::copy_stream_fds: FunctionTooLong \u2014 monoruby::builtins::io::copy_stream_fds runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":7168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d809b1f7e4abfd8e214d9e6eb1dec0677961c89c324bea9524e6552825a021f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::string::slice_: FunctionTooLong \u2014 monoruby::builtins::string::slice_ runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ef171c84c1812b266d86ca4f284e8054ff225981e9bc5fda08418f41a5a44f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Window: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c97d4fb48695c9d238d692cff83fca1fd876e4d7e33c31ebb64fd0aff69574b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lfp: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfd873450d030ea7f8a424a627296df365bc21f410afc85ef57b6cd6609f05e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: map/core.rs: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: IndexMapCore (4 blocks, 32-1023). The bar is 500 significant lines; this is 250 over it, 1.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0163d161df7bae4a3298c93fbb33615c30b846aaa17ebc3fe9287e943a91416"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::parser::prism_backend::node_kind_name: FunctionTooLong \u2014 monoruby::parser::prism_backend::node_kind_name runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":6042}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf2551ad895cf9df2e326e9ec9dec379a0a59087d827ec31edf4bab00ad1c56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/thread.rb: FileTooLong \u2014 738 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 238 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/thread.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"066142b20b87929210c749d3dcd0ed08657b4a4b4fa2bd353135fd2dbacb907d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Stat: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/file_stat.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c539dfd436a928ede59f1f0d1d3ef2dc136824eaae7aea4c9a7e3324f9be1964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sax.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1cf95377c2a56a94a37564f963ab85a6c9545a113f68a63127490f1c02abfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::string::index_assign: FunctionTooLong \u2014 monoruby::builtins::string::index_assign runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"192748f876ef2f35040f7fc42fdc8c6a12c39a0802dd82fd5631a8425b66ccbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Executor.take_ex_obj: MethodTooLong \u2014 take_ex_obj runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"624cf85956860b0bdebb6ecdfc069a1fa27aded41983d0f73bde5723ef9e4e21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nokogiri_native::nokogiri_init: FunctionTooLong \u2014 nokogiri_native::nokogiri_init runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"88869994e357932a2e4d21561aa046ec392ee44df2af841e2bbf1b108cf701a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::codegen::jit_stats::dump: FunctionTooLong \u2014 monoruby::codegen::jit_stats::dump runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2307c65b50f644372bd03379a468256e06594c93ab790a4049d7abd6362c40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::executor::op::integer_index1: FunctionTooLong \u2014 monoruby::executor::op::integer_index1 runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef5f9265f466e691e8d4059f024ada5bb0238f128f166bb4924e8270613a875"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bytecodegen/encode.rs: FileTooLong \u2014 704 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: BytecodeGen (39-949). The bar is 500 significant lines; this is 204 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362c7ef5ca8171240321866f511e70ae5f1f3bd2a4b9a12c24b407104917715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/dir.rs: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6ce568528a696c9e9a09dd68c31c02910256987db7e87b265b6aac3dffa0f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Store: TooManyFields \u2014 42 stored fields beside 199 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e993f512786fce5da27d79f8a58ad4f7e94d1a46e019ca589fc8f0d850998d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ISeqInfo: TooManyFields \u2014 42 stored fields beside 73 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e569c39071eee4be31b7f0e6f695daf55e1c15f1ed9d3d46ff69ba52628d4b8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Packer: 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":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dac9b81be91985d3dd45c52f626e757f29b2f1af3991a21be8b87b205bedd5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowerer.lower_call: MethodTooLong \u2014 lower_call runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7aa59213c26bf20e22588d8225dd790e952a82260d187c4420083ccb23c4ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Classes: TooManyFields \u2014 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"164bbac57f19d9aaea43c51001941f9170aeb4a8bd2de02f10fa7b8ddadc3c42"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IndexMapCore: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 4 blocks, lines 32-1023. The bar is 400 significant lines; this is 150 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"05304c25aadd830113dbc881bd016874ddb3cafed49e152c6ae7a02a22e60539"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5503e14f388df76ba8f6574a25f972b86adb438954be552fadc0dc5b3274f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Allocator: TooManyFields \u2014 41 stored fields beside 74 methods. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"787d8afd78edf080ee65b731525a27031befd1abf7f58c1040477b401f11a62b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Numeric: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79daba9c439b8afdb522701671dc709f7aabe9ecd4519ba357d20161c0d75813"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IO: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/io/console.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2402f525c003d715bc59bf90b6b5be4e7e077e925da2a93d1838afc973faa7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HashMap: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce609c21ee77415a75eb985b457773614eadfe7aa9789a5f2f9d25c1fcf0fcc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RawTable: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb969ca452f4cd0f69b1f42f786430140d019d8c3ceb555e89ab904a0bb0e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/range.rs: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 180 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea174ebd4e0ed432dcd282b76ee3212ddf5b21365e71d9b34763f2d5ccb301e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd2e1eb6c279c6e8cf58d4c8227c2056df4dadd1b27a0af6e7a9ebe9b2d3f5f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Codegen: ClassTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 631 methods, 7 blocks, lines 983-2229. The bar is 400 significant lines; this is 136 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f967c124cd884c10bebce641d7d77993499c527b72fe1a327452b464dca0cec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Value.from_ast_inner: MethodTooLong \u2014 from_ast_inner runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b8cb8de1e5c5f1d453a091693f2ae93f3bea642e6d96d0ac9aa4f5f0bd13dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Executor: TooManyFields \u2014 40 stored fields beside 308 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c5ef179d73cac78d098fdfba9d2182cdf4d2b0706dce0e81fb998261079634"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Globals: TooManyFields \u2014 40 stored fields beside 171 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bae1cd18eff8ec1200dd844aad76490ee0edb3fb65ab2101dbe718750294900"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: monoruby::builtins::math: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"31de7a086ecf3c16eccbe82e44245d1a70222f436ae187e545e1036942286682"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HashRef: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db5266cda32bc1256fdb5f9be8cb12786d0146a02669e9caf0776c580b97ec8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Hashmap: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d91d26362726232006979a0ef4e4975a787eec3e378f0ef79b1d1fa77ca3299"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/map.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: RubyMap (18 blocks, 76-1728). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"645170be95518b13b7776d974af925c031a223f24b7088fa622ca290f4a2ea54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.gen_method_call: MethodTooLong \u2014 gen_method_call runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5146286c05e717c5f12e09807552d0e203ba69c44b617b917b38fc72914f86e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowerer.lower_parameters: MethodTooLong \u2014 lower_parameters runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3552bd8f0262af5c3f256b9cd4c1e9eeb2c0a362a6e698bbe671831bbd4c17f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlite3_native::init_sqlite3: FunctionTooLong \u2014 sqlite3_native::init_sqlite3 runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43179e5dfa836215d248415b0b89e20609dfa0e3894fa783c7494f038e1b649"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::numeric::integer::init: FunctionTooLong \u2014 monoruby::builtins::numeric::integer::init runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0998c596cd222f277ddf6c40b33ff736b0bb1c14985381a420b4f0a6698443"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Preprocess.unescape_nonascii: MethodTooLong \u2014 unescape_nonascii runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccf7eb3205ff57773c7a944f79a5b15d22c3c79391af7cb617b882900e4f754"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Plain.node: MethodTooLong \u2014 node runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f61075187e5b345bbccfe31a2e9bbd48ce30589b4a616f2387cd09e1457c3b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::string::bytesplice: FunctionTooLong \u2014 monoruby::builtins::string::bytesplice runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8000}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbc87715633398989d498f981300e1cc9417030f15987f7f1944811675b3f30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.handle_args: MethodTooLong \u2014 handle_args runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b86654b8abd4c2a862d158077c5630b3e79b7312a900810fb32fa14386beb6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ISeqInfo: ClassTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 4 blocks, lines 262-1539. The bar is 400 significant lines; this is 117 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0976ffff54ff7025eb0628457fa7428e38d31a728623bc0672e6b41d7e35c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RawTableInner: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"380e58ce767579b24c5c115f575779c7c2430cfd4bce0a3f7b38d5059ee2c1d6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IndexMapCore: TooManyMethods \u2014 38 methods, declared across 2 files: map/core.rs (37), core/entry.rs (1). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b1278e1d9c34b487c3f719d725f4d5295ab5338b8a3403a7f819a26a0ed6cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::value::rvalue::string::pack::parse_template: FunctionTooLong \u2014 monoruby::value::rvalue::string::pack::parse_template runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"51288981c4a39f5966c493e42a66ca69a1bc673081871759ce03ef611d2b194c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/fiddle.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiddle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f057bdf17a7a6e299f7816f4addfaaf48430a0611d842c0581cb3bfb2f159d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/node.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ast/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58de2010a25df47aa62a29d20c340b10bcfde853377116c3e17381e7eccc8e18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ractor: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/ractor.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"230f68b33581919fda3cd0d114e15e11e32d6752924fb4b6968600b31fd52450"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: monoruby::builtins::method: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b993bdcfbaa812744c315b8fb979f6ebd41128d7fdb2156fe15737cf2df1ff5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::time::preprocess_strftime: FunctionTooLong \u2014 monoruby::builtins::time::preprocess_strftime runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5851c9adbe79a369d78d35bb69a16d4c305fd294ed74058d30eaf026830bf408"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Codegen.new: MethodTooLong \u2014 new runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a266644f8bfa90f50f98993df17a5f54224a279a7e6290aa2b87d0b536ce335"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nokogiri_native::dtd: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; 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":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"832b22152ad97fbafaca117dfa1a41c71826cfd642970146412368d76a39298d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nokogiri_native::reader: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; 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":"ext/nokogiri/src/reader.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb10744bb50185a3ccd81d1883e0fdf112fa21b8f54b0af42a15a101efce408"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Slice: 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":"rubymap/src/map/slice.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb50c71968333003b4190942ef6422e14ee6452c9c36c4b99858e3d63fb682b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numeric/complex.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4335b3015045fc9f526b0b047893761bfb2de3e673bb23f33e23e4e9af1f821c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::marshal::marshal_try_user_protocol: FunctionTooLong \u2014 monoruby::builtins::marshal::marshal_try_user_protocol runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"facaafab7e7bd4fbbfceb9697864056cc7fe702cc97e198527abbfbdcc075c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::exception::init: FunctionTooLong \u2014 monoruby::builtins::exception::init runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe3e69c98673c28bbdef72ece2a7a693db6089778fc676c648c9a8359bc7772"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::kernel::dlcall: FunctionTooLong \u2014 monoruby::builtins::kernel::dlcall runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4732}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b814e1c8596a9114ec903641d821c82db4577e302992654d31ea53840c6fe9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Executor.require: MethodTooLong \u2014 require runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"76427be8ff8650c433a3a2317af7d0743e22a69064365166bf1faed4803a748a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pathname: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/pathname_builtins.rb"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1b22a1fb6f83cb087ee36f83fcb80ed2e85eb05366713fa07203c8a05a627"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Range: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/range.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acce7be9a253061c1a9a3ff9ebd84938d41ed2e8cce0f453bb1d1fb9366599e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/exception.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 78 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":"monoruby/src/builtins/exception.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b03bd51ff2d440f77950c8c97af7887b2bbc151f4489b58c43ebe3bb214f9e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: op/binary_ops.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea462e563a9aacf4b98cddf8dad3451aec906bdb0f0310d72e61081db182a67d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: globals/gvar.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/gvar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7373b4d25596a2203a649e81c4131f1acec91ce26197e55250b6cf6f376d5db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/coerce.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: Value (86-788). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44141e2b2b5feab0d7322775bd669391478aa7a5c6412b5e2def4d9d9ecf0740"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RationalInner: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d4871038dda35164fbe1a6874b34cf98414572d9c72f36e8af808df287549f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Opts: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fa0ad11d55bc775b58d773e55bb208a039836870538a9365960df32c0e86f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gem/cool.io_ext.rb: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/cool.io_ext.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0afed7899112d4e700bcd690d769898de859f7f3b770de55b8db037e43cc882"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarshalReader.read_user_object: MethodTooLong \u2014 read_user_object runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e0fc196bed1b9e9ea97ec93cdae41555c3be34795f1bccaceb9549ea6b4296"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: psych_native::yaml_parse: FunctionTooLong \u2014 psych_native::yaml_parse runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/psych/src/lib.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"96236cf6f1b5dbb39ea99533465cc06d589a6df17052d1c2f097d989f94f2a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::file::init: FunctionTooLong \u2014 monoruby::builtins::file::init runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"029c0b313a098152dcb4ebb276802e5128dc7bb3e317a7b47c95d118ff578d95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/match_data.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 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":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d44c8dd875b9646760a2f10430836519e5ebc732543b05f3ad5915f4ac8912"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowerer.lower_hash_pattern: MethodTooLong \u2014 lower_hash_pattern runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72c1df128abd55d34d1647b3918e63c1bc444cd71f0b346923b9f000a2e8f79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::encoding::handle_xml_option: FunctionTooLong \u2014 monoruby::builtins::encoding::handle_xml_option runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1e63d750a9a35a9971e1fc7aeb409c95c0c82aced0ebe1071bd93a53df460c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::range::range_include_impl: FunctionTooLong \u2014 monoruby::builtins::range::range_include_impl runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c4bb4f4f738b0ac165de0db5571f5c0248f59676b567853eedb01aa3740a31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/thread.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd426df4ec11839ae60cbfd8931514f155cb873ef96797d095a40b5c02cb1baa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markly_native::build: FunctionTooLong \u2014 markly_native::build runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff772f8cc8e00acd5e151fc056f9f2ca3d6085b8fdd5c4db1ee6e186e7debec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/array.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":"monoruby/builtins/array.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc8d9ad32a2eb8ae8c9520b6a84ce2c82c37bc846b59eb1717f3b450880fe19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/arithmetic_sequence.rs: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 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":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ff55cba991075e4676ec891517f3cd279c3cca772cf8bf099d3f8fe7d189fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/enumerator.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 40 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":"monoruby/src/builtins/enumerator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c13a3bdf6862e5ac86708c7c95d9a9db45072b6dd7095e6d992a2210b6f16da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markly_native::to_tuple: FunctionTooLong \u2014 markly_native::to_tuple runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d34eeb019c91e36313337c2ba4768539b36d36463e5a995c1fb1971ef83bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::encoding::enc_name_to_const: FunctionTooLong \u2014 monoruby::builtins::encoding::enc_name_to_const runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":4694}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a5e5148a0623c1146e83ac00815330d0d764e90dd5b439c28d684e29178ac4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Codegen.construct_vm: MethodTooLong \u2014 construct_vm runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec520cc2153758ead7201e6354d36688e88def1ed6bc22d96d79b0b6ee20d25b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/struct_class.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6d0ffc3370e037c831793fdc6926fac0bbdf128323fb7dbb08a88bfa8cca8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Allocator.gc: MethodTooLong \u2014 gc runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2eff4fb7a8bec6be2e767f69827654a27a2df1bc5603bad12819cc9966e64b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::dir::traverse_dir: FunctionTooLong \u2014 monoruby::builtins::dir::traverse_dir runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd3772a4ba83891cfc240548ec87b53096f131e647cd68d2f16955ac6289860"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::time::init: FunctionTooLong \u2014 monoruby::builtins::time::init runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a544aaa730ee59eb8df44640192e8f37775413a44fd5ac201c254654b65cb8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lazy: 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":"monoruby/builtins/lazy.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beb7892a04eab5a2faa3789ce26206afba9ec6ecd265a88cff9df93f3ff742c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HashSet: 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":"hashbrown/src/set.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ac7542061d81df74008cee01e44b8927c4e3e735740ca4fc2188d04846e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: monoruby::builtins::fiber: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1060fe1043bdcb95bda3568acffa4b43fa19d0734927f2f80361e718ae773ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MarshalReader: 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":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37fbd0a38cdce0c6172b2374105e7386acc9cdae9fdcfa164e7e5f4946a1a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: monoruby::builtins::random: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/random.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae714089ed835b2746c697466853497b02243d43e918e3d57f0bcb0bc6ff6f42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarshalReader.read_ivar_wrapped: MethodTooLong \u2014 read_ivar_wrapped runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0a09f856a2677ea25f32eacc6859748366ebdf696f7f08f602cf1c88c18496"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::parser::prism_backend::try_prism_inner: FunctionTooLong \u2014 monoruby::parser::prism_backend::try_prism_inner runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d107c90db6505af2d905543971917585ee39523d2d55035d3ed2b755cacf4368"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/html5.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ad733048634f3da28a34e69d3307f2fca595ed4e46488bc9724846e089f3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BytecodeGen.gen_case: MethodTooLong \u2014 gen_case runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"579309c90e31a5824b9610a53f70f87cd5f145ce34c224d777e44bc46e6bcb0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bytecodegen/statement.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: BytecodeGen (9-762). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a5178ed0876ea55f66c8d4a93cca739bd6e192e37fd2db64b164ffd96f41d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xml/node.rb: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/node.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b874bf8630484a3d83cad8581c5e58ea0bcca72faf87e1ebbde830f33478731"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pathname: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/pathname_builtins.rb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7ac2cd01aa50f372f05d1c8002a10505095a28634740e549743c2f31e39056"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeSet: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/node_set.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86e2d255642d63a848bd2e69c6c2f5d06d3c097a02d7394b6a6ccdad5502f1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: monoruby::builtins::numeric::rational: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/rational.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3477a90bb542936fc5da9ddd03e6dbb79f6aadf403e943f8fe172974ae5a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArrayInner: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/array.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fdc7a9e57d8ee2f2b5a37bebb885824aebcc1b46229ec81a04d07395443593"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::numeric::float::init: FunctionTooLong \u2014 monoruby::builtins::numeric::float::init runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"64825eaa150c9bcdb064879738b42cf4c1870de5847dff8aff2b658637093cd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::io_buffer::init: FunctionTooLong \u2014 monoruby::builtins::io_buffer::init runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2951249b6efe74b712522461fd7c64adb414c1c7f935ae42d2cf7eade9afe42f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nokogiri_native::html5::fragment: FunctionTooLong \u2014 nokogiri_native::html5::fragment runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1664445c83072205c08f67fdb5be44d91a60fac7903e0eef49ea945fb1cac35a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monoruby::builtins::array::sample_inner: FunctionTooLong \u2014 monoruby::builtins::array::sample_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5774588bfb1509562afb16df45a1f032039bae77e106dd2bd99fb1de92eaac8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IdentifierTable.new: MethodTooLong \u2014 new runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/id_table.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b6ad0bd846058576176b2f25edc13f07ede4d90320e65385170319776794b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/constants.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: Executor (3-976). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a9663b6f01a3a97cc5615d6f0af8478a3b3169430d166f1b76d6aaeb6dbb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 16 shared lines): monoruby/src/builtins/set.rs:759-776 | monoruby/src/builtins/set.rs:786-803 | monoruby/src/builtins/set.rs:818-835 | monoruby/src/builtins/set.rs:850-867 \u2014 These 4 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ec7d624e897b1ae15ffeacefa639a4c7f334f275c35e69543e9520882c990"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 17 shared lines): monoruby/src/builtins/fiber.rs:464-524 | monoruby/src/builtins/kernel.rs:989-1031 | monoruby/src/builtins/thread.rs:311-352 \u2014 These 3 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b16c2d18be3aaa3491722da38e54dea6e9a91642f93b0ceb3422776e9a7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (85 shared lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:291-596 | monoruby/src/codegen/jitgen/asmir.rs:4445-4685 \u2014 These two members are variants of one another: 85 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea6800a852c555d5cefbd24cd410b32c68811f0fc2076f5b7df4548744e9437"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): monoruby/src/builtins/kernel.rs:5870-5943 | monoruby/src/builtins/module.rs:1920-2063 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5870}}}],"partialFingerprints":{"codehealthFindingId/v1":"678169b1d032f8f2273677cf039b325cbf6f88a570842ea73347fb83a6772b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): monoruby/src/builtins/io.rs:2831-2889 | monoruby/src/builtins/io.rs:2995-3083 \u2014 These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bacc58a872344b69a1242c14c2b6a4bac18ff7e628084a57476b245e427456"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): monoruby/src/builtins/file.rs:2491-2530 | monoruby/src/builtins/file.rs:2562-2608 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5193040e9f7d45ac2e1c438cfaed74963161024aff1e140b2ef1e12c64d149e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (29 shared lines): monoruby/src/builtins/numeric/integer.rs:580-638 | monoruby/src/builtins/numeric/integer.rs:667-732 \u2014 These two members are variants of one another: 29 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70eeb225bd76c0cdfc129875be4e4ab384fc73fac7507ec266e866489b9eec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): monoruby/src/builtins/string.rs:10856-10904 | monoruby/src/builtins/string.rs:10953-11001 \u2014 These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1267926351c6a8dbd2b085134cf38f7b73f0e1dfa7c7a75780cbd410d0b41f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:545-589 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:601-640 \u2014 These two members are variants of one another: 25 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f574008cbfa8447c8f02b4e52e680062375a2e24cc5c59cf764b697f0e28fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/builtins/io.rs:2688-2813 | monoruby/src/builtins/io.rs:6016-6056 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3392fbc1beae1bab88a654cf06aefdcb2341f61fdc8073c2abe613a4dd26cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/gem/gosu.rb:1762-1778 | monoruby/gem/gosu.rb:1787-1805 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e319fb48a08bbf5ba812e06fd464bd5de0e1e77b4a1ad408b8df599bc69c8c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/src/builtins/set.rs:650-671 | monoruby/src/builtins/set.rs:685-711 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f0a1316bc798f4c3b8c2eb7160db3c44608252b693fc3637f0beca55a25b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): monoruby/src/codegen/arch/aarch64/codegen.rs:105-153 | monoruby/src/codegen/arch/aarch64/codegen.rs:158-208 | monoruby/src/codegen/arch/aarch64/codegen.rs:217-272 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1638-1681 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1694-1728 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1740-1768 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1770-1799 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2784-2861 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/codegen.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddace8b784d0488acbd9fe8cd8d6148c29e0246b7e8f69fe4402d202dd6805c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:188-269 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:655-741 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:758-871 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1305-1369 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1399-1418 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1893-2010 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae805c0a39040f6daa42b9ff089bc8dc64c8cc0cd09f60756bee99ffe17e552"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): monoruby/src/value/rvalue/string.rs:149-162 | monoruby/src/value/rvalue/string.rs:192-205 | monoruby/src/value/rvalue/string.rs:212-225 | monoruby/src/value/rvalue/string.rs:236-249 | monoruby/src/value/rvalue/string.rs:256-269 | monoruby/src/value/rvalue/string.rs:277-300 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf0d75572c379eb9580cc9256f57e90689082cab4e12f25734e5d776b5eac88"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): monoruby/src/builtins/set.rs:1004-1027 | monoruby/src/builtins/set.rs:1037-1060 | monoruby/src/builtins/set.rs:1072-1098 | monoruby/src/builtins/set.rs:1108-1134 | monoruby/src/builtins/set.rs:1146-1180 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b13d80a916752c30fbc596ca7d1f7815e34389cddc830ecce7c2acc13dd00de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3134-3151 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3219-3237 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3330-3351 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3573-3592 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4156-4175 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e78279c2aab454bb2fd84cf268479e907946b603d66459a19256e9a1c2266c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): hashbrown/src/control/group/generic.rs:58-69 | hashbrown/src/control/group/lsx.rs:33-44 | hashbrown/src/control/group/neon.rs:29-40 | hashbrown/src/control/group/sse2.rs:35-46 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/control/group/generic.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9703c8d800865330d2ee0509a998ee1db7bf68c9b5f17d99ee21f26f521bd03"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/builtins/hash.rs:2199-2230 | monoruby/src/builtins/hash.rs:2378-2404 | monoruby/src/builtins/hash.rs:2414-2445 | monoruby/src/builtins/hash.rs:3959-3985 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b3a561d69282d7723864de2c80b68c288c8ef008928fea210599849cc0bf44"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/builtins/io_buffer.rs:583-632 | monoruby/src/builtins/io_buffer.rs:679-713 | monoruby/src/builtins/io_buffer.rs:1070-1126 | monoruby/src/builtins/io_buffer.rs:1181-1247 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b560a611d6238b411c92ee6994c9b1533d88930310d36a2defc98df606c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/builtins/numeric/float.rs:832-860 | monoruby/src/builtins/numeric/float.rs:869-897 | monoruby/src/builtins/numeric/float.rs:906-950 | monoruby/src/builtins/numeric/float.rs:960-1077 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8c08b5516a81e9c7b606de186ca11298632f3ec461e7c2f35083d1979821f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/builtins/string.rs:1542-1571 | monoruby/src/builtins/string.rs:1580-1610 | monoruby/src/builtins/string.rs:3875-4099 | monoruby/src/builtins/string.rs:6417-6483 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e991af78e89da0f8454e24765af7f23e5115b7fe0bf250f94f6fbd56b87f732"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/builtins/string.rs:4567-4662 | monoruby/src/builtins/string.rs:10704-10777 | monoruby/src/builtins/string.rs:11483-11544 | monoruby/src/builtins/string.rs:11590-11680 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"780e55de363bc5d900a4bea4e869664ee62369fddc35f71d4c498a82a3690071"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:398-497 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1163-1241 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:1575-2611 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4242-4301 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e6e8c9f3fd1c73866a3c7816f27d6de3c533780570c1432ac244f8d5c677fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/executor/op.rs:385-443 | monoruby/src/executor/op.rs:890-980 | monoruby/src/executor/op.rs:1181-1230 | monoruby/src/executor/op.rs:1249-1303 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff947cb16807df2e16a761c9b0a0e66a969bae5b897c164163610a3e9ea0ebd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): monoruby/src/value/rvalue/string/transcode.rs:5717-5838 | monoruby/src/value/rvalue/string/transcode.rs:5848-6009 | monoruby/src/value/rvalue/string/transcode.rs:6019-6082 | monoruby/src/value/rvalue/string/transcode.rs:6318-8063 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5717}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c4125de712b0f8f5541b984562504916d39cc5c2516fc751882115b6d213a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): monoruby/src/value/rvalue/regexp.rs:3873-3989 | monoruby/src/value/rvalue/regexp.rs:4001-4087 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7133262010524aaa9be88db1cb7a1426e34bba2c38a226ec079151329c90cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): monoruby/src/value/rvalue/string.rs:874-961 | monoruby/src/value/rvalue/string.rs:1056-1160 \u2014 These two members are one piece of code written twice and then edited apart: 88 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"6686be65245eb9719652c39e22bfb603b799f0b4220e506c0fc11062293ef8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): monoruby/src/parser/prism_backend.rs:4815-4908 | monoruby/src/parser/prism_backend.rs:4910-5012 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f2efc077b9c523b3c9f021756fd2ec2bea01527a8918adfe5384f57aa4389a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): monoruby/src/value/rvalue/regexp.rs:3249-3321 | monoruby/src/value/rvalue/regexp.rs:3545-3598 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7548b7b12b467bc8c8bbe93916ff176180634e099a7cc0dced6cfdf2dcaf8eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): monoruby/src/executor/op/binary_ops.rs:668-730 | monoruby/src/executor/op/binary_ops.rs:740-805 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb9edda2e9d5832b33605ec5bc8a6c1faf3edfc11e427f9243d89410ce9598a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): monoruby/src/builtins/struct_class.rs:669-719 | monoruby/src/builtins/struct_class.rs:734-785 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"492fcc8c8e96037404ce3e8cfa9b553614a9cb3979067a8d827e4fd33972848b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): monoruby/src/builtins/io.rs:5140-5188 | monoruby/src/builtins/io.rs:5206-5250 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccae08528578ee1fea44c297d2a36fdfd7e82e03c131adf628e73e049fd7fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): monoruby/src/builtins/string.rs:5049-5114 | monoruby/src/builtins/string.rs:5676-5723 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5049}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c7a5443a846485b499b387037b87eb4b60310c88e8fec6933234ee44557a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:730-782 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1052-1102 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ba5e34879e3dc82751f033aa4152ee40ec987e3f4f2cdc18841a3efdfda70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): monoruby/src/builtins/module.rs:1000-1065 | monoruby/src/builtins/object.rs:639-701 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff61df387040f933e7fced70e7531b89a41014deab468da19ca2335bef2af22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): monoruby/src/builtins/kernel.rs:2917-2973 | monoruby/src/builtins/kernel.rs:3163-3205 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d32b4579ab4480aa9b18bf150212089e23ff7a96188914bf95b1c5026851f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): monoruby/src/value/rvalue/string.rs:3832-3863 | monoruby/src/value/rvalue/string.rs:3907-3938 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3832}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dd1896e55c0ac23131fb5473129fe19bb2d122bbd578ededf1d1c9741f1dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): monoruby/src/builtins/string.rs:10820-10847 | monoruby/src/builtins/string.rs:10917-10944 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f9cb31a4825b4e05cb530957a418ddb383876a5cb2296c4f599c6ae70123c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): monoruby/src/builtins/io_buffer.rs:463-502 | monoruby/src/builtins/io_buffer.rs:531-579 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec33677c954661864c63031dc902991061bd4cda9af596e020bf6b3ea16ca34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): monoruby/src/builtins/io.rs:1673-1702 | monoruby/src/builtins/io.rs:2930-2967 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f606766530b11ba6940ba20b5e3cfd5e0392ee1ca1b75171c86994809c89f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): monoruby/src/value/numeric.rs:247-259 | monoruby/src/value/numeric.rs:427-447 | monoruby/src/value/numeric.rs:452-472 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"803d85728c79dc7cdfb6ea94d006f9f17cd20c181b71878987582426bc750f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): rubymap/src/map/core.rs:467-495 | rubymap/src/map/core.rs:506-535 | rubymap/src/map/core.rs:550-580 | rubymap/src/map/core.rs:623-653 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7154c8ff93c6501d680b1f0097f477b03122c823489b5a7da6f41b677f9607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): monoruby/src/builtins/hash.rs:760-800 | monoruby/src/builtins/hash.rs:811-858 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2732e94e42163edd176c83c303deab95e53c8de9071fa4999dd94f5c1392422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): monoruby/src/builtins/array.rs:3165-3207 | monoruby/src/builtins/array.rs:3278-3311 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2ccd9498a6049434887a59af5221437631a961a0f0f94eff2cc0dc6de1bf33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): monoruby/src/builtins/hash.rs:2554-2586 | monoruby/src/builtins/hash.rs:2598-2624 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"624a3f897f831254b78e3467f3e6c53d1f4cb2883ffe1627ef292fcd92c808b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): monoruby/src/builtins/set.rs:919-952 | monoruby/src/builtins/set.rs:961-994 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5a166b0fc5aec91d8b65d3a3881244b4bd6127a8327fa4404bb4be91b9db52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): monoruby/src/builtins/string.rs:2307-2354 | monoruby/src/builtins/string.rs:2357-2394 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e3aff022ef34924ffe3e173f2fa9a8200a4beb75bb9a7dcfc120e8a9f6d5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): monoruby/src/builtins/array.rs:526-563 | monoruby/src/builtins/array.rs:5116-5155 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9e45b146826e6afc0d6c1c9ff2307281574228db6d9f2e923852248c379f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): monoruby/src/builtins/array.rs:2843-2872 | monoruby/src/builtins/array.rs:2949-2976 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54774cecd488e6f35829464fa4bc00e804feda3de0ad30c61db1e4634e9e256"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): monoruby/src/codegen/jitgen/compile/method_call.rs:3620-3668 | monoruby/src/codegen/jitgen/compile/method_call.rs:3747-3794 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec1039fcb49058a7ddfa2b44884179756a9f3459fd500d9b865a5c0609729df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): monoruby/src/codegen/jitgen/compile/frameless_call.rs:502-535 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:550-580 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e237480740459d8bb048fc574b719df4cb2c3161541f169eb25e4da56e0d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/src/builtins/numeric/integer.rs:411-432 | monoruby/src/builtins/numeric/integer.rs:441-467 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4becf0023141bd79d7f1b516d1410ab74633ac5e06a2e73af10882da42dcbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): monoruby/src/builtins/hash.rs:2674-2700 | monoruby/src/builtins/hash.rs:2916-2953 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"40098d6bbf7ada6b67b4128e059afc6db9aa32f3a6f8a817e51b37e5ef9d65c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): monoruby/src/builtins/hash.rs:2851-2893 | monoruby/src/builtins/hash.rs:3885-3916 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2d398eb3dd963c44b43accb28ed2cd11d8cdfc23529075499ac61e37158167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): monoruby/src/builtins/module.rs:1531-1575 | monoruby/src/builtins/module.rs:1588-1631 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1233b4b92976dd7ac04f26a0c4ecb6496698f9dcae58491580935d146aa54397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): monoruby/src/builtins/encoding.rs:1189-1217 | monoruby/src/builtins/encoding.rs:1233-1258 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"46235fc55b531ef3fb40a235f75d243e1d3f898f4059d7a364f7a3ccf9203576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): monoruby/src/parser/prism_backend.rs:336-365 | monoruby/src/parser/prism_backend.rs:421-451 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c19fa03e7f27e78928c21afc2d98b2a1d52f782c103d6c1bf94ee7113e15b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): monoruby/src/value/rvalue/rational.rs:443-467 | monoruby/src/value/rvalue/rational.rs:470-495 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"88050d2193a954cc135cb2e5b467f1febcff8f48dd4c0d9af1d052bcb9336ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): monoruby/src/bytecodegen.rs:1143-1172 | monoruby/src/bytecodegen.rs:1538-1569 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a003f767696047535aab41765f66f6c58d81e67425a55956d998c632c8e83d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/value.rs:4144-4158 | monoruby/src/value.rs:4162-4176 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7769e9cbcc74cf5a062d51b7807f1490a2fd600faedd7131dc870aaf071e8050"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): monoruby/src/globals/store/class.rs:633-662 | monoruby/src/globals/store/class.rs:664-693 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa6ca11f77c359a8068e23ef0ff52e1bcb4a916c350f5b7d9b52c6bf2c689f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): monoruby/src/codegen/jitgen/context.rs:1391-1432 | monoruby/src/codegen/jitgen/context.rs:1460-1513 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9cc282b21c0300c36fd93eb53c7ac0553f299b0d12a3f61c5feb29c0506f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): ext/sqlite3/src/lib.rs:495-528 | ext/sqlite3/src/lib.rs:1102-1129 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e73ae2f26eab0592b014bf3c3b2fac3d164c93cd61bd8b7d62f6819ddf7fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): monoruby/src/builtins/string.rs:4354-4389 | monoruby/src/builtins/string.rs:4415-4452 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8788901fd52cc67af51782deb242bce2bcaa44fe00e14a5574b226a1e519411"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): ext/nokogiri/src/document.rs:92-121 | ext/nokogiri/src/document.rs:124-157 | ext/nokogiri/src/document.rs:213-237 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78686ef48ba06bf3e6763a3b78f5af4ebc2f69544e235a30a40524774d51da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): monoruby/src/builtins/data_class.rs:241-267 | monoruby/src/builtins/struct_class.rs:552-584 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/data_class.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8087fc2b71a609d4619e74f61dbb9d7d052c43f157b091a82a855255290ef206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): monoruby/src/value/rvalue/hash.rs:966-986 | monoruby/src/value/rvalue/hash.rs:993-1014 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfd6de83e7072bcda1f59027008b843620cdc6171a45586b054a162a5c6451b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): ext/zstd/src/lib.rs:199-235 | ext/zstd/src/lib.rs:267-296 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/zstd/src/lib.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d51294fe4cabc10d04908376fbacedf79d287dc958c0341a5efddf6fdcbc94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/src/builtins/enumerator.rs:382-407 | monoruby/src/builtins/enumerator.rs:571-592 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/enumerator.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe88d6c3aa86d7b349de6f25c29c986a9ac939a60577c2cd9506642457a27b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): monoruby/builtins/array.rb:284-326 | monoruby/builtins/array.rb:604-650 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b1f6ebeaaac485f1cd06a1c661d35638ea2c9f30a3045089faeebccacb7307"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): monoruby/src/builtins/array.rs:1263-1292 | monoruby/src/builtins/set.rs:721-749 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4964197fd782498673c269b070fde922811a9a8d777c58200190083c474f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): ext/sqlite3/src/lib.rs:1184-1210 | ext/sqlite3/src/lib.rs:1808-1835 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f040d50138351305ce67a463fc78bf938e645294da208c9590915b9bb0bf97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rubymap/src/map/core.rs:825-844 | rubymap/src/map/core.rs:898-917 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c42d194d50c29fa8bc0d7c27bc103490f89314bb96a54689ee11d893e2b336"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): monoruby/builtins/enumerable.rb:360-387 | monoruby/builtins/enumerable.rb:579-606 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd469e05769e36e21d6a0a4ce3ada2243e1bd7227a26c45582743bc6b776542"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/value.rs:1947-1961 | monoruby/src/value.rs:1963-1978 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"54958863b9969aae5c54fc5a827b4ee8826494885892d0c5381b0689d5b9ff40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): ext/zstd/src/lib.rs:331-362 | ext/zstd/src/lib.rs:368-391 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/zstd/src/lib.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6c9392cdfa599dac8cd59c2f6b543063c775de44d162b27147d156d1a33068"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/builtins/method.rs:67-84 | monoruby/src/builtins/method.rs:106-123 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7853128fab539e2b99db901bbcd25d4d851b62a32f6c683e3f135f29f2c2466d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): monoruby/src/builtins/string.rs:9212-9248 | monoruby/src/builtins/string.rs:9250-9287 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":9212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d553fbaac259005e15f0c359f8b2238fdf5f78d467b7e2232781ada77901b3ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): monoruby/src/bytecodegen/expression.rs:1557-1586 | monoruby/src/bytecodegen/expression.rs:1603-1627 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59225f6f47a8cdac60208d99d3d829e1acc20101769d9054884cd25b3364bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): monoruby/src/builtins/kernel.rs:5126-5168 | monoruby/src/builtins/kernel.rs:6457-6487 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d62c18e65198a5c18bf1b51ba93bb7cd9153c77a25fd68f961ff68c6d64911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): monoruby/src/builtins/string.rs:4742-4764 | monoruby/src/builtins/string.rs:4795-4813 | monoruby/src/builtins/string.rs:4845-4863 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ed508429db12a66d96668b2ee487f1a9c85f483a936f21edc095088cedb0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): monoruby/src/parser/prism_backend.rs:2491-2524 | monoruby/src/parser/prism_backend.rs:2526-2553 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fbc3946e8d8b99786cc708f4d30de585d46eaf285871d159d831c0e35c1b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): monoruby/src/builtins/file.rs:1909-1939 | monoruby/src/builtins/file.rs:2657-2680 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3250aba80ce8e7bd4367c02e36591c34bb9f04eab4741c17320ebb91a39b4ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/builtins/method.rs:662-679 | monoruby/src/builtins/method.rs:749-766 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"9350dca854899fca5af4b52860d1f68ff65ab494e8376845db4b826cb31da7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): monoruby/builtins/enumerable.rb:761-796 | monoruby/builtins/enumerable.rb:800-835 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01888c1edc99b2952e7384b0fdcc4ddadd3869e94b44ddb2b2f5b2cd8a32b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): monoruby/src/builtins/numeric/rational.rs:216-240 | monoruby/src/builtins/numeric/rational.rs:243-267 | monoruby/src/builtins/numeric/rational.rs:270-294 | monoruby/src/builtins/numeric/rational.rs:297-321 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/rational.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0ab11a3b5379f33ff5a17c93c4db33f4ea77c235a9fc4fec7b411ee5e1ab1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): monoruby/src/value/coerce.rs:434-463 | monoruby/src/value/rvalue/string/pack.rs:1550-1575 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71af179368a8f1ae5cc24db06e1a41eb09e5cee2ad70faf04db096cb76666d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): monoruby/src/executor/op/sort.rs:194-217 | monoruby/src/executor/op/sort.rs:228-252 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"535707bcf46d37faac895e692b818710921951aa9d528884d0e931d65399698d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): monoruby/src/builtins/dir.rs:1143-1163 | monoruby/src/builtins/dir.rs:1172-1198 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c449b8f7e2e836abad5944d74f99e74940a82f0644e2139c709864e1cbfd6fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): monoruby/src/codegen/runtime.rs:2196-2226 | monoruby/src/codegen/runtime.rs:2239-2270 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a6adad96b70440128f44e71d0ad43c76dd40b14afc828096402cc9c08d7490"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/value/rvalue/io/buf.rs:324-354 | monoruby/src/value/rvalue/io/buf.rs:401-423 \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":"monoruby/src/value/rvalue/io/buf.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84e62532a6e4568d376f42c90f31a3114a00effed4e4685a471fac02eaba23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): ext/sqlite3/src/lib.rs:1269-1294 | ext/sqlite3/src/lib.rs:1395-1423 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"45556fac34e4211da75a27b90e6bf915117e603f510dd234543c91dfa299bc71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/builtins/array.rs:3323-3340 | monoruby/src/builtins/array.rs:3463-3480 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6714209a550f86a1ccb29bfac110f48bfc4ff05cdae7ff4329dd15b216efea2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): monoruby/src/bytecodegen/expression.rs:2632-2653 | monoruby/src/bytecodegen/expression.rs:2655-2673 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb4a13d152faac53f2c5b8e5f36e01d80bd853c08310fd4ac01c45953ad1cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): monoruby/gem/strptime/strptime.rb:85-118 | monoruby/gem/strptime/strptime.rb:341-369 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5191350918d40ef50b3a6c627c0db7c33a3e9ad6ffa920127c116353bb500461"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): monoruby/src/builtins/array.rs:1125-1151 | monoruby/src/builtins/array.rs:1180-1213 | monoruby/src/builtins/hash.rs:1106-1128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"218f57d2a26f341165c0ef8a534027a87f2772f66828dc21cf98a4566e23edd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/builtins/kernel.rs:5045-5067 | monoruby/src/builtins/method.rs:199-223 \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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5045}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70ca75379d8fcb3e13585f894fc7816289924e40944f60145b191e6c7df27f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/module.rs:2335-2349 | monoruby/src/builtins/module.rs:2436-2462 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b3089c66815b9d32d2176e7b4466ca83201529c18fd67923b200ea0132a1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): ext/nokogiri/src/node.rs:255-277 | ext/nokogiri/src/node.rs:280-301 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f7fd576f4f4aecb7bc973a03220710f48980fefe7a1c3ae1af5d0b38a500fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): monoruby/src/builtins/hash.rs:2167-2187 | monoruby/src/builtins/hash.rs:2347-2368 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8d32a129454126e81eb79a55dd25e8bf5dfda4cef3c9b7f2dd0c455736bb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/src/parser/prism_backend.rs:2951-2981 | monoruby/src/parser/prism_backend.rs:2983-3004 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5922d9b6a0e5c3989f5e6297745667c8feec51d9baec27508378ee4f72fc66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/codegen/jitgen/state/read_slot.rs:432-457 | monoruby/src/codegen/jitgen/state/read_slot.rs:562-584 \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":"monoruby/src/codegen/jitgen/state/read_slot.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3042c7434c78bf64e6346aaca0b1e9214240ba304005af85764a3f2971fbe40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/builtins/array.rs:4613-4632 | monoruby/src/builtins/array.rs:4641-4661 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02bc8e3bb9c873ef8f5d9eb4741601fd4a5c5649d85a0c4a3ff318db770ae2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/gem/ffi_c.rb:1027-1051 | monoruby/gem/ffi_c.rb:1236-1257 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/ffi_c.rb"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"b224761438bb0a82b11bdf960813733b4170e3fc6b6e5862258e700781910e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): monoruby/src/codegen/arch/x86_64/invoker.rs:74-101 | monoruby/src/codegen/arch/x86_64/invoker.rs:103-130 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afbb7691f7716fff86453e8158dfe74e3fecfad3b187dc62a7dc1070b374038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rubymap/src/map.rs:986-1001 | rubymap/src/map.rs:1119-1134 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3dc9791e56545c7978e45150bedd1569aff7c477c7630374f1ce8e62084192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/hash.rs:3445-3459 | monoruby/src/builtins/hash.rs:3496-3510 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3445}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a411f2116bc8fd9118d56e100fcf8e6fdf16865633752328a1cd869589a13ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/gem/gosu.rb:907-926 | monoruby/gem/gosu.rb:936-952 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c7660f5dd60d1887be8635883259d5cc40b6ac1b99af32c842e63c19d58731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/arithmetic_sequence.rs:459-476 | monoruby/src/builtins/arithmetic_sequence.rs:486-500 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a9d3ac98cce6d830fce392629b65329c0a6a8b38cb5e37d8e97bea06e62a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/process.rs:2051-2065 | monoruby/src/builtins/process.rs:2067-2079 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b9dad87c543e98e286a16d88949ccdf415f0b96f08df35df92398ae8b93435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/builtins/string.rs:12576-12598 | monoruby/src/builtins/string.rs:12608-12627 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12576}}}],"partialFingerprints":{"codehealthFindingId/v1":"146bdcb571d74cd449c39e52f450447684f0b24de84b2f0b71205fdfe841b2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/builtins/module.rs:2616-2636 | monoruby/src/builtins/module.rs:2650-2666 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced0ae0201db43974b84c1cb06a9097298d64e8f7d6180b1557ffa3ccdb356a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:51-73 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:79-101 \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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5b89a55339513b68fad1867bf6cb6d1b52d82f6bc3681e47ae7269e9d5e5e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): monoruby/src/codegen/compiler.rs:1192-1221 | monoruby/src/codegen/compiler.rs:1243-1263 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/compiler.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd0fe7b36ae7920e819aeb0a99a8f38435b5190cc1d588f488f684c7e3df298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/executor.rs:4850-4869 | monoruby/src/executor.rs:4877-4900 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":4850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f3c18fbf14d920b4824350fc865676e0e255a7939f86b897bf092efbb1805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/builtins/string.rs:4717-4733 | monoruby/src/builtins/string.rs:4773-4786 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4717}}}],"partialFingerprints":{"codehealthFindingId/v1":"8108de630ef5c5e0a2dac415a812627905b2908e9302a5d696c3abff0024e4e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): monoruby/src/builtins/module.rs:626-644 | monoruby/src/builtins/module.rs:658-672 | monoruby/src/builtins/module.rs:686-700 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"4514f9970035ef65b176204ae005c888f545614736d7da45d2d2532422036a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): monoruby/src/builtins/numeric/complex.rs:334-354 | monoruby/src/executor/op/binary_ops.rs:41-66 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"beafccab78532db3860539eb23faae1aa15a635a52d1c73f7b79d054f4c83c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): ext/nokogiri/src/schema.rs:267-287 | ext/nokogiri/src/schema.rs:290-310 | ext/nokogiri/src/schema.rs:318-338 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/schema.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c6117aa7b05551dce85d2e476b7744ca4ac3b0c40c3bd3e921a86b54413b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/file.rs:961-973 | monoruby/src/builtins/file.rs:3045-3057 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"36db4e69cc886a22fdb77ded659f991b0a7880791a430fd1c29e60b699c960ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/file.rs:1563-1577 | monoruby/src/builtins/io.rs:4923-4935 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd9b9c92547df180a433949f1fe41cbac5f400c764b779213ef221739943177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3779-3796 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3799-3816 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3779}}}],"partialFingerprints":{"codehealthFindingId/v1":"940e67bcd0aaa05b3aea332a1d8a2eff7088c41051124a95a67cf899b79a1b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rubymap/src/map/core.rs:595-607 | rubymap/src/map/core.rs:667-679 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c438c52936ccd40c9d48e163320a8a73bb9dc55b0e6b764a31fd60387a37344a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/builtins/module.rs:2547-2566 | monoruby/src/builtins/module.rs:2574-2602 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa86992ef9d20b58cd8d3880751c51febb97bb5083453452220c34877c4ed3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3360-3380 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3389-3408 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4098-4118 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4126-4144 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9005109809c7bc97f36b77f0393f01d4082e831a1fdc3e1bea881782aec0138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): monoruby/src/codegen/arch/x86_64/invoker.rs:322-345 | monoruby/src/codegen/arch/x86_64/invoker.rs:354-377 | monoruby/src/codegen/arch/x86_64/invoker.rs:381-403 | monoruby/src/codegen/arch/x86_64/invoker.rs:435-457 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf25ff02c33df71fe9a268580f68d4454d8fa4252c5a1b95aa80ca87bc01189a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/gem/bigdecimal/math.rb:495-504 | monoruby/gem/bigdecimal/math.rb:523-532 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"70325afcb30b5c0cb39a2f20f7bcf64e2bbecde8680222683cff58c09b5c0ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ext/markly/src/lib.rs:52-74 | ext/psych/src/lib.rs:34-49 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec30c733dfe9475d5e3c21370d677f675a48879fc1f5c88a67e3dcb7f23513dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/builtins/array.rs:2491-2507 | monoruby/src/builtins/array.rs:2517-2533 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a6d9c1a189411b9e4064df7487f04fb5ed32bf237c6534e108fd316f6cdc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/builtins/method.rs:408-430 | monoruby/src/builtins/method.rs:452-474 \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":"monoruby/src/builtins/method.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17ca581e8e18f0e054afab4f1a42107f7758b4254b336800dc0c97a8fd27434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): monoruby/src/value/rvalue/string.rs:1248-1268 | monoruby/src/value/rvalue/string.rs:1277-1295 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"843827781275ec7193410973459604389ed6447d6341471edea37c412106dc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): monoruby/gem/json/common.rb:684-714 | monoruby/gem/json/common.rb:855-890 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/json/common.rb"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"774efc87345303ffca1303e19f3768696e22dc420dd09c9c7777ddd28b39c18c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/builtins/numeric/integer.rs:823-847 | monoruby/src/builtins/numeric/integer.rs:922-944 \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":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b90ee651c8728b7a67d40db5eff460370029dc5ce83d63a8a167011755ee1a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/globals/error.rs:1714-1726 | monoruby/src/globals/error.rs:1777-1789 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"708a0eef3e9fd93a95958018dea2289dd057d85ea6e88c697299fc85e85a9e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/value.rs:2339-2356 | monoruby/src/value.rs:2363-2380 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5150e12b0e8f41439abbe7d3b5c7a1190d3dea674eb569b686fd682a4e1a0b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): monoruby/src/value/rvalue/thread.rs:231-259 | monoruby/src/value/rvalue/thread.rs:272-300 | monoruby/src/value/rvalue/thread.rs:305-333 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6919555ed70ae4102695bf83796eb8fc7ab1e411fc7d5f542c20e6267f54980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): monoruby/gem/msgpack/msgpack.rb:253-280 | monoruby/gem/msgpack/msgpack.rb:284-307 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"18182921211e5442417ff9dfe7dcab436e6b028a1aea1e0f44a6a85ae53ae927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/codegen/jitgen/context.rs:3581-3613 | monoruby/src/codegen/jitgen/context.rs:3633-3649 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99a342eb33bcbd0bfa61f5a293162029f211db400a7213f284ed8f459a1c0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): monoruby/src/builtins/numeric/integer.rs:1537-1552 | monoruby/src/builtins/numeric/integer.rs:1561-1575 | monoruby/src/builtins/numeric/integer.rs:1589-1604 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaffa8697ad01445abbe313247967fdff43aa6bb5ec9afb6c88212fef5c21049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/builtins/module.rs:3208-3226 | monoruby/src/builtins/module.rs:3245-3260 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ef5d7fd9c006661dbcb904269b738c9a786af667d7b9bf5d72220c15910b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): monoruby/src/builtins/binding.rs:468-487 | monoruby/src/builtins/binding.rs:529-547 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faa2fa2b6a52c39cb2b742d6022edfc017b09e991eb7534ebcab3851111a0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/globals/store.rs:1859-1878 | monoruby/src/globals/store.rs:1887-1902 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0fd7ebf4e6393967016c2e5a835ba3653d957eebdea56ce5f467db6601cf74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): monoruby/src/codegen/jitgen/compile/frameless_call.rs:695-737 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:882-911 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3387777978253a5ffb1e2190d897016f16c1ad9e1b2c4c2f224d055e3dfe41ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/codegen/jitgen/state/read_slot.rs:100-124 | monoruby/src/codegen/jitgen/state/read_slot.rs:239-261 \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":"monoruby/src/codegen/jitgen/state/read_slot.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c681995269f5a53b40c33bd4ed55649ff046762180073357bd054911c2b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): monoruby/src/value/rvalue/io.rs:314-345 | monoruby/src/value/rvalue/io.rs:349-369 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cd6d819531dee2225704a45a9726cdd847e00238dc3c0f890efad6283e2d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): monoruby/src/builtins/io.rs:6731-6742 | monoruby/src/builtins/io.rs:6755-6766 | monoruby/src/builtins/io.rs:6779-6790 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6731}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b72fa015fd7e7368d41bc3e64d9a17023fd97e2bd606c9054dbbf9a117429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rubymap/src/map/core.rs:1178-1195 | rubymap/src/map/core.rs:1207-1225 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfb2cd43664e9b9d456d11c051a6b875481d3301de20b501edd83df822fa8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ext/nokogiri/src/document.rs:69-89 | ext/nokogiri/src/schema.rs:151-166 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff4eb0152024a2e62f53662c9828fb3fb0e87a9deb8b3d325da9f0dca1ad60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/builtins/array.rs:4083-4101 | monoruby/src/builtins/array.rs:4133-4148 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"2705fc1b6a2620d85da47d1671ed01c56f8a79b657ab92d2c71ae2434bf51616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/process.rs:679-702 | monoruby/src/builtins/process.rs:735-749 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d378c041b0362d5d18f618b0357fe28e108293c8cf0388737de026b8c89398"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): monoruby/src/builtins/string.rs:5290-5312 | monoruby/src/value/rvalue/regexp.rs:4138-4160 \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":"monoruby/src/builtins/string.rs"},"region":{"startLine":5290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0763debbcb5916e7874c0c15ffd8374c7c0c95ecfd0e332378565848032ca488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): monoruby/src/value/rvalue/string.rs:5043-5082 | monoruby/src/value/rvalue/string.rs:5133-5156 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fddd77e9f40f17c9994e13c60f70ff594792f37a790f918d191e083adc805f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/nokogiri/src/node.rs:498-514 | ext/nokogiri/src/node.rs:517-533 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a35690ce6528edde7f535cb44ecf07883b42d994a077853259bb748e68a4d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): monoruby/src/builtins/range.rs:192-209 | monoruby/src/builtins/range.rs:230-247 | monoruby/src/builtins/range.rs:360-377 | monoruby/src/builtins/string.rs:7384-7404 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f3b59c645608b1d4ec2cf6007a87dc662f30181ed4363d1da96fde59b87daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/codegen/runtime.rs:1018-1036 | monoruby/src/codegen/runtime.rs:1049-1066 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5c46319f3ce9dcfb91ab375886196e57588326a939de63662703a2bc7a1c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/value/rvalue/fiber.rs:448-460 | monoruby/src/value/rvalue/thread.rs:386-399 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd474defa2c82164bb159888715107c1b5d0812a30c5bd5913e50f39dbf2f35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/builtins/hash.rs:1826-1839 | monoruby/src/builtins/hash.rs:1855-1870 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"2653764e6c3c2b7c56d6ce7f0bac69d7367c8c67d3ca08b9ad46f3b708e143e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): monoruby/src/value/rvalue/io.rs:1178-1193 | monoruby/src/value/rvalue/io.rs:1230-1248 | monoruby/src/value/rvalue/io.rs:1290-1310 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bc715a6f6427573ae9ae667aa2e0c288dc7878a998e7dcef5def2ef659630f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/encoding.rs:4264-4278 | monoruby/src/builtins/encoding.rs:4286-4303 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"596d3cb0a58f64595555aa33a3ef6dc933a456c15730659579c2cff6563d4df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/value/rvalue/ivar_table.rs:223-236 | monoruby/src/value/rvalue/ivar_table.rs:242-255 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/ivar_table.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2f1482f3ca1995bc8aaadd43d80c7c534ff7da893dab8aeea2303963d18e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/marshal.rs:1531-1542 | monoruby/src/builtins/marshal.rs:1546-1557 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa2032f011a604e4e9e51985293078311cff32e09bdbcd18e589ab0710bd1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1477-1490 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:1506-1519 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"800e0fc01934924586b5946edb98df442075c2f5a8ff316df7952350c054c113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/numeric/float.rs:1226-1240 | monoruby/src/builtins/numeric/float.rs:1249-1263 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"024334c70e840c0489fbdd55a4166e7eb7be48f95a91bfefe794dd7c190309b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): monoruby/src/builtins/string.rs:12349-12367 | monoruby/src/builtins/string.rs:12377-12399 | monoruby/src/builtins/string.rs:12470-12488 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12349}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d38bc4c513eb5c64bd48d19e1adcdb75ee866c1f8507e14a67ae1a230be14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rubymap/src/map.rs:591-616 | rubymap/src/map.rs:683-706 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd711b77e419820b7d7c5d16f28510e641290dad2cd81e930d86c1103dd8937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/encoding.rs:4321-4332 | monoruby/src/builtins/encoding.rs:4340-4351 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":4321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97118f0f42c46809e5ba5cd74d804bb5e26b83b3de658efe7195a3b6eda7988"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): monoruby/src/codegen/jitgen.rs:1692-1706 | monoruby/src/codegen/jitgen.rs:1713-1727 | monoruby/src/codegen/jitgen.rs:1733-1747 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"528a92679fba007084ac00ef17c3bf36d646d85458967b9af9035c0401f61795"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): monoruby/src/builtins/numeric/complex.rs:612-627 | monoruby/src/builtins/numeric/complex.rs:640-655 | monoruby/src/builtins/numeric/complex.rs:944-960 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"3770cfd038ee63aa884b943e2ad34174b0784eda7380cc846b929444f23aaa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): monoruby/src/value/rvalue/string/pack.rs:2083-2107 | monoruby/src/value/rvalue/string/pack.rs:2115-2139 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65bd2559d439208cab0a84646205d926c1b6158fa2ef043aeb24a6ab6c4ec85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/nokogiri/src/node.rs:323-338 | ext/nokogiri/src/node.rs:352-364 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cadd5006923f00032098905f2700e8b856c94d004f33ea502ff216ae7dca76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/builtins/string.rs:12730-12749 | monoruby/src/builtins/string.rs:12762-12783 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12730}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8550f47941c463691eebbc7b4f627987edad620a58ba901f545f6d3076d444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): monoruby/src/builtins/time.rs:1094-1103 | monoruby/src/builtins/time.rs:1114-1123 | monoruby/src/builtins/time.rs:1134-1143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794b8421372ec53ec2ea662821967a82862059c6e0217390cfb1240297c2f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3418-3432 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3547-3563 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98bea414c46c4beacff7ba129d6ea96b7d57787d60a60dc9d22d13a03f05b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/codegen/jitgen/state/slot.rs:2193-2210 | monoruby/src/codegen/jitgen/state/slot.rs:2212-2227 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ab1246a8b280d2655b60e6f9b11351d308627977dd693418ab0f1e418dae5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/executor/format.rs:307-329 | monoruby/src/executor/format.rs:341-360 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"834aaa26eb1890e76b1304a20a28c57a975f29039e6c57c8f91068d9384e4157"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): ext/nokogiri/src/sax.rs:673-687 | ext/nokogiri/src/sax.rs:705-722 | ext/nokogiri/src/sax.rs:725-741 | ext/nokogiri/src/sax.rs:744-758 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"560952786dc1850e68cae85743459d4001f02776214397097c252fe9f6401db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/module.rs:2362-2376 | monoruby/src/builtins/module.rs:2496-2515 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c245bfaeb2789b5f27da59d0d3a49a01f76933cc3565fafd1752ea97d29cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): monoruby/src/builtins/array.rs:442-462 | monoruby/src/builtins/array.rs:490-510 | monoruby/src/builtins/object.rs:554-567 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"962020abdac5f5993d8ce58330ebc618cb9d16ff0fa9e1a10ca2bfd3a9b4f158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/src/builtins/io.rs:2415-2435 | monoruby/src/builtins/io.rs:2444-2463 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"823deb49705504c07f9f1b9b32ebdc4ad8346917032a4fe4b9a88b2134432d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/ext.rs:2286-2301 | monoruby/src/ext.rs:2338-2357 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfebfa507a1faefbe5125cdfbd3e72bb3647cacc86475face8041bfb269fd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): monoruby/src/builtins/array.rs:3421-3434 | monoruby/src/builtins/array.rs:3444-3453 | monoruby/src/builtins/array.rs:3490-3503 | monoruby/src/builtins/array.rs:3513-3522 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f34a2fc79eae2b63076f25345b134d8a005f6c244cb9226f6ec2a2435a5d7a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/gem/bigdecimal/math.rb:231-242 | monoruby/gem/bigdecimal/math.rb:257-267 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"124aa4785ad47210a0eb4aeb31122a9553ad4929c7d033039eb97317f082a6b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/codegen/jitgen/state/slot.rs:2229-2242 | monoruby/src/codegen/jitgen/state/slot.rs:2244-2257 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19d2177a41fa125a2d0ac95a90c525fdb17ee9b1808439151530c84052d847b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/ext.rs:1850-1867 | monoruby/src/ext.rs:2444-2456 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6429e2dd837a00a32598ad5771e8d3ec079feb5018982b07a4b9f6c30703e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hashbrown/src/map.rs:1309-1320 | hashbrown/src/set.rs:860-873 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5f1d1bf35877642bbfc2aa73a247d98da438c738c8e750f9f300bf13592748"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): hashbrown/src/raw/mod.rs:3195-3216 | hashbrown/src/raw/mod.rs:3248-3297 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05e4a79cdc151f629ae7ca8217f7472888cf40878d4878a079f26d7aa4509b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/value/rvalue/array.rs:510-523 | monoruby/src/value/rvalue/array.rs:531-544 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/array.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d517ab85b8771828000d882abb8bd79cd2c3c5d4323bc76c8bd9b2df53bedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/value/rvalue/hash.rs:1078-1097 | monoruby/src/value/rvalue/hash.rs:1103-1118 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b07013bade9ba4d4b4371dc679e2f27ed8cca365f07a3a71c7c380b096c3ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): monoruby/builtins/enumerator.rb:193-224 | monoruby/builtins/enumerator.rb:235-259 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerator.rb"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bc0d6c8cd802e134a213b7aa4f3272fd6ffac9fd00c78b2886ca0996cdfcf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/codegen/jitgen/state/binop.rs:770-780 | monoruby/src/codegen/jitgen/state/binop.rs:793-806 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e658e09250d3caf1cd889ff7cf57cf4354fdd199ca0d121f3f93412895227122"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): monoruby/src/value/rvalue/string.rs:50-68 | monoruby/src/value/rvalue/string.rs:116-147 | monoruby/src/value/rvalue/string.rs:829-847 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca64a9e9a8e9997e870313533e57b1ff9ade680ba757b8d694f223131b9ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): monoruby/src/builtins/json.rs:241-262 | monoruby/src/builtins/string.rs:2037-2062 | monoruby/src/builtins/string.rs:6382-6403 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d177fc30c06d7474dd6a50a3e3a30e416e684e768ef7f488cb646d65ef692ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/builtins/enumerable.rb:1182-1206 | monoruby/builtins/enumerable.rb:1213-1232 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"344269b96b7332d7195cf2a8f5520c4bcf3b7bc063703924406b1f5a9300df7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/string.rs:10685-10694 | monoruby/src/builtins/string.rs:11571-11580 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10685}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcd7973acf9d5685745a81726f5bb06758fb2bc38d7a760cf0b9859ec6104fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/executor.rs:3769-3778 | monoruby/src/executor.rs:3786-3795 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c48a2d0ca816183f8f7131ea0a68c9d661a4ede795275d719b41729b2737f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/value/rvalue/io.rs:1380-1394 | monoruby/src/value/rvalue/io.rs:1420-1433 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c3937f77b82afbac7a9bc52ac8752a7a232b90fa0e8205d1189a48d66f85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): hashbrown/src/set.rs:636-643 | hashbrown/src/set.rs:681-695 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cf8aa52f85515fd8def528cecfc2b2ea8ac6946ad1c1a5f51bf6241820609d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/alloc.rs:2183-2199 | monoruby/src/alloc.rs:2221-2249 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf21576b10629bb22299d9462a4767f713d66898b1c6da9933cb16b76913ebf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): monoruby/src/builtins/array.rs:219-258 | monoruby/src/builtins/range.rs:77-118 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0698d5b68313eb4ee80c09af17567eb24972a3f966ab2b604bf9c85dd7c07f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:894-925 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:986-1007 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03bc4f666bec88e27c93de9215a0ca29dc0a8248781008a4586823a0d54fa00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/zstd/src/lib.rs:476-490 | ext/zstd/src/lib.rs:493-501 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/zstd/src/lib.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7144344d5b6147b969b581789844acca76475db7b0ceee972c54f8b0b9855be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): monoruby/src/builtins/file.rs:1955-1962 | monoruby/src/builtins/file.rs:2333-2340 | monoruby/src/builtins/file.rs:2355-2362 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"70029cd61e00f16e61795ffc4ff61a7e3648a00846cfed5a6799071d56347933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/bytecodegen.rs:557-573 | monoruby/src/parser/prism_backend.rs:5722-5738 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eaf680e5d60b0d5a73b4a0754e74de96b8fef891e83dad115b246e925a6cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/codegen/jitgen.rs:1755-1767 | monoruby/src/codegen/jitgen.rs:1775-1787 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11c48a8d8d50fe35e94f2e4b11916a33028a9cf077422546016a9dea34f5efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/src/codegen/jitgen/compile/binary_op.rs:1346-1367 | monoruby/src/codegen/jitgen/compile/binary_op.rs:1384-1405 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4db9c847506e0eb374c116e454557b72443ecde0806ee008c7c23240ac9171b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/globals/error.rs:1630-1639 | monoruby/src/globals/error.rs:1641-1650 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb3486cd0ce2a2cae14570dd2b7b5678b754c221b699a86a9903b94a8a46f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/builtins/struct.rb:66-77 | monoruby/builtins/struct.rb:92-105 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/struct.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b9140f7ba8694baec85a97757e70f489fb85a7e7f0dcbbd2bd90a0a4f4522a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): hashbrown/src/map.rs:1021-1036 | hashbrown/src/map.rs:1064-1079 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecd44549901c2cdbb762d4019119892ac90c26b787b0135a38ea59400792dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): monoruby/src/builtins/process.rs:568-581 | monoruby/src/builtins/process.rs:609-622 | monoruby/src/builtins/process.rs:630-646 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8a946ac7c81f55b4715dbe1dd6d57e81f36b815dab4b0e3c9d027c47fce7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/codegen/runtime.rs:2374-2392 | monoruby/src/codegen/runtime.rs:2403-2417 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdf1896646cbf45b92a8c6e0eea56c51a048d3d05faa5e9b1777c4fc4e4b20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): monoruby/builtins/enumerable.rb:1127-1148 | monoruby/builtins/enumerable.rb:1154-1173 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc304fe2d67c98de99c72be68a19d8425adcd953baef3d8c27871fe8387c5024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/kernel.rs:774-789 | monoruby/src/builtins/kernel.rs:793-804 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"324ee6d2c45372d7cde4e10469bf351aefd8f2d0d0c168ea4055ec3ea0d6cae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/numeric/integer.rs:754-768 | monoruby/src/builtins/numeric/integer.rs:869-883 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f85b6dcfe2b91ad974c8ab47ff2c85c9c4d0c2e4b860053392f6ea7013d6cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1153-1163 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2619-2629 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2904387ebe0af17d386e1ce34835bdf98792b0fe62027a2f2e29098b50e7cccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/executor.rs:3363-3387 | monoruby/src/executor.rs:3436-3449 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3526a5e49d97e17535b3dd2ed054d68792b19df8b4a6afe799ea960b887be371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/ext.rs:1145-1157 | monoruby/src/ext.rs:1999-2013 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce37bdd321acd708930426c029f740e914837a347fa67e897cc334254ce8211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): monoruby/src/builtins/kernel.rs:1992-2008 | monoruby/src/builtins/kernel.rs:2415-2431 | monoruby/src/builtins/kernel.rs:2869-2885 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd311f83b8c64fdf27355fcd9732f2e84b793c4593627f737b337bcece9e1220"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): monoruby/src/builtins/range.rs:387-398 | monoruby/src/builtins/range.rs:729-743 | monoruby/src/builtins/range.rs:748-762 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb341dee17281de8747d3351aaa823b832150eacbf9af9c29ad4c7e5ae666750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): monoruby/src/value.rs:2197-2215 | monoruby/src/value.rs:2228-2250 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d6653f2135deb1b4ab5d70f9f9c59b19351b31cedad94801a72e742c2bb6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): hashbrown/src/map.rs:1543-1560 | monoruby/src/value/rvalue/hash.rs:1257-1280 | rubymap/src/map.rs:1711-1727 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd8a8c8b4fc688481b395407fdc59549685e40740b26d2f4f0fd9be83b4ab37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): hashbrown/src/map.rs:3976-3992 | rubymap/src/map.rs:1676-1693 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded080b73469c296e5a5bf20a2fe855c24e102080e7d13d027ae535f69bce2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/method.rs:775-787 | monoruby/src/builtins/method.rs:796-808 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8669af818ef45860e893d1aca27ce28c1a296228306f2d0f635b68e817f58466"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/method.rs:871-880 | monoruby/src/builtins/method.rs:887-896 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"8426bebaee460e06f68d2a150f6f5c387435bb4232ee957ade42518cad6a7f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/codegen/arch/x86_64/compile/mod.rs:2561-2573 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2590-2603 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6ffb245de9ea884a22a777b0b040b147498762eb932373c4fcac85c8a15cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/value/rvalue/string.rs:169-184 | monoruby/src/value/rvalue/string.rs:1940-1952 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e39fe917c36ebafd3b3e8666087b4c3e71872c6066a7609f8c75f459014ade6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/gem/gosu.rb:1672-1678 | monoruby/gem/gosu.rb:1682-1690 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a44a0e726f5abdabb22b19d9153f4d3c85a6a9e02c0cb25e768ddf9495c78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/gem/nokogiri/html5/document_fragment.rb:191-210 | monoruby/gem/nokogiri/xml/searchable.rb:211-225 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/searchable.rb"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c75b48b1d2da55e80b078759fb4d5ef07c55858c182f1c676f95d81872a2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/builtins/numeric/float.rs:785-803 | monoruby/src/builtins/numeric/float.rs:807-823 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d572594fd1cab1692fdb0d21aed50a6c47abe61d0f2cc30d723692705cb0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/executor/op.rs:1771-1781 | monoruby/src/executor/op.rs:1840-1850 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7977c9757bb72ba574d8e26d0a59ba86bf0470b90332f4c63523b752ced37a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/builtins/thread.rb:763-780 | monoruby/builtins/thread.rb:859-878 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/thread.rb"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd41d9c5ac14191ae73dd44b5e6606b6a1168ab3359d17328d24e6f800c45c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/array.rs:1982-1994 | monoruby/src/builtins/array.rs:2580-2592 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca1ae5487ce1f7bb65e0fa4bc064831e8d0abe9409d4558bd9eea17ff3e4914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/string.rs:7724-7736 | monoruby/src/builtins/string.rs:12139-12159 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7724}}}],"partialFingerprints":{"codehealthFindingId/v1":"7971230dea3335962039c5710cf62659744c9ae0f6682aa4ef299cb78a3159b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2636-2644 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2650-2658 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2636}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd445e4c73c71da1b37ee19922ecfdf0d7aca9ba4e20c57b9adc439cb9d01fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/globals/store.rs:994-1009 | monoruby/src/globals/store.rs:1036-1049 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbe7c01a8ccbb8ac140b23c8bf1dfac0db07d1758180d556670764fbd03d887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): monoruby/stdlib/open3.rb:72-83 | monoruby/stdlib/open3.rb:88-98 | monoruby/stdlib/open3.rb:103-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/open3.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a900ceef6c9f89ff7493dcb4393af18537cefe88b0fd0d1032ce89a941a2610d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/markly/src/lib.rs:368-376 | ext/markly/src/lib.rs:381-389 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0b360ad36eaaa93c62bbcc785df187a4c94dac41fba5a74b3fa0fb7e14a5a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/set.rs:516-528 | monoruby/src/builtins/set.rs:625-640 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"14409a666d79ef7f2566c77fec1314f55d0536cf41468dc42a36449abbc376e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:814-828 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:830-844 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"019c03f7003684d7bf57ca11d89c7cb26be03e4fb82cd81313adcdd1d4f753bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/codegen/jitgen/state.rs:592-605 | monoruby/src/codegen/jitgen/state.rs:607-618 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"079d2367c00ffe53f05cdfd1076a7d7194191dff7cc761cfc098037415629065"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/codegen/jitgen.rs:1652-1666 | monoruby/src/codegen/jitgen.rs:1668-1684 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa8467ecc9765922887b0b64b71cd40078f0dcc8709f18827c31c391ab0056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/globals/error.rs:64-75 | monoruby/src/globals/error.rs:80-93 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"424c9c5a45a0d5ccfb21e0f58826554987654c964405440f7304d5e8a13ddb72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/value.rs:772-789 | monoruby/src/value.rs:815-833 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd05a28c05d4974c0c14605ecd6f8641806fa7349b67b4c9c7da36498e86cacf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/value/coerce.rs:548-556 | monoruby/src/value/coerce.rs:564-572 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b7f231d44bb4714f1be4fede0e8476bac54dddd1eaa816235c3f3ebdccc239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/io.rs:2522-2532 | monoruby/src/builtins/io.rs:4369-4378 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6036e490a74c4bbd024dc841b3286137df53317e15841afec871a5c1c80bb2e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/builtins/numeric/integer.rs:1808-1824 | monoruby/src/codegen/runtime.rs:1532-1548 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc76603a0b82179ad8dc09614cbcbdd71178ac366c33de485de6b5ebeaf882b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1398-1420 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:1431-1447 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4333-4354 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4361-4377 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5bae596d030391dcfb93fa68ae990f1e454fe769c63aa4093fc957be48b5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/globals/store/function.rs:1075-1088 | monoruby/src/globals/store/function.rs:1115-1128 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11377895ab5fc0cdf834bcb103b0b135ec9efbabaaa250eb57bf40d95a39012"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): monoruby/builtins/enumerable.rb:474-495 | monoruby/builtins/enumerable.rb:499-520 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1558919ebbea4fb9b71bfc4aef8b9ba04d7420c01783216c8b07d3f806ea81f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/nokogiri/src/dtd.rs:340-353 | ext/nokogiri/src/node.rs:868-880 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c66d4a634207d8cec6563caaefb37363f7a50b94b3ea7cacc3d0d695bc1493"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): monoruby/src/builtins/match_data.rs:341-349 | monoruby/src/builtins/match_data.rs:360-368 | monoruby/src/builtins/match_data.rs:379-390 | monoruby/src/builtins/match_data.rs:938-949 | monoruby/src/builtins/match_data.rs:960-971 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f842281da0ab71d3dcbdfcd14980767c442a61616d70804ad2d9721e62060bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2664-2673 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2677-2686 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb679a7e8ad4e723a99ceae02ddedeb38829c51bf4e62a7f7c9ddc5be124a444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): monoruby/src/ext.rs:2611-2626 | monoruby/src/ext.rs:2807-2819 | monoruby/src/ext.rs:2826-2840 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"499fb781a3730fb5176a878646ff5e04c5afdc142ae7e8cdff12aeb9c9275a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/nokogiri/src/node_set.rs:255-265 | ext/nokogiri/src/node_set.rs:268-281 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node_set.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a30233248f5035da6f6da43ab5896416fb764283c71e8a4721d889eadf1eb5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/data_class.rs:179-188 | monoruby/src/builtins/struct_class.rs:475-489 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/data_class.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"580ad78a87dcd223efbaaa9f38621e2c8c53609a60db88cf4c7715fe31d3bf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): monoruby/src/builtins/hash.rs:3372-3379 | monoruby/src/builtins/hash.rs:3382-3395 | monoruby/src/builtins/hash.rs:3406-3413 | monoruby/src/builtins/hash.rs:3416-3427 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3372}}}],"partialFingerprints":{"codehealthFindingId/v1":"331433b9cd7b4d05e230745633b029a1de855180260117cabb837a46ad07521e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/builtins/numeric/complex.rs:585-593 | monoruby/src/builtins/time.rs:4434-4446 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"311a62736294f88804c4811a2f979b8eb2b46b06eb0ead8719f6b263c4c42bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): monoruby/src/builtins/string.rs:7303-7320 | monoruby/src/builtins/string.rs:7331-7344 | monoruby/src/builtins/string.rs:7358-7374 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31425179fec68eeb2ec08dc3bd110988e755365f200f95a26876b58e3d3a68d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2691-2705 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2708-2722 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be323a75a99c84f905c8be5364fab0478f747ddd6eb788832c29e8fdc32a130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): monoruby/src/ext.rs:1622-1637 | monoruby/src/ext.rs:1647-1662 | monoruby/src/ext.rs:2029-2037 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"002f2aab6a6f33e35eb995233c8cb51dace9ab3467ac58e65642d192a03ba50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/value.rs:2799-2816 | monoruby/src/value.rs:2824-2836 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2799}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f34a67d31365abe038be4d0fbf89e311fdaef8f23cff3dadd7adbb83bc18d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/value/rvalue.rs:1663-1678 | monoruby/src/value/rvalue.rs:1680-1699 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce14bd3d143b35a05ff3b2f4e6e92cbf1c9d63251a2767dfe81a9d718e43309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/value/rvalue/fiber.rs:60-70 | monoruby/src/value/rvalue/thread.rs:176-186 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67444561826c00da7bc2f121547090598977efcd0990681a0898cbda36af342"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins/module.rs:2768-2774 | monoruby/src/builtins/module.rs:2790-2796 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f74303c298748b4c2cf8dada2524737b793cecc8743774cd79b3c4a18581de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/ext.rs:1800-1815 | monoruby/src/ext.rs:1821-1836 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8988cfee0a5dd12ad7c28da13772ccd14840ca2c8c40ac9de9efdf459c13ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/id_table.rs:788-798 | monoruby/src/id_table.rs:800-810 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/id_table.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e549c64fc4cbf58fee05610c5d6c6434979429eda5930ee24a865cac1ea5f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/value/rvalue/string.rs:7435-7447 | monoruby/src/value/rvalue/string.rs:7455-7467 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":7435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf182f08eba535ce20bded2bf16b8c4bb6aef531eeaf7aa68b41fad6eec1506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): monoruby/src/builtins/hash.rs:939-945 | monoruby/src/builtins/hash.rs:955-961 | monoruby/src/builtins/hash.rs:971-977 | monoruby/src/builtins/hash.rs:987-993 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae19aa1621669565e49a8ba33229f7cb44348a450f4eb65a2c594f97b0aa1b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/hash.rs:1698-1707 | monoruby/src/builtins/hash.rs:1745-1754 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd00912a0f8db31e500ec7325c3f376f97ea2b42f9953f79600662dd1014c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/module.rs:1084-1096 | monoruby/src/builtins/object.rs:602-611 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b6292788ec28acc721dc5f7c9a50b921368ddb4114b9f8b9c559c3cc87c020"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/object_space.rs:678-685 | monoruby/src/builtins/object_space.rs:727-734 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object_space.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e43639f3e5a9a7d1c3dd4608437f4b7503b4e39607f99e595fed8410e7dca88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/time.rs:1700-1710 | monoruby/src/builtins/time.rs:1733-1740 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bee91ff1340bb740e7feb116c1ab619e655deefc61cad3b4d5377cb3b5c170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/src/bytecodegen.rs:1934-1951 | monoruby/src/bytecodegen.rs:1961-1978 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc7415ab1224cf10ae014d5a018212c053738d1d1e115a621fddab34b507eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/executor.rs:3712-3719 | monoruby/src/executor.rs:3728-3735 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72be0c314a45af7fa6869a27e21fb61470a2a5db922ff87969a2482678dc1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/value/coerce.rs:91-103 | monoruby/src/value/coerce.rs:485-504 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e80b1b148f82060d8c5d75d34eac7213c6785687a0212d7c64af186084e762"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): monoruby/src/value/rvalue/rational.rs:331-337 | monoruby/src/value/rvalue/rational.rs:339-345 | monoruby/src/value/rvalue/rational.rs:347-353 | monoruby/src/value/rvalue/rational.rs:355-364 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e52a7541d057025f0892a00fb3dd65bc87685b99cbd6d76e90091b001526f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): monoruby/src/value/rvalue/regexp.rs:2113-2129 | monoruby/src/value/rvalue/regexp.rs:2140-2153 | monoruby/src/value/rvalue/regexp.rs:2356-2369 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0402f2f2971c0d094732f04b48351ffceecf1fce6c9b7f323ba7f01ccc4e7911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby_ext/src/lib.rs:516-527 | monoruby_ext/src/lib.rs:547-557 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby_ext/src/lib.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83ecf59dbaa205543824adea01aca1fb60c0ef9124a2ace807604971f77b8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/argf.rs:493-500 | monoruby/src/builtins/argf.rs:503-514 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9504f4f1bf37a4debf78789e41541bca680f9b7ea7b489abf57bcf7764996a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/builtins/kernel.rs:3377-3385 | monoruby/src/builtins/module.rs:810-818 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d031f38c8f3b81e52d434ba7f7fb72949d5e71af257f29d3f20a5ced7f2cc5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/bytecodegen/expression.rs:2506-2512 | monoruby/src/bytecodegen/expression.rs:2520-2527 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf6c945124b85151ced2710c5d9b7ff619acfb2996116a4f84351b0f247f409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): monoruby/src/executor/op.rs:1415-1434 | monoruby/src/globals/gvar.rs:529-547 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5169e7ec9b726e8b82f0b0d275733fb473473b7cd9c9b80fdb1a1d73dccb797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/value/rvalue/match_data.rs:139-153 | monoruby/src/value/rvalue/match_data.rs:183-198 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/match_data.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4373d931aca6c13d21e6510f6d4d0868a52c05a4afa9dbbf252cb2fd18121b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/builtins/array.rb:212-220 | monoruby/builtins/hash.rb:298-306 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"03485261f6f5ae1c7d432f0fd62e15d97751a59132426dc7cf50d184bb515ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): monoruby/stdlib/open3.rb:18-26 | monoruby/stdlib/open3.rb:31-37 | monoruby/stdlib/open3.rb:42-50 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/open3.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7fdfc00d884a9f6f6e162cd6cd4b203aaa3ec608e47e174e0b96aeaa0dbb79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): ext/nokogiri/src/node.rs:705-712 | ext/nokogiri/src/node.rs:739-746 | ext/nokogiri/src/xpath.rs:199-206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb932b98d1bc50955ecdcd0d3d931f0a5ee1c3088ff12acd6189db382588699"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/builtins/string.rs:4678-4692 | monoruby/src/builtins/string.rs:4694-4708 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4678}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b1fdb3078459130cab3abe564711fa9527be35f11a6f0aa254fcaf92dae8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): monoruby/src/builtins/time.rs:4378-4384 | monoruby/src/builtins/time.rs:4387-4393 | monoruby/src/builtins/time.rs:4396-4402 | monoruby/src/builtins/time.rs:4405-4411 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":4378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b06e1dd3e892c09289a468a32bf841596b95e387b49b157c3ba4508b2f6e861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/globals/error.rs:1309-1319 | monoruby/src/globals/error.rs:1324-1333 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e8e8fb6475544962b09efac0826fa18334ef2a13cb24acb2b74ab643ba9ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): monoruby/src/builtins/arithmetic_sequence.rs:210-221 | monoruby/src/builtins/arithmetic_sequence.rs:233-246 | monoruby/src/builtins/array.rs:403-415 | monoruby/src/builtins/hash.rs:1767-1782 | monoruby/src/builtins/hash.rs:1798-1811 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f3f3c302ccf1bf604152e5652838429a3a9136b69a628b5bb7106eb449495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): monoruby/src/builtins/kernel.rs:6756-6764 | monoruby/src/builtins/kernel.rs:6778-6786 | monoruby/src/builtins/kernel.rs:6804-6812 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":6756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27377e6e5a8eabfe7171fa7fd37340e08ab600ed2954ba41823ee18e96dd3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): monoruby/src/builtins/module.rs:2270-2278 | monoruby/src/builtins/module.rs:2292-2300 | monoruby/src/builtins/module.rs:2314-2327 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbdde20a6b91d591116c2117d66d087205935d3d95167ef902f5ca0f4198675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/builtins/numeric/float.rs:741-751 | monoruby/src/builtins/numeric/float.rs:754-764 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bf7c2d38295cee56ce76ee70628766596d7226dd50ecce952124cff0960c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/symbol.rs:610-617 | monoruby/src/builtins/symbol.rs:626-633 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/symbol.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9068df10024ce4c061f098fc6d9013740a2edbc6ecb4823163a9b7e48709e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): hashbrown/src/raw/mod.rs:1003-1026 | hashbrown/src/raw/mod.rs:1040-1060 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"4339d88dfbd4e556182a254b9600933b73632814e74eace9973ff0e2da46277d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): monoruby/src/ast/source_info.rs:136-151 | monoruby/src/ast/source_info.rs:163-178 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ast/source_info.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac059a3c492fc34875a97da43b52d673a05109e878517e63cf75160ca1983df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/dir.rs:1076-1089 | monoruby/src/builtins/process.rs:1908-1935 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a0d38aa103c942b26800c7e9365e72c1201d5f93884c98b03db669e0b986b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): monoruby/src/builtins/regexp.rs:608-624 | monoruby/src/builtins/regexp.rs:659-677 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"397d2cf4f6c37382b76efc0e17d4b250bf815b3e9a81eb326861f7145e879bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): monoruby/src/codegen/arch/x86_64/compile/mod.rs:1796-1809 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2413-2424 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2438-2449 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2477-2488 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdc032c68239e45c5a48cc87dd716e10008fc565feb2d183ae9780f282ed789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/value/rvalue/regexp.rs:3649-3658 | monoruby/src/value/rvalue/regexp.rs:3671-3680 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43d10973de05727aa58743771ca079fc95377529bd5cfe11417c186891fba82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): monoruby/src/builtins/kernel.rs:3723-3727 | monoruby/src/builtins/kernel.rs:3791-3796 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f617f0429a4c4499aaa4c16a85d76caa28b4e0331ea7467299fe47d6cff797e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/builtins/method.rs:232-240 | monoruby/src/builtins/method.rs:249-257 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a8e3e9e291cba7b49dda47791d503176d0d758ea978dc4b1442049a904ed32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): monoruby/src/builtins/numeric/float.rs:137-147 | monoruby/src/builtins/numeric/integer.rs:949-959 | monoruby/src/builtins/numeric/integer.rs:962-972 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"28334fdf7ce91a4f0666ab9ec41accb4f3f92384ef7f1fdf3cab4a10b24f0992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins/time.rs:4462-4472 | monoruby/src/builtins/time.rs:4477-4483 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":4462}}}],"partialFingerprints":{"codehealthFindingId/v1":"690678dc287e52e2f356ac76e9e89c5b6701ffbc87d4b293a193bcdbaf1de39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:799-817 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:1818-1830 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2935-2947 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f566daea171d86eb19549157fe3ed6c6df2949350a707ccaf8c2e4202555516"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): monoruby/src/globals/method.rs:631-650 | monoruby/src/globals/method.rs:725-743 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/method.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d3f723dc6061fa264cce326fc03638ab348c0526d2649b3bf2803f0a4fd709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby_ext/src/lib.rs:618-632 | monoruby_ext/src/lib.rs:641-656 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby_ext/src/lib.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33e2fcd550d06c0b42753899e2adad6f24548454c5177ae1226933cf61b430e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): monoruby/src/builtins/math.rs:164-173 | monoruby/src/builtins/math.rs:330-339 | monoruby/src/builtins/math.rs:346-355 | monoruby/src/builtins/math.rs:424-434 | monoruby/src/builtins/math.rs:690-699 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2151ed1d803935c5c960a6c51f1d7867003ceb699173019b69bcad00991e0162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/bytecodegen/expression.rs:2111-2119 | monoruby/src/bytecodegen/expression.rs:2125-2138 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4218b813958fbf3788a7328c11d051301dd2ade7900efc6cf543ac20de0b6b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/codegen/jitgen/state/binop.rs:890-898 | monoruby/src/codegen/jitgen/state/binop.rs:905-912 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e6e9cfcbd6306a541cfc37122c446a516634e7d5ca21065023c89e0861ccc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/codegen/runtime/args.rs:124-143 | monoruby/src/globals/store.rs:3633-3645 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4229360dab86821b4e25294fc063a65137ac562ba1c7924a5fda6c29485f4a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/builtins/string.rb:100-107 | monoruby/builtins/string.rb:112-119 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/string.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e68a24fcb983229a1b016a79904cbae22105559a279367d2aff443c8bc046f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/bcrypt/src/lib.rs:26-32 | ext/digest/src/lib.rs:39-46 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/bcrypt/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f1f99e5db405225ed584dfa0568153644aa25c3d00fb5235901918975e8fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/builtins/json.rs:810-823 | monoruby/src/builtins/json.rs:1853-1871 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"c894d8494f1f0027abafe7100db7e871e63f921927ff61a6ee4b1e816c822e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins/time.rs:2595-2605 | monoruby/src/builtins/time.rs:2642-2648 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39f0af1d08672923919ad4cd2ab3a511423d061b3c04d90ed66f436e2455dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/globals/store.rs:2513-2524 | monoruby/src/globals/store.rs:2531-2546 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b36430e4a5f0c6695390d5610b58a5df8c777438da60c8f9932897d49b4c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rubymap/src/map/core.rs:363-380 | rubymap/src/map/core.rs:383-394 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1fcb0bf0db3cf11baea496d13285698b5ae64867ae7faf72fc8b8fcd814b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/nokogiri/src/misc.rs:145-154 | ext/nokogiri/src/misc.rs:260-269 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/misc.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e70dd03daf26766c9595d0ed61556ae1f3bf78351e83e7695a64edb455cd206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/nokogiri/src/reader.rs:392-405 | ext/nokogiri/src/reader.rs:408-419 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/reader.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"513c7d5899413aaf16ac3ce76f41205187d286038f357df263df381f0bddd49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/alloc.rs:2105-2111 | monoruby/src/alloc.rs:2278-2284 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed226eb41bd54ff58aafd7284adceeae70901df1005a790d21eee900cce3be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/builtins/module.rs:2934-2939 | monoruby/src/builtins/module.rs:2953-2958 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c288281361395b6798daf47ff774a2aaf695a52695cabf0c8ab866b0d1c954"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/codegen/jitgen/context.rs:318-328 | monoruby/src/codegen/jitgen/context.rs:474-484 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e6635d71c07304632f334018a05c04061a074140508afc128d2db0cfa52842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/codegen/runtime.rs:3739-3752 | monoruby/src/codegen/runtime.rs:3790-3803 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":3739}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ca7732d96f95b3ec68d1cfaeba8c9c70542cf8570032ba4c26227ebdac8014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): monoruby/src/value/rvalue/complex.rs:107-111 | monoruby/src/value/rvalue/complex.rs:114-118 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/complex.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cadb482d0b9016cb8dc7112a2c07d325e9e63f97c05579175c32c778a6f5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rubymap/src/map/core.rs:853-863 | rubymap/src/map/core.rs:926-936 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"718aa7a75c78cf5e912686164169cbf5304ede6aaa94e2f20db287e298b839cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/builtins/hash.rb:316-326 | monoruby/builtins/hash.rb:330-340 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/hash.rb"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a0aab53b3ffcd9c40ccac341414ee7699053f300c17df094e624af7738ee2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/enumerator.rs:609-623 | monoruby/src/builtins/enumerator.rs:638-645 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/enumerator.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"893f0be9144caf242731fe69e5cb8e2734a1bb80186014ab10e21870e3ccacf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/method.rs:488-495 | monoruby/src/builtins/method.rs:548-555 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d596c3b48a19eaaadca50d49139244ef2d3c683b4362caf77044477d1cc016fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/regexp.rs:226-238 | monoruby/src/value/rvalue/regexp.rs:484-503 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fd617df9a4aaee9869fa57ea299dd67c7c834670b5a73952ea90f516588092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins/symbol.rs:508-514 | monoruby/src/builtins/symbol.rs:530-543 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/symbol.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac3edbed5955279cf59da425cc3812c99d16b0a9282967155af67d1b3f4b583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/nokogiri/src/node.rs:961-971 | ext/nokogiri/src/node.rs:974-984 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4868abd5e1a773f3bb0d70fefa13408b96db87c84df69a014ab8c60164a8774"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/array.rs:976-983 | monoruby/src/builtins/array.rs:992-999 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd49fc8df664b0ed5f9e3399c976097df81a2767d2380a2620d3f81d20cc9ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins/fiddle.rs:962-972 | monoruby/src/builtins/kernel.rs:4923-4929 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiddle.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2454683ddf19bfdeb9e11923179bfffc0db124f97a6de4102a76683476524e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins/file.rs:2124-2130 | monoruby/src/builtins/file.rs:2141-2147 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea57a6d76cdf181d84fe9f70a71564684a4b26850e7edd5cf1e4f522c68a70d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): monoruby/src/builtins/symbol.rs:317-323 | monoruby/src/builtins/symbol.rs:335-348 | monoruby/src/builtins/symbol.rs:362-368 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/symbol.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ab6680bed1785abd7898d88e0289dd70342920f4bab74459c573dcb8efe66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/time.rs:1688-1695 | monoruby/src/builtins/time.rs:1743-1750 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aefd7202230c4a163ee1ab3520564793a988e950a7155e96fe0be5f46ff70a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/value/coerce.rs:16-24 | monoruby/src/value/coerce.rs:37-45 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b97eeaece3139bb867edfe124cd3dfa88942c65fb6755b2e14ad569a0122f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/value/rvalue.rs:1584-1594 | monoruby/src/value/rvalue.rs:1602-1609 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ad3bfe7d1e343ddf7685c39fded6a748eeda00cd0b36eb10e3bc91167a3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/value/rvalue/string/transcode.rs:4165-4178 | monoruby/src/value/rvalue/string/transcode.rs:4181-4192 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcd288a549caf4a2c9a7bf620e1c78e941ad85961fb5c9a7ccf6d8f8e4ad603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): monoruby/src/value/rvalue/string/transcode.rs:4558-4572 | monoruby/src/value/rvalue/string/transcode.rs:4579-4594 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4558}}}],"partialFingerprints":{"codehealthFindingId/v1":"35acd3edfaf6962e2b31fd682f70eb4f17654c87214244e6a12ebb1a6dc0f360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): monoruby/stdlib/socket.rb:186-203 | monoruby/stdlib/socket.rb:208-226 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/socket.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee654bbc447e9d09bafa47f68500bf4ceb85dc3807c66ef077b6425ed74ced9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hashbrown/src/map.rs:3586-3597 | hashbrown/src/map.rs:3893-3904 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3821cd1a1eccac1f39e07393ad03122d7e06a828c66a4e2db60c4bd08fb2bbf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/enumerator.rs:351-366 | monoruby/src/builtins/object.rs:576-588 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/enumerator.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c9873df637dafdc770a1815158ff15e13ab4c83993937029867864793d8504"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/process.rs:589-601 | monoruby/src/builtins/process.rs:654-665 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01e4ab71f06d3b67a6635f2bcbf4272cc0636c1915541804cbb5a76be314df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/value/rvalue/string/transcode.rs:4844-4856 | monoruby/src/value/rvalue/string/transcode.rs:4862-4874 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14fdb8780710d1f20e80971249d6ec668eb8fb522767b56d6f0663cf123ce42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): ext/psych/src/lib.rs:395-404 | ext/zstd/src/lib.rs:504-515 | ext/zstd/src/lib.rs:606-617 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/psych/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5fcd4da8b0f5ab0a6fc636ef08497043171d05f4cecbe4fa727685742be41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/builtins/file.rs:835-844 | monoruby/src/builtins/file.rs:857-865 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff61f1e212ca361dfe5b16f117b0c298970c4c6c3bf427d443b7d39e11113e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/builtins/range.rs:672-677 | monoruby/src/builtins/range.rs:686-691 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6cd2073820a27ca22de0c22de9901d116058c88a1a0d541780ce6bab6d3c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/codegen.rs:635-642 | monoruby/src/codegen.rs:663-671 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba0d7b6264dee63e30e2485ec97fef20c0238d224d5dfc1ba258a4800890e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/codegen/jitgen/gp_alloc.rs:529-540 | monoruby/src/codegen/jitgen/gp_alloc.rs:543-554 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/gp_alloc.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c711e16a513d4d14b224e1dcb9be73b5180f6351602b73c8206b01b70e8608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): monoruby/src/globals/store/class.rs:1639-1651 | monoruby/src/globals/store/class.rs:1658-1670 | monoruby/src/globals/store/class.rs:1963-1975 | monoruby/src/globals/store/class.rs:2058-2073 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff26bec782f57981cc1e8822ecb3bbd753598907844a2a2782bb69b111255b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): monoruby/src/globals/store/class.rs:2716-2725 | monoruby/src/globals/store/class.rs:2747-2757 | monoruby/src/globals/store/class.rs:2769-2779 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6d622d68dbcb92cad77d78f8486b6a504bfd39e01948c7bf48e8300e2d8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/value.rs:340-348 | monoruby/src/value.rs:456-465 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65315a7f5f9aa3fbf4f7cb2f29c712ffb17f322eff20c44d27683837242481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/nokogiri/src/dtd.rs:301-310 | ext/nokogiri/src/dtd.rs:404-413 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"57df2d9b6c2bc5bb0b9861c077341d160c79aa7518237c0a2c82a5855bae6502"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/nokogiri/src/lib.rs:583-589 | ext/nokogiri/src/lib.rs:791-797 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cbe2e16b3b8f2a2b95e85b09feb5da0244807eda93666acf04673f7d98e502"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): hashbrown/src/table.rs:298-313 | hashbrown/src/table.rs:336-349 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2125696caf9279608060b16740f76fd3a5bc486b6f1e9bb6d02c706a4eb7b002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/encoding.rs:1801-1813 | monoruby/src/builtins/io.rs:611-622 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a832cb712ba53903efe237f2594899ba971abaf5528c87cd2442065f376da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/hash.rs:3218-3227 | monoruby/src/builtins/hash.rs:3940-3949 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3218}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd6c92bee8d4bf0cdde70be93c5edc3e39e91144721052e8d5691d70eb91b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): monoruby/src/builtins/method.rs:564-571 | monoruby/src/builtins/method.rs:715-722 | monoruby/src/builtins/method.rs:829-836 | monoruby/src/builtins/method.rs:850-857 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e889d428c4b8426a20f8b89f920fb177a1fd2b4c7fca435f729966519e1d25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): monoruby/src/bytecodegen.rs:1060-1069 | monoruby/src/bytecodegen.rs:1078-1091 | monoruby/src/bytecodegen.rs:1093-1101 | monoruby/src/bytecodegen.rs:1103-1111 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfa66f00d865dc633a1bfdae22fdd04a9e2cf786522a79e469c2d82850723f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): monoruby/src/bytecodegen.rs:1837-1850 | monoruby/src/bytecodegen.rs:1863-1877 | monoruby/src/bytecodegen.rs:1885-1894 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52678bc5b27e4602d058f9b36c28fe0e2630cba88fc0f21ccdebcd11e4a9eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/ext.rs:1982-1992 | monoruby/src/ext.rs:2458-2467 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9279066d1516237a992c86ecaf7984f0165805f7f3fb3d6fef8f0382cc6f8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/value/rvalue/fiber.rs:493-498 | monoruby/src/value/rvalue/fiber.rs:511-516 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba7c35dcc1e8408aa6d46b76dc200cf995be5899f13e63eb05e991fe9713271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/value/rvalue/match_data.rs:121-132 | monoruby/src/value/rvalue/match_data.rs:157-169 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/match_data.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67c72690496d388d1be0ee11ad067a9ca1d9e70af4356d0d93dd999690906b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/gem/markly/markly.rb:337-349 | monoruby/gem/markly/markly.rb:353-365 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/markly/markly.rb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45ec42a55b0621339f9a73516ac446da9ba8d4fadba43a6121b57baaa5dd78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/zstd/src/lib.rs:130-136 | ext/zstd/src/lib.rs:138-144 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/zstd/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"446948b19bfe05d740d12bb06cef0de8db4a86fb2996c8bad7c958a4b3503256"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/hash.rs:576-589 | monoruby/src/builtins/hash.rs:602-611 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae42e0558079ee46edb2865f2298a52c1de6902ad3a65241a05cd005c0bbbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/kernel.rs:2012-2021 | monoruby/src/builtins/numeric/float.rs:331-340 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"712242ad9d943ad35d7fee983ac7905b9a6427f13fac56c4619d88e0db8c5b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/module.rs:3060-3071 | monoruby/src/globals/store/class/constants.rs:266-277 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"49222e1f74d80a2f7f8d8e24e0fbe97f658c9ed22de5590567ee405d3be9b0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): monoruby/src/codegen/arch/x86_64/compile/variables.rs:445-455 | monoruby/src/codegen/arch/x86_64/compile/variables.rs:457-467 | monoruby/src/codegen/arch/x86_64/compile/variables.rs:469-480 | monoruby/src/codegen/arch/x86_64/compile/variables.rs:482-492 | monoruby/src/codegen/arch/x86_64/compile/variables.rs:494-505 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/variables.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d835c3ecff12c824c4fb7a4f5570cb1692d4b71e18a7c8c08907931bcc70bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/codegen/jitgen/state/slot.rs:2128-2140 | monoruby/src/codegen/jitgen/state/slot.rs:2142-2150 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"772eb00e2e52ac9e19911b3ceb5bc745f456ac4171ce4432b81fa561f6bb2d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/stdlib/strscan.rb:457-466 | monoruby/stdlib/strscan.rb:474-483 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/stdlib/strscan.rb"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4caec5078c7d96ad5732f752e39549fbdccc9f71a536af8f39b3b12daea6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/builtins/marshal.rs:378-392 | monoruby/src/builtins/marshal.rs:1364-1376 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"0896ede2dd58566ce293141f1d180a3c82a06d272cb597b18d0265535aec1bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): monoruby/src/builtins/module.rs:353-360 | monoruby/src/builtins/module.rs:3685-3694 | monoruby/src/builtins/module.rs:3709-3720 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d73994db6f9a6f267efd7a0f5c2984017e0829859c93c9318f35c4b3507c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/process.rs:2009-2018 | monoruby/src/builtins/process.rs:2030-2039 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"b096eae29020f4154e697333705c4252c73bd3034d16d8feffcf3319827ce8e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/codegen/arch/x86_64/compile/mod.rs:2854-2865 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2875-2887 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c21c0487bf225da443ac1fe969806abe9bc9b11e3e90415c6bb71267cc98e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): monoruby/src/codegen/jitgen/context.rs:4198-4207 | monoruby/src/codegen/jitgen/context.rs:4217-4226 | monoruby/src/codegen/jitgen/context.rs:4236-4245 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":4198}}}],"partialFingerprints":{"codehealthFindingId/v1":"487775e1b798c61f34ec7b11f3d8b02f72156da4e1dbce322bf9038b94afc4a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/io_buffer.rs:1776-1784 | monoruby/src/builtins/io_buffer.rs:1792-1799 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21aeec5611090b6be34c4b1687e983b697a48e384f37276c57774a07a453755"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/value/coerce.rs:112-120 | monoruby/src/value/coerce.rs:143-156 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a991e1c2dbb73292f595c9d5cd5069e904c3be678fe0de350edec4cec46ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): monoruby/builtins/enumerable.rb:282-300 | monoruby/builtins/enumerable.rb:304-322 | monoruby/builtins/enumerable.rb:732-744 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b6c4a0d1d19cfc91e45c30886400d9c4e1abc2955650d9f1878d9d37a920a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/codegen/arch/x86_64/compile/mod.rs:2236-2249 | monoruby/src/codegen/arch/x86_64/compile/variables.rs:432-441 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6671f09508aa8e7f34fdb823c2a0e7e2dfc04675a8ece72f0857be9740d8ee0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): monoruby/src/codegen/runtime.rs:2298-2307 | monoruby/src/codegen/runtime/args.rs:1671-1680 | monoruby/src/codegen/runtime/args.rs:1689-1698 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e551df8fe7eef71ee685ca8a46e8125db09d12c9a33f70597f4d375ef17ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/scheduler/native.rs:162-168 | monoruby/src/scheduler/native.rs:170-176 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4f22b425b14191b6bf993cd868ee0524ad8dc1593c1c78fd69dac2d3fe950e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/sqlite3/src/lib.rs:733-740 | ext/sqlite3/src/lib.rs:813-820 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd997a6a7ce84bbd958dc80345770f7b549365dd2e581e0b293f5a041bac75c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/ext.rs:2472-2483 | monoruby/src/ext.rs:2715-2726 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b96a12afacb1f7ad123b6f08aa66700a36084f9f702834fdd67819998abcbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): monoruby/src/builtins/numeric/integer.rs:297-304 | monoruby/src/builtins/numeric/integer.rs:1377-1384 | monoruby/src/builtins/numeric/integer.rs:1393-1400 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd99a9c9d92f4c4b16a7bf70c0f54d205e9bb710d81ffa784eedc710970ccec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/value/rvalue/string.rs:3675-3689 | monoruby/src/value/rvalue/string.rs:3819-3827 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8237d155f39b8c37ff58f03072b98068bc47bf9e75c0811b7bfee00b6f2bbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/builtins/argf.rs:126-134 | monoruby/src/builtins/array.rs:276-281 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbecaa5bab4e3f1baaa48ac072f579d6401d1750876d18d5d54791333de1f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): monoruby/src/builtins/numeric/rational.rs:545-552 | monoruby/src/builtins/kernel.rs:6404-6413 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/rational.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c16da96d4b7bb42f0d0c8bad94bbbf82b90d7cfe4e9505023a4e79e81bd2143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/alloc.rs:1042-1048 | monoruby/src/executor.rs:6657-6660 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece01510bc6b827b5692cd6ad3d85541fedc3d542684ac155ce29d4c7e4ae2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/nokogiri/src/node.rs:671-681 | ext/nokogiri/src/node.rs:729-736 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d59417f667d2f403413a6c81ec6e1f02875c2dc8f3ab1e2d57a6430bc77887f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): monoruby/src/ext.rs:1167-1182 | monoruby/src/ext.rs:2187-2200 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32201df6167c7a33666d5daad769756622bbd11c33f7529b4b150a2241bf608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): monoruby/src/codegen/jitgen/context.rs:2414-2426 | monoruby/src/codegen/jitgen/context.rs:2428-2440 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c060cec872fd8333392a696bcdb21d60ddbde10b30c1cf4905bb16167658c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/codegen/jitgen/context.rs:2251-2262 | monoruby/src/codegen/jitgen/context.rs:2944-2955 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07fce03f3c0b6dcc1041d7043a86de134ff65b08e0ce7af60ed955aa6dc85e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): monoruby/src/ext.rs:258-271 | monoruby/src/ext.rs:281-291 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188af9f95b5ab535675ff6ef33a6e058a6f39742401a7f354616f62e2ea726f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/kernel.rs:2025-2034 | monoruby/src/builtins/string.rs:5181-5190 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafcf6319c85ddb5097fde7b82cac6a68abde925a4b134f4340f79713ae3753d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/builtins/main_object.rs:140-143 | monoruby/src/builtins/module.rs:3280-3284 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/main_object.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b46bf6c0c53483b32dc9251bc38427b24051bd3f8899df9bb914670fd03ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): monoruby/src/builtins/regexp.rs:1469-1480 | monoruby/src/value/rvalue/match_data.rs:274-286 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce6459d9bbec46d326cb286a0503ec18a1e789f341675cb2ab521bc745c901e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): hashbrown/src/map.rs:3069-3077 | rubymap/src/map/core/entry.rs:98-106 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a33609646bd5b8d646faba7dca22d0c8cac10f2784652637f2fbe4f8e9d57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/gem/nokogiri/xml/builder.rb:366-373 | monoruby/gem/nokogiri/xml/document_fragment.rb:139-144 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/builder.rb"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0cfaad9275c630af466f27ed8a52cbf11306bc094a47c24df49c58975a57c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/alloc.rs:968-971 | monoruby/src/preempt.rs:74-77 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c65e37ffc78f425370e4e242a3a3c40bb482b12347c3b7618f811e01426cec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/alloc.rs:977-980 | monoruby/src/preempt.rs:79-82 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c1812cd3ba3f07c9a65389c2de62472fc382a4006bcbddb2e312c58de04640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): monoruby/src/ancestry.rs:39-48 | monoruby/src/builtins/marshal.rs:1779-1788 | monoruby/src/globals/store/class.rs:1391-1400 | monoruby/src/value.rs:1051-1060 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ancestry.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9637f595ac8b5f64049de5552986be3bf9b1be9f4a13356f4da21d49929495fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): monoruby/src/builtins.rs:98-104 | monoruby/src/value/rvalue/string/pack.rs:1635-1642 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"611562f36f395bc93769ebb0e824ce9a128b9ef666dffeb44fece27a65247cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): monoruby/src/builtins/file.rs:1759-1768 | monoruby/src/value/coerce.rs:613-623 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"52abe1a3459d8e610e1cc3bc2fe18d45b27167c938a9b279194811257ed52453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/builtins/io.rs:3613-3620 | monoruby/src/builtins/io_buffer.rs:1276-1281 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2fda7b69866f9400b5e4cec7457f54ab4e84484349a28963c82b38ad7411d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/executor.rs:5841-5847 | monoruby/src/value/rvalue/weakmap.rs:85-90 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":5841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b370f8bba359b98b14cc2146b5a02788d4c633379883c3968fcfd3d43251903f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rubymap/src/map.rs:1202-1206 | rubymap/src/set.rs:744-748 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b073e539d3637e0ce209e616e7244a2bfcd987c15ca1dd6715565f4e09f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rubymap/src/map.rs:1246-1250 | rubymap/src/set.rs:775-779 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a641540764a29e88f7fd8ea1f63ecb3bd1c431a8bf6a34f7758dd74e21a53ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hashbrown/src/map.rs:1135-1141 | rubymap/src/map.rs:961-966 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e501c217bdd74de3e921e5c649e525c43f7d0cb7f18f3dad9929199dbffd29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hashbrown/src/map.rs:1188-1194 | rubymap/src/map.rs:1094-1099 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec8e4ac225abd960f4a7d9cc15bd700ae7463c1130b01bdc60250fb466cdc0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): monoruby/src/native_pool.rs:119-125 | monoruby/src/scheduler/native.rs:135-139 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/native_pool.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a1a92514e0f7eb87b7615ad6e2fc0b6625f28140a4cd4c5127cfa0527933cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/value/rvalue/complex.rs:26-29 | monoruby/src/value/rvalue/range.rs:30-33 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/complex.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d623246e210434b018d95bf2ab836e80d66e9f22af65c59b7b5bdb3fa341693"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): monoruby/src/builtins/encoding.rs:5352-5356 | monoruby/src/builtins/io.rs:6060-6066 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":5352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d6ed8ddc01ff5e531b8ff4134e159048449576cbb8306708b251af0197fdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): monoruby/src/builtins/hash.rs:1901-1910 | monoruby/src/codegen/runtime.rs:2949-2957 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"f846ab226c8e2a0a0ce35083fc0b1111905496a3080d237b1cb5d021977b7b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): monoruby/src/builtins/object_space.rs:743-748 | monoruby/src/builtins/string.rs:11558-11562 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object_space.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd920d8b26a4ecb1a36ddb756b009c1f1e0db67145a565f7208cac7f6b27aa07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rubymap/src/map/iter.rs:479-482 | rubymap/src/set/iter.rs:116-119 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e42f2132ad7419fde57cdf33e59e3477471e54d18c49f494025b5386be6bc16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rubymap/src/map/iter.rs:143-146 | rubymap/src/set/iter.rs:168-171 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e57e772f44fafe9d96c4f9c27c2fa2ca557a19f0070b05af5bbf798aa12c0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/builtins/numeric/float.rs:576-579 | monoruby/src/builtins/numeric/integer.rs:501-504 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98069d295b63c54713d60fd45dea3365c80d0871565335225f4b75670cf6c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/builtins/numeric/float.rs:588-591 | monoruby/src/builtins/numeric/integer.rs:654-657 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0871e4de9f4812da4325cc2fdf12a43b29b5f996237620fd85d77144a3abbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/builtins/numeric/float.rs:600-603 | monoruby/src/builtins/numeric/integer.rs:741-744 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec3cd0c6eba0cf95f5021b4d414c405be60dd9bfb7bc5ce0aa9f77421b3604e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/builtins/numeric/float.rs:612-615 | monoruby/src/builtins/numeric/integer.rs:856-859 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"186755d3e78009c16385a8f9c1b8601b6570d3ae71a0abf113371c1d188c71b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): hashbrown/src/control/group/generic.rs:91-94 | hashbrown/src/control/group/neon.rs:62-65 | hashbrown/src/control/group/sse2.rs:68-71 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/control/group/generic.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"55401ae1dc583db0e1b8e5e7abcbce86eebeaabcd71d7c1bd8db798c01c6cdbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/src/codegen/jitgen/state/liveness.rs:47-52 | monoruby/src/codegen/jitgen/state/slot.rs:1608-1614 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/liveness.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ca9612d80d68f4165bf66e264bfb799e89c4032dd5978aa9585690d7dcd6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): hashbrown/src/control/group/generic.rs:82-85 | hashbrown/src/control/group/lsx.rs:57-60 | hashbrown/src/control/group/neon.rs:53-56 | hashbrown/src/control/group/sse2.rs:59-62 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/control/group/generic.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3080e686335d447c3853401bbaaad4fb24f8b06670fddaf85c6b259599a809ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rubymap/src/map/slice.rs:92-95 | rubymap/src/set/slice.rs:70-73 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/slice.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaab01ff1be40b31332f08671a870534e84a3658811af665364d4f9a751aa821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rubymap/src/map/slice.rs:129-132 | rubymap/src/set/slice.rs:89-92 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/slice.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9601e396beac17e680e3f2c8f8a49b71b5653e6106284f95f923cd3a6745fc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hashbrown/src/map.rs:275-280 | monoruby/src/value/rvalue/hash.rs:220-225 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0b396ad4cef7e296abb748779784418f3777ba8c0d7be74103a69db4d4c843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rubymap/src/map.rs:1264-1268 | rubymap/src/set.rs:793-797 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03365f8900d170b85b538b107c2ac7deacc3f1a860138d1986ee758ac197b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): monoruby/gem/json/add/ostruct.rb:34-39 | monoruby/gem/json/add/struct.rb:31-36 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/json/add/ostruct.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fe217033b4f902d4922b00d4d3a1400bb4133d216557d936ffd2a90af8fafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): ext/nokogiri/src/dtd.rs:267-271 | ext/nokogiri/src/node_set.rs:205-209 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9883cf2e6a1ad4f57b9603bbc608014bad7e9d73744fee5579d2a16a1ed0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): ext/nokogiri/src/node.rs:586-590 | ext/nokogiri/src/reader.rs:477-483 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"515a1a84e0987d8ee536e201ae9530498230520e111e63c28c462a212fa5d3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hashbrown/src/raw/mod.rs:1117-1123 | hashbrown/src/table.rs:1725-1731 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"15665e81e5ba39b7ba6076c9ab95c5e3dc97cb49b2a7cecd30ab94079f904b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hashbrown/src/raw/mod.rs:1133-1139 | hashbrown/src/table.rs:1797-1803 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"684bba93d589dc351d2225644ea924e98f2fbbeeebe0a671d56ad286f8ee682c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): monoruby/src/builtins/hash.rs:2652-2657 | monoruby/src/builtins/set.rs:94-97 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"438c351d5b065ffd56ed22492c05d9f86e92047a732437e0ab0fa0648a5ac881"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): monoruby/src/builtins/kernel.rs:6422-6424 | monoruby/src/builtins/object.rs:396-398 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":6422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cccfb9d37b8411b0e22da02e31b6a7eba7c8c9d6e67ca844eb15cb6603f9924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): ext/nokogiri/src/dtd.rs:313-317 | ext/nokogiri/src/node.rs:419-423 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"830bb0be16db6f3fb64bac86f2b320391b9b96890ef4070aeb431e5548f29956"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): ext/nokogiri/src/dtd.rs:377-381 | ext/nokogiri/src/misc.rs:157-161 | ext/nokogiri/src/node.rs:538-542 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e8b6860d33b4b2ac0cefee058da064bd420719bd5df2c1674c943cf45e9197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (117 lines \u00D7 2): monoruby/src/value/rvalue.rs:1868-1984 | monoruby/src/value/rvalue.rs:1991-2107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue.rs:1868\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3e32e0e633650eff4b83efc90e7bc71ccc92be451cc05f92567473e9abb35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201342 lines \u00D7 2): monoruby/src/builtins/kernel.rs:5918-5943 | monoruby/src/builtins/module.rs:2022-2063 \u2014 before extracting anything, compare \u0060monoruby/src/builtins/kernel.rs\u0060 and \u0060monoruby/src/builtins/module.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:5918\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd5af7592d38e4431ca23bd3ba1a0d3bc87631016d465fc5ca3a8526aff61e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201336 lines \u00D7 2): monoruby/src/codegen/jitgen.rs:2581-2607 | monoruby/src/codegen/jitgen.rs:2688-2723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen.rs:2581\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b3373bd6fc1d60a45bdc84f455a47e9cd8f29e9d75f3115dde4cf4995a009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201333 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:705-737 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:889-911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/frameless_call.rs:705\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"411bf5344bc431bde6db86e71f6009ed94d2720acbcd419861f9a6003e32c16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): monoruby/src/builtins/struct_class.rs:670-701 | monoruby/src/builtins/struct_class.rs:735-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/struct_class.rs:670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12f94b1b929519a6088e3e160af1e552d0bbf106cdcb87f2b414b2170e53e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): monoruby/src/builtins/string.rs:9214-9244 | monoruby/src/builtins/string.rs:9252-9282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:9214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":9214}}}],"partialFingerprints":{"codehealthFindingId/v1":"285184ee45cef5638f8b112b793f8c12d23eed914749d2623e6f554e88591646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): monoruby/src/builtins/string.rs:6052-6079 | monoruby/src/builtins/string.rs:6323-6346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:6052\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6052}}}],"partialFingerprints":{"codehealthFindingId/v1":"433819f6a36e089a5c130ba6d409f7099a667556e7c25166b6922da465069f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): monoruby/src/bytecodegen.rs:1147-1172 | monoruby/src/bytecodegen.rs:1542-1569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen.rs:1147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c72a202b59ec0353dc6e63d4232dd3cb3b4cbbd25765862375011557235050b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:4853-4874 | monoruby/src/parser/prism_backend.rs:4934-4960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4853}}}],"partialFingerprints":{"codehealthFindingId/v1":"707c0a41f655fbbdbbe6ff82db35412d835a2318a796b4f8749adeac2c33dce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): hashbrown/src/raw/mod.rs:1509-1533 | hashbrown/src/raw/mod.rs:1719-1744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hashbrown/src/raw/mod.rs:1509\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b15f0fb254a5476e12e0852cbef5e524f430ce4e5fbfe3c31dfec577f32014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): monoruby/src/builtins/encoding.rs:462-485 | monoruby/src/builtins/encoding.rs:487-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/encoding.rs:487\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/encoding.rs:486\u0060 calls \u0060define_builtin_func\u0060, \u0060id\u0060 and \u0060monoruby/src/builtins/encoding.rs:512\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2674b7646f49eecc8ecec2331354969c79dd9132c71e620d781920db314661d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): monoruby/src/builtins/string.rs:2329-2354 | monoruby/src/builtins/string.rs:2372-2394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:2329\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"01886e567a575002fde94c5396a6f82f26ca2f2b6baf7660697e0f227d42bc95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201326 lines \u00D7 2): monoruby/src/bytecodegen/expression.rs:1141-1153 | monoruby/src/bytecodegen/expression.rs:1154-1179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/expression.rs:1141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367205a4e0e79fc5e7e79bbb7f7b5c6b2d2f52f016d23202252dda32202b871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201326 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:2493-2518 | monoruby/src/parser/prism_backend.rs:2528-2547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:2493\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026WhileNode\u003C\u0027pr\u003E\u0060 in one and \u0060\u0026UntilNode\u003C\u0027pr\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"216bbef0a3ff585560f2e5b834ca1c3470346fab4f29b4268e7ea549f6d6b8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201325 lines \u00D7 3): monoruby/src/builtins/kernel.rs:4782-4796 | monoruby/src/builtins/kernel.rs:4801-4820 | monoruby/src/builtins/kernel.rs:4825-4849 \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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f949f5a974edb7888111b5e3d3f99e9a51e80ef8f3a00d5b6e53dbbd50322c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/mod.rs:639-662 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:759-782 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2550-2573 \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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4af208a3dec92f8135ab5e664e6b587f425c6bcb44f1a1acdf024b22d5aff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): monoruby/src/builtins/hash.rs:761-784 | monoruby/src/builtins/hash.rs:812-832 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/hash.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c8163b527366ae457039594c291047ac303061870550b2d6b50f2311087e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): monoruby/src/builtins/io.rs:1675-1699 | monoruby/src/builtins/io.rs:2939-2963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"858210a1ff652501b8bfdcfa14b089e3b043b264b83ff667123adc06646022d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/codegen.rs:130-153 | monoruby/src/codegen/arch/aarch64/codegen.rs:185-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/codegen.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/codegen.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50a59dd7a37ae4c6dd1b30c26c835344e2d00e26365f1ba55850d5a6fe3f963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:931-954 | monoruby/src/value/rvalue/string.rs:1130-1153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e5f761288f5982a7c30a39c8e9d521e4905c7b8084cefb34ef735798a99e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): monoruby/src/builtins/string.rs:8033-8055 | monoruby/src/builtins/string.rs:8112-8133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:8033\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8033}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea717746dad65d23d55d747cf93ef973ecb1af5888db59e5110404535cb4df1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:711-730 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:837-859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:711\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1036e409932966303e34f618bdc63376e6bccbdeaa13e8fc8756f989c142ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:487-509 | monoruby/src/codegen/jitgen/asmir.rs:4573-4593 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:487\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"308fa5aeaa3f629d772bd9ae7446926023d2a2ce54096e7a8a7cb6e9b90bc155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): monoruby/src/executor/format.rs:1097-1119 | monoruby/src/executor/format.rs:1200-1222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/format.rs:1097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"216e7b7973b0ba3020e52fc35d7a48b820a8054a8c472a9f33a0b25770faf646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:884-906 | monoruby/src/value/rvalue/string.rs:1067-1087 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:884\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4d7d9869c9db2e3214cf6b4ce8429a6ab7def8a9888cd1a8a72c07d7b1507e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:5747-5769 | monoruby/src/value/rvalue/string.rs:6155-6176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:5747\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5747}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf227899a6790db29bcf6f99693c1467ea12333566ae8ff992b3ca1d6a10281f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): monoruby/src/builtins/array.rs:897-918 | monoruby/src/builtins/array.rs:922-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d5d21e16234c6395b2df39ac010e1c7571406c99951b663286e9676e1cad60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): monoruby/src/builtins/module.rs:1022-1043 | monoruby/src/builtins/object.rs:649-669 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060globals\u0060 to \u0060\u0026Globals\u0060 in one and \u0060\u0026mut Globals\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d6855b940e50c9dfd0c9a09c39e59dbdde32ad066e028d5f850c966c6bc1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/codegen.rs:108-129 | monoruby/src/codegen/arch/aarch64/codegen.rs:161-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/codegen.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/codegen.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3e2159b5324a1c331aaad6b2c6957def0fa7a1fbd187205c5929b9967cd39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/escape.rs:1469-1490 | monoruby/src/codegen/jitgen/compile/escape.rs:1774-1795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/escape.rs:1469\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abe036e3ffa597cd5900ba7fb538053439573f8fb920905ddb34d238b15cab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:4876-4897 | monoruby/src/parser/prism_backend.rs:4980-5001 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:4876\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026LambdaNode\u003C\u0027pr\u003E\u0060 in one and \u0060\u0026BlockNode\u003C\u0027pr\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4876}}}],"partialFingerprints":{"codehealthFindingId/v1":"9409755924bde176f3a8e8434137711c869712586685740cad65eae63c554495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:7216-7234 | monoruby/src/value/rvalue/string/transcode.rs:7354-7375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:7216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":7216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc81bbf5eb38357c50b346f9ac78625260dae2d77aa23ae952d1a72567257461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): monoruby/src/builtins/kernel.rs:2141-2161 | monoruby/src/builtins/kernel.rs:2258-2277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb0c77d4e7b6f6e70047562c435f51abbd89a80fc31433021baf273e7a9a0ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): monoruby/src/builtins/numeric/complex.rs:862-881 | monoruby/src/builtins/numeric/complex.rs:884-904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/complex.rs:884\u0060 it begins part-way through the construct above it, so those exact 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":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"7071bb434ba4ea5260d00c72013dd550fdc722f66bdf5a8ebb2f73b4a63c8127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): monoruby/src/builtins/numeric/float.rs:833-852 | monoruby/src/builtins/numeric/float.rs:870-889 | monoruby/src/builtins/numeric/float.rs:907-926 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/float.rs:833\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f5c10f7dbafd0813d187c57c4e4fdf2ee0a00be5243abfa722c210c7bb7940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): monoruby/src/builtins/array.rs:877-895 | monoruby/src/builtins/array.rs:947-966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:947\u0060 it begins part-way through the construct above it, so those exact 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":"monoruby/src/builtins/array.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a5db05ff295d066540b13ec7833d5f8b446f4c201949827f26efd94348c061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): monoruby/src/builtins/string.rs:4045-4063 | monoruby/src/builtins/string.rs:4079-4098 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:4079\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4045}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2c3ce19079eaa1b5974fb7e1f735997ed1537e60e9436b4b51db591c6c55f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1401-1420 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:1434-1447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:1401\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a796da0e173f5758cddda183d43b7db92c2c1c2a8e5a35c23e08a22fa878a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:7243-7262 | monoruby/src/value/rvalue/string/transcode.rs:7384-7403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:7243\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":7243}}}],"partialFingerprints":{"codehealthFindingId/v1":"53542680fd83c4c5c6cc3485c085fab503426d117f11cb5110faf2c5dc51311a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): monoruby/src/executor/format.rs:1001-1019 | monoruby/src/executor/format.rs:1106-1124 | monoruby/src/executor/format.rs:1209-1227 \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":"monoruby/src/executor/format.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8ac9a8c85dbf568aa13e972660aea81bbbb8d0be6be8a1dcdfa99b340ecc7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:1678-1695 | monoruby/src/parser/prism_backend.rs:1746-1763 | monoruby/src/parser/prism_backend.rs:5333-5353 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/parser/prism_backend.rs:1696\u0060 calls \u0060default\u0060 and \u0060monoruby/src/parser/prism_backend.rs:1764\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":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"3618c0c1d25e824e2d3dd3fa43e8af44ee69d2470861d2216bd997b3fbfe2ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): monoruby/src/value/rvalue/thread.rs:238-256 | monoruby/src/value/rvalue/thread.rs:279-297 | monoruby/src/value/rvalue/thread.rs:312-330 \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":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3564137df710c73684147faaed76c0339d8c1c5f464cbe26e3b286c58e57df86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): ext/nokogiri/src/document.rs:137-155 | ext/nokogiri/src/document.rs:253-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/document.rs:137\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7b1f4036771129f6e756a8b70e4f6ed225a7c6ae87d69bbc9256a7895e8469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201319 lines \u00D7 2): monoruby/src/builtins/kernel.rs:1362-1371 | monoruby/src/builtins/kernel.rs:1618-1636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:1362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6a199522c5551d59a658db7e6f9760f7b4ea12f34ab0150681aa148c784348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201350 lines \u00D7 2): monoruby/src/builtins/time.rs:1336-1378 | monoruby/src/builtins/time.rs:2685-2734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc61688d69ad64c35302250d363ee66de2812919a02f7814b50010bcf1657d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): monoruby/src/bytecodegen/encode.rs:408-426 | monoruby/src/bytecodegen/encode.rs:433-446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/encode.rs:408\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":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"581a67656305807aec7d4c265a6ff9d4474126dfac7898bf20a282f9180a4c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:919-937 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1255-1273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b37c64b08cdd6f2d082e77aff349782d6f9a8d6adf4cc4664bcaa157e94ef60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): monoruby/src/codegen/jitgen/trace_ir.rs:642-660 | monoruby/src/codegen/jitgen/trace_ir.rs:679-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/trace_ir.rs:642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9b08360a372bf6c774ae21f313e9b02a915d8f5fcd0cc028b57046d4f07cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): monoruby/src/executor/format.rs:1050-1068 | monoruby/src/executor/format.rs:1137-1155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/format.rs:1050\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"657999c0d0159c0ec596b8b6f1eaaeadf2eb5e246212197bd3335b5f096bc97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): monoruby/src/scheduler.rs:996-1014 | monoruby/src/scheduler/native.rs:755-773 \u2014 before extracting anything, compare \u0060monoruby/src/scheduler.rs\u0060 and \u0060monoruby/src/scheduler/native.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/scheduler.rs:996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"028d4fea4485fe75f6b4596208f648ca9cf8163145853ed8a7a86de0988e7591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): monoruby/src/builtins/io.rs:3494-3511 | monoruby/src/builtins/kernel.rs:3677-3691 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/builtins/io.rs:3494\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b3de07de95fc07738f72b2544426ab4ec99d0b644cfd8579e3c842e666c323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): monoruby/src/builtins/numeric/integer.rs:1290-1306 | monoruby/src/executor/op.rs:1937-1954 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/integer.rs:1290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15e1208de1883bd833e3c4c5d3f34555737f92f16c3e19f5c5a2ba881b424ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:449-466 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:506-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:449\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e68cd119bf4a458f033e9ec1d07a65283f5e4f78a3d1a76f86b23213baa7204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:521-538 | monoruby/src/codegen/jitgen/asmir.rs:4603-4620 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:521\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5cfa01c2d5ceb30f71d6d9d25d1907d0178e0c128928e2841043367c17c12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): monoruby/src/globals/store/class.rs:2327-2344 | monoruby/src/globals/store/class.rs:2396-2411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf33171ff5b6712dfb95b96c2d4d04345c5c66af8d3b2650c9c9812e2652239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:4817-4832 | monoruby/src/parser/prism_backend.rs:4916-4933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:4817\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026LambdaNode\u003C\u0027pr\u003E\u0060 in one and \u0060\u0026BlockNode\u003C\u0027pr\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd5052e91acd075cdd8b56bc6135e4c200d02c58907353371a7a502dd28c3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201318 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:4841-4852 | monoruby/src/parser/prism_backend.rs:4961-4978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7682d3b742e31828a9267857ac191a6c7b9be9cb53f3331a8975144c6d94716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): monoruby/src/builtins/fiber.rs:468-484 | monoruby/src/builtins/kernel.rs:996-1012 | monoruby/src/builtins/thread.rs:317-333 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcce17a8b5b2908dfcb09acf8e85e76c1798e37690357fcae9e72e3c4560a965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): monoruby/src/builtins/io.rs:5172-5188 | monoruby/src/builtins/io.rs:5234-5250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:5172\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5172}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d91022fe406eeaad8be2a1d76eb58b1561d912738429ca57835ad5a0a2a876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): monoruby/src/builtins/process.rs:952-968 | monoruby/src/builtins/process.rs:1027-1043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/process.rs:952\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c7243cbe1d800e86fd39a15d2b03c58e7a16197683e885da70a1c9ffc0defd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): monoruby/src/builtins/regexp.rs:1443-1456 | monoruby/src/builtins/regexp.rs:1759-1775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/regexp.rs:1443\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a231620e50cc3d3a564b087f8142ec2cd41358a6a61b58b56e30a16779b6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): monoruby/src/builtins/string.rs:1833-1846 | monoruby/src/builtins/string.rs:1868-1884 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"9330b298a5f162a60027e81fa3e2af95a5b6e4326e98b33cdbe5794c0e68754b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/invoker.rs:75-91 | monoruby/src/codegen/arch/x86_64/invoker.rs:104-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c809b3b1514c34df3625d00fe62f67c04fe28b6baa2c9345c5644c9b7a72ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:5107-5123 | monoruby/src/parser/prism_backend.rs:5199-5210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:5107\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5107}}}],"partialFingerprints":{"codehealthFindingId/v1":"192bdf5a1dae15d59e21d557ef52630386dec2ab2e64d63cd9839814704b026e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): monoruby/src/builtins/numeric/float.rs:837-852 | monoruby/src/builtins/numeric/float.rs:874-889 | monoruby/src/builtins/numeric/float.rs:911-926 | monoruby/src/builtins/numeric/float.rs:971-986 \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 \u0060monoruby/src/builtins/numeric/float.rs:837\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c563afc62c00198be58753c8bef245dd9303cc38c4b1a6e544ff001964ce9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): monoruby/src/builtins/kernel.rs:5157-5168 | monoruby/src/builtins/kernel.rs:6193-6208 | monoruby/src/builtins/kernel.rs:6474-6487 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:5157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1452a19497482798ddf141997cd3ca938a21e0d15d9e05d6c11e8fe37349da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): monoruby/src/builtins/set.rs:592-607 | monoruby/src/builtins/set.rs:651-664 | monoruby/src/builtins/set.rs:686-698 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:592\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a20c81b5015a38f2e7a381dec422dd0b8cf84de82a1090339129650fd4bc065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): monoruby/src/executor.rs:2789-2804 | monoruby/src/executor/op.rs:1494-1505 | monoruby/src/executor/op.rs:1538-1549 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor.rs:2789\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a83ca972d9ca7deead84226d3ffd6e5dc03820fe80b1fa10f3dbbf01d291f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/builtins/array.rs:4615-4630 | monoruby/src/builtins/array.rs:4643-4658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4615}}}],"partialFingerprints":{"codehealthFindingId/v1":"4495dedd35dbd7a81ac6dcb9f01727c7af2a8018bb804b8639ef33b46f807142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): monoruby/src/builtins/file.rs:1388-1403 | monoruby/src/builtins/file.rs:1541-1554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/file.rs:1388\u0060 it begins part-way through the construct above it, so those exact 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":"monoruby/src/builtins/file.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae701575953e6a7e18010fe11c28dc9fb3480c66dd57cbce5813072a243c1078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:1093-1108 | monoruby/src/builtins/io_buffer.rs:1207-1222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/io_buffer.rs:1224\u0060 calls \u0060self_val\u0060, \u0060as_iobuffer\u0060, \u0060check_writable\u0060 and \u0060monoruby/src/builtins/io_buffer.rs:1109\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc89c0e7e48a6fe7bf5335a35b5c3e204e0f02f5cdd2d40818574ee243d7fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:419-434 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:470-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:419\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0877c2544a0321ee070a28ca15e657a18b899739a8801edb3a5242d51fa61fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:436-451 | monoruby/src/codegen/jitgen/asmir.rs:4521-4534 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:436\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c82e476511d9c0c75aa270d7cd9831b942cb1765d123c5b4932dc7668d1391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2152-2167 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4803-4818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2169\u0060 calls \u0060label\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:4819\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"18022108b013de82760fd7d6118f6814ad94532429fba667d50de966f4fbd9a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/codegen/jitgen/asmir.rs:4532-4547 | monoruby/src/codegen/jitgen/asmir.rs:4590-4605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/asmir.rs:4532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c75b2ed0dc31acf59df591a1f1897277c7a42531c9e59b75b509fe0c92d44a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): monoruby/src/codegen/jitgen/state/binop.rs:612-621 | monoruby/src/codegen/jitgen/state/binop.rs:637-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6788c85fb0327cb85b250f9ffabd43d7c097f74af436852990069275913e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/globals/store/class.rs:634-649 | monoruby/src/globals/store/class.rs:665-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/store/class.rs:634\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5151153c782e4928a0985629635fff306ca103860a3d45d6a79f056cd5262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/globals/store/class.rs:3212-3227 | monoruby/src/globals/store/class.rs:3391-3406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9478c84a38ab1e7c3de5ec03282bca9364504c70b548e25fd68519cbd2fe0eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:6001-6016 | monoruby/src/value/rvalue/string/transcode.rs:5281-5295 \u2014 before extracting anything, compare \u0060monoruby/src/value/rvalue/string.rs\u0060 and \u0060monoruby/src/value/rvalue/string/transcode.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:6001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6001}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c89a35f40f43f7d1be43f52295870c970d75c0a0ed9521ed8af3aca32b07d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:6499-6514 | monoruby/src/value/rvalue/string.rs:6684-6699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:6499\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f29d73e0342afc524257fd3c94f54fc3719ad1035929463155af5192ebf76c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:1088-1103 | monoruby/src/value/rvalue/string/pack.rs:1130-1143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:1088\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa569a8f4668192a91460b2d43da280b2e2d13ed03a86228c1c6918f5e3be530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:4814-4829 | monoruby/src/value/rvalue/string/transcode.rs:8509-8524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:4814\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bdec1e8e9c6653833361fef2e05ee223f6fbf259ab8cd0374fea467d25efd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:5412-5427 | monoruby/src/value/rvalue/string/transcode.rs:5574-5589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:5412\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d39512a9f34cc6a8f61866f73844d04a734caccb219f751f5ac449158590b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): monoruby/src/bytecodegen/defined.rs:104-118 | monoruby/src/bytecodegen/defined.rs:230-244 | monoruby/src/bytecodegen/defined.rs:291-305 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/defined.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dbc6b97c4cd9ded4e816efe9d91abfe9ab0abb69171f0b38ba82e4afd1d48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:2568-2582 | monoruby/src/parser/prism_backend.rs:2615-2629 | monoruby/src/parser/prism_backend.rs:3346-3360 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:2568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441d90c5ecc3c6f69810ef5a6b2bb54d471613901a2e13c826cca5a557b9d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): monoruby/src/builtins/array.rs:3182-3196 | monoruby/src/builtins/array.rs:3290-3302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b54cf801936f6a128692a925c2d90f025e11d435c8a55ed47b20bb3163f24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): monoruby/src/builtins/hash.rs:2216-2230 | monoruby/src/builtins/hash.rs:2431-2445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:2216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad2451159b5c912eb9b6688742abe345a227d3d8bff2592291eb0ea1aabc1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): monoruby/src/builtins/io.rs:2853-2867 | monoruby/src/builtins/io.rs:3041-3054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:2853\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b93e777f67686def0fed54566c64eac1cfaa95fabf899d0bf5bd86da8509363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): monoruby/src/builtins/io.rs:5217-5231 | monoruby/src/builtins/io.rs:5316-5330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/io.rs:5315\u0060 calls \u0060nonblock_exception_kw\u0060, \u0060try_arg\u0060 and \u0060monoruby/src/builtins/io.rs:5216\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":"monoruby/src/builtins/io.rs"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"06614a654e668b5afb67538ec6a36260f10e1e8cfdf17e88cd46c509a562c8e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): monoruby/src/builtins/module.rs:2617-2631 | monoruby/src/builtins/module.rs:2651-2661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/module.rs:2617\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"683a13e69bf3a8e14278077b0fe3e3252ba93e7162fbf2635009591a804b76db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): monoruby/src/builtins/string.rs:2048-2062 | monoruby/src/builtins/string.rs:6389-6403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:2048\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"e331509c7de1655fadd8c6ab6d7b6060e91889b42652ac9bc60d1f8521339b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): monoruby/src/builtins/string.rs:7906-7920 | monoruby/src/builtins/string.rs:7958-7972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7906}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcb0a17a08a00dda31dcdf9b53ad6a07198db96cacd31455d170518d7d1fc16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): monoruby/src/builtins/string.rs:9122-9136 | monoruby/src/builtins/string.rs:9157-9170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":9122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1334674b5cd7b7dc040a84af7e63f40bd2c8124d586e2d85eb7fc511569f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): monoruby/src/builtins/string.rs:12579-12593 | monoruby/src/builtins/string.rs:12611-12622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:12579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e58e26be61319907ee393fe4da31612b85e24c6f28b7a7a5eef33d0cbb1d5e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): monoruby/src/bytecodegen/defined.rs:108-122 | monoruby/src/bytecodegen/defined.rs:339-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/defined.rs:108\u0060 it begins part-way through the construct above it, so those exact 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":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"757d622c70aec6fae63392e8d3ada4da4cc5e50f83498c857358873c20794c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:464-475 | monoruby/src/codegen/jitgen/asmir.rs:4545-4559 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:464\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"854186f2fb2ae839da21b83d773ac38b82c164c3711a7fc6e9e40ef8970371ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1989-1999 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:741-755 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:1989\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd24374e0d493aa24366befacd42264e74ed3f5c93c26124e817b24a1a0abf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1190-1200 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1247-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8505918b662b4b04a077d2d4700acfa080437f36d7158ca13bf5c3c458e89b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:6590-6603 | monoruby/src/value/rvalue/string.rs:6620-6634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:6590\u0060 it begins part-way through the construct above it, so those exact 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":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1292228cf4102d3227232295f3b9a6ca940a381033d523704680e576d358147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): monoruby/src/value/rvalue/string/transcode.rs:5822-5834 | monoruby/src/value/rvalue/string/transcode.rs:5991-6004 | monoruby/src/value/rvalue/string/transcode.rs:6067-6079 | monoruby/src/value/rvalue/string/transcode.rs:6957-6969 \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 \u0060monoruby/src/value/rvalue/string/transcode.rs:5822\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/string/transcode.rs:5835\u0060 calls \u0060len_utf8\u0060 and \u0060monoruby/src/value/rvalue/string/transcode.rs:6080\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5822}}}],"partialFingerprints":{"codehealthFindingId/v1":"128217581db3d025cc9cbccad21399a3188620c3e0354b41ddc4018d5fcbb2ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 3): monoruby/src/builtins/module.rs:1532-1545 | monoruby/src/builtins/module.rs:1589-1597 | monoruby/src/builtins/module.rs:1774-1782 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/module.rs:1532\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8b7d14db0a2933c892989e66f12c749450f84b024c01b900223ed47eff3353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:717-727 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:843-856 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1985-1996 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:717\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5712b2d2c9fbd7fbee6e47d5bd84d19d27ea1fc696dfab88b4ab312424562cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/array.rs:443-456 | monoruby/src/builtins/array.rs:491-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:443\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ccd7e623315f95593d462bd45d3df1e2075ab001c9ad68ffe1184d83dc944a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): monoruby/src/builtins/array.rs:1133-1146 | monoruby/src/builtins/hash.rs:1109-1119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:1133\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bf22004be2f6ca8ca602b2db6f7f933665e2fee17269bd1d0c5732416249cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/file.rs:2517-2530 | monoruby/src/builtins/file.rs:2595-2608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/file.rs:2517\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d592c62c228c7d00c487b7c6d23aee8a1ea20be7257c848a91fa01c9e5127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/io.rs:854-867 | monoruby/src/builtins/io.rs:3421-3434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:854\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7c903bbb90adcb6cad9e349e4e937fc19bd377eaeef8babb2a54c97ffc185d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:1072-1085 | monoruby/src/builtins/io_buffer.rs:1191-1204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"07923d796012ccd6e97e94e510a4f9a0feee9b657ebfe9bc410c5e804f0cc286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/kernel.rs:4234-4247 | monoruby/src/builtins/process.rs:423-436 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4234}}}],"partialFingerprints":{"codehealthFindingId/v1":"595fe8cd5ed6469396f2b06a1513a2b98f46d51341eb998ae3bd311b47fea5ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): monoruby/src/builtins/marshal.rs:676-688 | monoruby/src/builtins/marshal.rs:694-707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/marshal.rs:676\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05a360da02306dd32ce96177d9150345517ca1e1f93bf149d97f6de6d343f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/numeric/integer.rs:581-594 | monoruby/src/builtins/numeric/integer.rs:668-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282600d8c44be3728b72dc06291820b8a9bf1b4d666c43546f2b1cc21291cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/numeric/integer.rs:1811-1824 | monoruby/src/codegen/runtime.rs:1535-1548 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/integer.rs:1811\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a34bef9ab5ac1b883b4205fc09189e569dd0e8175a7f7f5beb71e92bcea72ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): monoruby/src/builtins/regexp.rs:1590-1599 | monoruby/src/builtins/regexp.rs:1714-1727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/regexp.rs:1590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ecb78bba193b72b1ab34aa090e8ad82053f260c0cd7f6d498c5e08fa56d5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): monoruby/src/builtins/string.rs:6540-6553 | monoruby/src/builtins/string.rs:6660-6669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:6540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6540}}}],"partialFingerprints":{"codehealthFindingId/v1":"5107e9efcb60f58b575c233a244979fc163d21e496bb047764d7fbd4a7132ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/bytecodegen/defined.rs:167-180 | monoruby/src/bytecodegen/defined.rs:370-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb107a0d395873a840882ef88dfb897b9b5d7a5b99cec6c58dd54a67612fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): monoruby/src/bytecodegen/expression.rs:540-552 | monoruby/src/bytecodegen/expression.rs:618-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/expression.rs:540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b5e7839713a9af2efd0e702d57c947d1d682f46a5a50cf18cc987599f738fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/codegen/jitgen/asmir.rs:4503-4516 | monoruby/src/codegen/jitgen/asmir.rs:4554-4567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/asmir.rs:4503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4503}}}],"partialFingerprints":{"codehealthFindingId/v1":"5820a0fb8a9262f8a7da79e0c8980503eaf50baca4fae9f166ce8a8782278637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/method_call.rs:1204-1213 | monoruby/src/codegen/jitgen/compile/method_call.rs:1233-1246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:1204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:1247\u0060 calls \u0060load_fpr\u0060, \u0060pin_fpr\u0060 and \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:1214\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef46e3e2d1dd627dd371decaf1877b1a902276043e915b032859ba941c814c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/method_call.rs:2055-2068 | monoruby/src/codegen/jitgen/compile/method_call.rs:2577-2590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c81f7281c53d2ceb1c2d6cdfacc0a2e7977f214b79b496e209fe543a188e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/method_call.rs:3655-3666 | monoruby/src/codegen/jitgen/compile/method_call.rs:3779-3792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:3655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn generic_send(\u0026mut\u0060 in one and \u0060super) fn compile_yield(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:3654\u0060 calls \u0060pc\u0060 and \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:3778\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":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":3655}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5825eb8c09c257b0d8b1f5a32edb3972572576433887237abaf374f1ebc81db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): monoruby/src/executor/format.rs:1024-1038 | monoruby/src/executor/format.rs:1193-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/executor/format.rs:1188\u0060 calls \u0060Some\u0060 and \u0060monoruby/src/executor/format.rs:1018\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a138c9d089204664b33087b75cd0095f7bd2a627ef115f029e7a338081f05a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:1781-1794 | monoruby/src/value/rvalue/regexp.rs:1906-1919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:1781\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0fe965bc2ee1bc34ba098475ded1c21065f1f509d9f705099b03bc25cfb1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3287-3300 | monoruby/src/value/rvalue/regexp.rs:3572-3585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:3287\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdb1f9347a582e1473e52be23029fee1a2a1c9e5dbe3ef60e38139374806cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:6436-6449 | monoruby/src/value/rvalue/string.rs:6531-6542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:6531\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c32802a6ad635a563d88f81984122bf5b77c404912b96c1ba2395a74ef9428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 4): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1964-1972 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:1992-2000 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:723-731 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:744-756 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:1964\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f14aa9e39cd469038fc27e352b5ee3567be0947a20eee445886b1277fd01af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): monoruby/src/builtins/numeric/integer.rs:1285-1296 | monoruby/src/executor/op.rs:1932-1944 | monoruby/src/executor/op.rs:1972-1983 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/integer.rs:1285\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c862cb9a0663e0f69278b4712fb1ae05a444e97bba0bbff2bb6b8d67f2f61a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 3): monoruby/src/builtins/regexp.rs:1419-1427 | monoruby/src/builtins/regexp.rs:1590-1598 | monoruby/src/builtins/regexp.rs:1714-1726 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/regexp.rs:1419\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26380d896b901dbe078abcefd9683f90de2fa2f51aa29d0c5f0df27253922b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3223-3235 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3577-3589 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4160-4172 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3223\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5bf7e64d15a914f2285acc09d22f33fe414ca053d076a5b85e94bc6882ee34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): monoruby/src/value/rvalue/string/pack.rs:1029-1040 | monoruby/src/value/rvalue/string/pack.rs:1048-1059 | monoruby/src/value/rvalue/string/pack.rs:1067-1079 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:1029\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:1080\u0060 calls \u0060push\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:1041\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":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dde3785ece218d5053e48ee64460350d0378c33d828d4b7b17f98e0fc2cf96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): monoruby/src/builtins/array.rs:4377-4386 | monoruby/src/builtins/array.rs:4408-4420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:4377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04fab2ee33ad424756fdf1ef820a39414721ea048e116d48dc9d7a2935b5812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/builtins/io.rs:2787-2799 | monoruby/src/builtins/io.rs:6079-6091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e791ffe17a6fa381e33973530f0dc54c9382db137c50494bdf04d0d65c95b203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/builtins/json.rs:343-355 | monoruby/src/builtins/json.rs:1499-1511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/json.rs:343\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"593a6f91ee5afe3b840f7045837bef2bd12cef6aa1ee767a0b60f2f73f673638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/builtins/string.rs:4680-4692 | monoruby/src/builtins/string.rs:4696-4708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:4680\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4680}}}],"partialFingerprints":{"codehealthFindingId/v1":"50582632ea8e6ad112d731fae7eb71d43a97253fa585bec43604ec8617351097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/builtins/symbol.rs:123-135 | monoruby/src/value.rs:2284-2296 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/symbol.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"22871d6de889af6a81bcff0e271f1b3056e384568e6c5ab4f1bfd52df4fe94f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/builtins/time.rs:2321-2333 | monoruby/src/builtins/time.rs:2335-2347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/time.rs:2332\u0060 calls \u0060Err\u0060, \u0060argumenterr\u0060 and \u0060monoruby/src/builtins/time.rs:2319\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b71fb87edd650b5703df8a34b592f75c79cad14e41a594ac03def62f3b7acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3365-3377 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4103-4115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3365\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"90779c1daf16a1466bf3243e9c68225bc861f662ceb05e0e0ce3cc11e32cc9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:781-793 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:941-953 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/frameless_call.rs:781\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3052aa244f3cf0d11c30ac9aff000128eecb3ea2f940918a5bed4ca129ebe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): monoruby/src/codegen/jitgen/context.rs:1402-1411 | monoruby/src/codegen/jitgen/context.rs:1476-1488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da007ff6185a7288e47d63f682ca8543a83a0eb4ba9618584c6f9a3f342cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/codegen/runtime.rs:1338-1350 | monoruby/src/codegen/runtime.rs:1364-1376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28db8dcec4abf4e11c8c48e95a269960e0737eda99c91b56906d3067345bbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/globals/prng.rs:255-267 | monoruby/src/globals/prng.rs:387-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/prng.rs:255\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/prng.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1d47531e88ddbc5df681280b313120195e89ad63ff63261f3d07e3b5e50992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/value.rs:392-404 | monoruby/src/value.rs:427-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value.rs:392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/value.rs:389\u0060 calls \u0060with\u0060, \u0060borrow_mut\u0060, \u0060remove\u0060 and \u0060monoruby/src/value.rs:426\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c583c3976b5de2e69e4d09f52cd321903d66d888fa76eae03069b2ee46b3de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): monoruby/src/value.rs:2166-2178 | monoruby/src/value.rs:2234-2245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value.rs:2166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"025d37a7bdee221a9e7a8e5a764dc967153e47e7c7dc43949550dd03aef92c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/value.rs:2396-2408 | monoruby/src/value.rs:2466-2478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"99346f2d51a159d6397be67cc6f0aab24d93dda518981701fca241c36596107b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:2255-2267 | monoruby/src/value/rvalue/io.rs:2298-2310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/io.rs:2255\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ca20a72ac6bde11c95beab24d787395874af2adf7b490f1e19a4c14914d58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:5103-5110 | monoruby/src/value/rvalue/string.rs:5141-5153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:5103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e52e890a0781060fe2183ede20a3455f39645a5238c444c4dfa095169e43e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): monoruby/src/builtins/hash.rs:2203-2214 | monoruby/src/builtins/hash.rs:2382-2393 | monoruby/src/builtins/hash.rs:2418-2429 | monoruby/src/builtins/hash.rs:3963-3974 \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 \u0060monoruby/src/builtins/hash.rs:2203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1a72e8bd10d2add3db093d4691c4aa390b4f3b3cd1147c1d78729d707abbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/nokogiri/src/reader.rs:337-348 | ext/nokogiri/src/reader.rs:362-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/reader.rs:337\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/nokogiri/src/reader.rs:375\u0060 calls \u0060Ok\u0060 and \u0060ext/nokogiri/src/reader.rs:349\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/reader.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3cd858b5bcd5ce064db00e35f7ab20ec2efc7e4495e23adc8e61237dcb9204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/nokogiri/src/schema.rs:270-281 | ext/nokogiri/src/schema.rs:293-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/schema.rs:270\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/schema.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"609dafbc40930f3cb62d12c84a8a08fd19f2eecaf679821794ac472e67a7ee6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/nokogiri/src/xpath.rs:88-99 | ext/nokogiri/src/xpath.rs:118-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/xpath.rs:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/xpath.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca15bd0feed32816ba87483a9c679a7181229003e444f3acb08a59f874c6925e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hashbrown/src/map.rs:3981-3992 | rubymap/src/map.rs:1682-1693 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3981}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4a9c5fad885bbbd68f7ab74c3226c05463be11009a4ee356ecec891aba504f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/dir.rs:385-396 | monoruby/src/builtins/dir.rs:446-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f1a33c3771e5ea4f58ab960be1e4beae02f0dea19aafc827df67faf759ef8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/io.rs:2869-2880 | monoruby/src/builtins/io.rs:3056-3067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:2869\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb267af494c69fc4f8aa5c7f86bf0d751fbb1a3459e144f569708529eec5ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/io.rs:3550-3561 | monoruby/src/builtins/kernel.rs:3740-3751 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3550}}}],"partialFingerprints":{"codehealthFindingId/v1":"78734e8991e603db68a1e94588cc41a3f14daf8a5c0ae968765d50251a36e3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/kernel.rs:1390-1401 | monoruby/src/builtins/kernel.rs:1678-1689 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"026b4f1dfe0b4dc963dcedf55bf45c7deeba6625abebfedf8082da86a47437ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): monoruby/src/builtins/kernel.rs:1644-1655 | monoruby/src/builtins/kernel.rs:1688-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:1644\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d2aff6ebf29a5c6f41db8f015eb49146a0e3788b39bc1a7658b8bed1706d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): monoruby/src/builtins/marshal.rs:906-917 | monoruby/src/builtins/marshal.rs:1454-1464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc47bd5f146c65e585303b97ca33284673c2e7dca0eb7a313b9af4a524e3f865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): monoruby/src/builtins/marshal.rs:2332-2343 | monoruby/src/builtins/marshal.rs:2353-2361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/marshal.rs:2332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d22eabf2d3f6754a12c0443f17db1ad74b20c8a45126197eeac4e655d94a02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): monoruby/src/builtins/match_data.rs:675-684 | monoruby/src/builtins/match_data.rs:814-825 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ddbf2956fe19e65eadf3914640d5974c988ab10bebe6d89764dd0578fb3320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/numeric/float.rs:155-166 | monoruby/src/builtins/numeric/float.rs:207-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c900c52cea92fc2acb70ddb655713130c3bdb7c895814f19a65331de5b93c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/process.rs:452-463 | monoruby/src/builtins/process.rs:1734-1745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d19147151b8439e792c018aa03c12cc74efbc33aa1b2dc5d5b78d5ddca5449b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): monoruby/src/builtins/range.rs:865-875 | monoruby/src/builtins/range.rs:901-912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/range.rs:865\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/range.rs:913\u0060 calls \u0060Ok\u0060 and \u0060monoruby/src/builtins/range.rs:876\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":"monoruby/src/builtins/range.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb2b4a1209d87e45e7f6d377df3de40afbadf88c92d988eae1e6ea3e027c8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/set.rs:1087-1098 | monoruby/src/builtins/set.rs:1123-1134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:1087\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"63da0bceb496ddf19992062c5b3b0c36082d69a8797061a2e7a6684962db3372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/string.rs:10735-10746 | monoruby/src/builtins/string.rs:11628-11639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:10735\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10735}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b34091050a4f52f3d08b467104d4b287ac3284b563efe1d7c0cacb66594e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/builtins/string.rs:10882-10893 | monoruby/src/builtins/string.rs:10979-10990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10882}}}],"partialFingerprints":{"codehealthFindingId/v1":"4038dabf42f424889218d514b0fe334d071d7e1ec4bd2d44055dc7d7ce4481ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/bytecodegen/expression.rs:1310-1321 | monoruby/src/bytecodegen/expression.rs:1398-1409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/expression.rs:1310\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"29033690e583d6c492d89d3c032018f807c89f16cc8ada10180af6378a77dce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:256-267 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1978-1989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:256\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5097c8f6ad6c33259d6f3b7ce4ddf40cf9609d90ff05d676f663597d2786f7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/method_call.rs:2133-2144 | monoruby/src/codegen/jitgen/compile/method_call.rs:2611-2622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"786bc8e5aa2deb62b5b332596b85791ad147fa42703f294ccbe00abf1bda167f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/codegen/jitgen/context.rs:3602-3613 | monoruby/src/codegen/jitgen/context.rs:3638-3649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/context.rs:3602\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":3602}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7cc5c38fa77f518f9ee0923dc8a9e57b871f26ecf1f1f5c627b2d95087a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/codegen/runtime.rs:2197-2208 | monoruby/src/codegen/runtime.rs:2240-2251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b0c203f148577941cb1e3fcafcc43047eb39b9f812aadf5313ca2206cdef3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/ext.rs:1624-1635 | monoruby/src/ext.rs:1649-1660 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/ext.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b738b9560f6b8690de82738049c16d4612cbc8f66a86b6dc5506ba4260331aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): monoruby/src/scheduler.rs:488-499 | monoruby/src/scheduler/native.rs:905-914 \u2014 before extracting anything, compare \u0060monoruby/src/scheduler.rs\u0060 and \u0060monoruby/src/scheduler/native.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/scheduler.rs:488\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/scheduler.rs:500\u0060 calls \u0060retain\u0060, \u0060Some\u0060 and \u0060monoruby/src/scheduler/native.rs:915\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3e5a504b7060a813dc483acdd2547f18430e1a9e2d91abd89938366c131ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/scheduler.rs:857-868 | monoruby/src/scheduler/native.rs:826-837 \u2014 before extracting anything, compare \u0060monoruby/src/scheduler.rs\u0060 and \u0060monoruby/src/scheduler/native.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/scheduler.rs:854\u0060 calls \u0060enabled\u0060, \u0060terminate_all\u0060 and \u0060monoruby/src/scheduler/native.rs:825\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db3cd1d6b24b44faea3c60e9f782c7c4abfc35327841515fb228d92e8bdf038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): monoruby/src/value/rvalue/fiber.rs:293-304 | monoruby/src/value/rvalue/fiber.rs:379-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b70fdbbc77914976a5fdbbc2c07e7c65ae34e00a43f2faffa2baa2ef103c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:1849-1860 | monoruby/src/value/rvalue/io.rs:1872-1880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/io.rs:1849\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbb1f48f89d3730cf24b3ccb19823f79eaf8dc722701ad39c7a95d6189270db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:1102-1113 | monoruby/src/value/rvalue/string.rs:1117-1128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:1102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"400f279f616c3bab8983bd89811b9baa7801d473b33a9af9bea98e56d22c2e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:973-984 | monoruby/src/value/rvalue/string/pack.rs:1153-1163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:973\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3e3f9da57c392535de7472ad45c0d147d2020b5e30b7bb553957f633ef1e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): monoruby/src/bytecodegen/defined.rs:108-118 | monoruby/src/bytecodegen/defined.rs:171-184 | monoruby/src/bytecodegen/defined.rs:234-244 | monoruby/src/bytecodegen/defined.rs:295-305 | monoruby/src/bytecodegen/defined.rs:335-349 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/defined.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/bytecodegen/defined.rs:104\u0060 calls \u0060emit\u0060 and \u0060monoruby/src/bytecodegen/defined.rs:167\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":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37ea37319b97f609afbcfe720bcf2749e07421dc5eb33ea726bc5f583d6321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): hashbrown/src/control/group/generic.rs:59-69 | hashbrown/src/control/group/lsx.rs:34-44 | hashbrown/src/control/group/neon.rs:30-40 | hashbrown/src/control/group/sse2.rs:36-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/control/group/generic.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"910a179969b1234f19bf665a78eb83b049a9b779a6825852841fe6a505df497d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): monoruby/src/builtins/numeric/integer.rs:1538-1548 | monoruby/src/builtins/numeric/integer.rs:1562-1572 | monoruby/src/builtins/numeric/integer.rs:1590-1600 \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":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c5081d01e51fec170b36dd4e5b46759aa0be6496d2448d8c55a4715c6137e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 3): monoruby/src/builtins/string.rs:1545-1555 | monoruby/src/builtins/string.rs:1590-1600 | monoruby/src/builtins/string.rs:3978-3983 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:1545\u0060 it does not close everything it opens, so those exact 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2448bf9a0e298fc3330efed690b519dd5a8709fbe9dcd946be06e5a288596a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): monoruby/src/builtins/string.rs:3383-3393 | monoruby/src/builtins/string.rs:3535-3545 | monoruby/src/builtins/string.rs:3561-3571 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:3383\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc06d49d861b56334eb6d16a20be5ae09c73ae90016e58221e5f0201c1ccb5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3371-3380 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4109-4118 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4134-4144 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:4134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3370\u0060 calls \u0060a64_frame_load\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:4134\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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3371}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d41d7d03ed97f4a1d3a93ab75657a26e6707a30bf924fea5461e9ca1ac5f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): monoruby/src/value/rvalue/string.rs:174-184 | monoruby/src/value/rvalue/string.rs:288-295 | monoruby/src/value/rvalue/string.rs:1942-1952 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:174\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e959f0d5f7b33305257b27c790810c3d0564d60673da1ea647f6a7fa60f946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): monoruby/src/value/rvalue/string.rs:215-225 | monoruby/src/value/rvalue/string.rs:239-249 | monoruby/src/value/rvalue/string.rs:259-269 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abce08abd32a2db7d1267521af474b2bf6e1295265988979fa2462c166e92c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/nokogiri/src/document.rs:109-119 | ext/nokogiri/src/document.rs:225-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/document.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"473b644ceae3fd5cfe17038bcdd4e6324efb808d2f855341594100c2a5c6301a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): monoruby/src/builtins/array.rs:1264-1273 | monoruby/src/builtins/array.rs:1302-1312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:1264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae0c20d74383fc803c002af2030629dec181ad806e08d231a4d4e4bb06f1f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/binding.rs:124-134 | monoruby/src/builtins/kernel.rs:3465-3475 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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, \u0060monoruby/src/builtins/kernel.rs:3464\u0060 calls \u0060nearest_ruby_frame\u0060 and \u0060monoruby/src/builtins/binding.rs:123\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":"monoruby/src/builtins/binding.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ab6e741423ad420247c3afe8e3b35cdfd020f0e4fbed51b664d95734e53338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/binding.rs:321-331 | monoruby/src/builtins/binding.rs:349-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d627b219684718022a6f91cab47af723b40a409e0e3f7a6bcd9ede9caac90f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): monoruby/src/builtins/hash.rs:1827-1835 | monoruby/src/builtins/hash.rs:1856-1866 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"409f4296e6be0e70e307cde9849c752470ebb522e007df38010cfd472ab81b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/io.rs:443-453 | monoruby/src/builtins/io.rs:3168-3178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3d0add7d4e385af762a016fab8498db126c987275f0aabb62f6c28fc7ba3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/kernel.rs:394-404 | monoruby/src/builtins/object.rs:85-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:394\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80a952463e01e72d8c27c3740d48911ca7245b927fd529bfa0676f034ebbef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/marshal.rs:2584-2594 | monoruby/src/builtins/marshal.rs:2923-2933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/marshal.rs:2584\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/marshal.rs:2922\u0060 calls \u0060push\u0060 and \u0060monoruby/src/builtins/marshal.rs:2583\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff81ac34d1c521c2fd81f01d860bda05d82e1c615e166361077b31ba95c8e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/method.rs:411-421 | monoruby/src/builtins/method.rs:455-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/method.rs:411\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ed1b3a233c852ac72b5d07d6924b4029e35316920be3351bfbdd6852a5b430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): monoruby/src/builtins/module.rs:3209-3218 | monoruby/src/builtins/module.rs:3246-3256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/module.rs:3209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa47e8b082ca5395af0a5f88c05ff8698eabb83b8956865e0247a4ec460a7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/string.rs:1547-1557 | monoruby/src/builtins/string.rs:6468-6478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:1547\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d71dd47ac0453ad776bb8b9645f306b7d5db27d9956910a2108b99f0be1c878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): monoruby/src/builtins/string.rs:8718-8726 | monoruby/src/builtins/string.rs:8752-8762 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":8718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69c7d42058d46d6166f975de0fcbcf6a5c5ef4f14ff9049d2aeb89160521dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): monoruby/src/bytecodegen/expression.rs:1558-1568 | monoruby/src/bytecodegen/expression.rs:1604-1612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e5bb94cedf0d0108417a1c3f416aa03a8f7b5b86105469d099bf4072d9698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:561-571 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:616-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:561\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2623c0222d0f0b0e9f7fd4b5c64d37181abe88ab86fa04b25647ad337ecdd532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:406-416 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:536-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:406\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeef7754b5dcac783dd5e535e4be8ca536bf581817542f7ae168e036209c220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2338-2348 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4612-4622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f4ebd3f1d8524d491a48ce7a6b223591aac536b74940bf4d7252724d36e939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:4343-4353 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4366-4376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:4343\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1f0c516904f9640cdd434843e090edb6037648012b3afdb84d35cdb18f3ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:566-576 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:678-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 \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:566\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"57886f842808ca0f35ae5aba1f0ea0a905124a588cfd8781c67a54a491325c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1023-1031 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1261-1271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1023\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"947d032807cf5feb4e81bbfba2a99a106e7b59cc623c8270c48cbed99db1e623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/mod.rs:2064-2071 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2150-2160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs:2064\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35dee552bf0714f8366ca74d6290c7a6b7902490f5b47bfae81767f7b1f1e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/mod.rs:2301-2311 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2373-2383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbadc0a128fad77309643a63dbd2ccebea06ad8695deae05f6822634be9d4ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/jitgen.rs:1653-1663 | monoruby/src/codegen/jitgen.rs:1669-1679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen.rs:1653\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b25800d5b86c6f19ea7c6d83a925130a055af5bb996b84842e7b295391cd720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/jitgen/asmir/compile_shared.rs:1600-1610 | monoruby/src/codegen/jitgen/asmir/compile_shared.rs:1683-1693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e464c7fab52b4b867b495f945be1e82933a8eedd5f627e1efadf85348bcc7c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:504-514 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:552-561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"432794d1d1314c3283f65ede4c4fe35fd9d85e7f74085b403e681d351e432afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:846-854 | monoruby/src/codegen/jitgen/compile/method_call.rs:4122-4132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c88272f57347b0e4b4f5d65316c2dae0b89e904433b2b9d54d4a92f3658bc6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/executor/format.rs:1591-1601 | monoruby/src/executor/format.rs:1612-1622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/format.rs:1591\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"997abd09d9ef18388c7c6928854b33ef747d78a9299c643a4438b0c100dde771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/executor/format.rs:1611-1621 | monoruby/src/executor/format.rs:1628-1638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/format.rs:1611\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc7c8cdbf0c4508b68c2cbe6bf74bf4923a39c8b2fe23a004c35dd1126153e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:1710-1720 | monoruby/src/value/rvalue/io.rs:2128-2138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cdf90f3f414378c345c3f52b18ea8e140faa668ee1e5faabe6ab1d5affe7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:2119-2129 | monoruby/src/value/rvalue/regexp.rs:2143-2153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:2119\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5be2a8281f8fb1e2d38bf6226768e9993f374ff1be38ee22a1cdaae45346e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3468-3478 | monoruby/src/value/rvalue/regexp.rs:3523-3533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6822bd675911aed9c2f18c10390de3c03905ffff13bbf2084251a06979c493d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rubymap/src/map/core.rs:554-564 | rubymap/src/map/core.rs:627-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map/core.rs:554\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba87e18bc2f013271a581de094b5154e5fada30f456f72b4b20bbaa27bc8476a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rubymap/src/map/core.rs:570-580 | rubymap/src/map/core.rs:643-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map/core.rs:570\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6cd0301393f0732bb71a759ce6e9968d715f81577e5fa177ee402b65def63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): monoruby/src/builtins/kernel.rs:4768-4777 | monoruby/src/builtins/kernel.rs:4787-4796 | monoruby/src/builtins/kernel.rs:4811-4820 | monoruby/src/builtins/kernel.rs:4840-4849 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4768}}}],"partialFingerprints":{"codehealthFindingId/v1":"712f112cf16f06622de22f6f62ca4b9fd71274a6909343d9ef61407473d5a60e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): monoruby/src/builtins/kernel.rs:4768-4777 | monoruby/src/builtins/kernel.rs:4782-4791 | monoruby/src/builtins/kernel.rs:4801-4810 | monoruby/src/builtins/kernel.rs:4825-4834 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ab1260635b90885b248deb76d59202118302c6412a81e305b0afc1332e2a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): monoruby/src/builtins/marshal.rs:2156-2165 | monoruby/src/builtins/marshal.rs:2168-2177 | monoruby/src/builtins/marshal.rs:2816-2825 | monoruby/src/builtins/marshal.rs:2866-2875 \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 \u0060monoruby/src/builtins/marshal.rs:2156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/marshal.rs:2876\u0060 calls \u0060as_struct\u0060 and \u0060monoruby/src/builtins/marshal.rs:2826\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa55f92bd04c582d7bf9c42aabe184bd5b344ba5797a3d285b16c0cc92bde8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): monoruby/src/builtins/string.rs:3384-3391 | monoruby/src/builtins/string.rs:3536-3543 | monoruby/src/builtins/string.rs:3562-3569 | monoruby/src/builtins/string.rs:3851-3860 \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. 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":"monoruby/src/builtins/string.rs"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f9de099f8b822bdedaa18aa9177d9fd26f8634f2dcab9b4bff083d012667d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3142-3151 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3342-3351 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3583-3592 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4166-4175 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3341\u0060 calls \u0060a64_frame_load\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3582\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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"180a067bec392cb4e78e168283c76be3638e48e89035af42a7fe2ebce3da69df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/builtins/io.rs:428-437 | monoruby/src/builtins/io.rs:443-452 | monoruby/src/builtins/io.rs:3168-3177 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:428\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"863ac44bb470a60b0ed888328da26997563128fbf1c5c92b7b61ed4cc707bf55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/builtins/kernel.rs:1365-1374 | monoruby/src/builtins/kernel.rs:1393-1402 | monoruby/src/builtins/kernel.rs:1681-1690 \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":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70861b4e93ee7bb57c45bc3a14400eba52bbf0e1b9c429f411290133546f730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/builtins/string.rs:7304-7313 | monoruby/src/builtins/string.rs:7332-7341 | monoruby/src/builtins/string.rs:7359-7368 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b227b1555af063fdb07859b9a26a1044af3bd11495f43eb0a921dbc2e255f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/builtins/symbol.rs:90-99 | monoruby/src/builtins/symbol.rs:124-133 | monoruby/src/value.rs:2285-2294 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/symbol.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3236cdf2db685cb6726300ecbbcf17df772dd9f2fdf90031e91bbb83ba30d786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/bytecodegen/encode.rs:349-358 | monoruby/src/bytecodegen/encode.rs:394-403 | monoruby/src/bytecodegen/encode.rs:606-615 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/encode.rs:349\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"faefa858abcbfd5b38b7002c293d15a09830836845feccf635a11897069ea3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/mod.rs:4317-4326 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4345-4354 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4368-4377 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:4317\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2417f64d70f80eb73479bb23d690fe63ab99c44dc4ae4fa2833aa8f414d7811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:563-572 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:675-684 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:897-905 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:563\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae38249e21a5204d533b0cc51d1bf84f28b0e4487fe14c3b0d47b195dea9ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/codegen/jitgen/compile/method_call.rs:3601-3610 | monoruby/src/codegen/jitgen/compile/method_call.rs:3659-3668 | monoruby/src/codegen/jitgen/compile/method_call.rs:3785-3794 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/method_call.rs:3601\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn generic_send(\u0026mut\u0060 in one and \u0060super) fn compile_yield(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":3601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0d2db9d47fde2af904523a3a28e12d531f3820121f33193e464d48a53a7b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): monoruby/src/codegen/jitgen/trace_ir.rs:644-653 | monoruby/src/codegen/jitgen/trace_ir.rs:681-690 | monoruby/src/codegen/jitgen/trace_ir.rs:723-732 \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":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae560cea542cc58c20394ed2866f106159d016cc738246f6746b95084530318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:1199-1206 | monoruby/src/parser/prism_backend.rs:2961-2970 | monoruby/src/parser/prism_backend.rs:2986-2993 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ClassNode\u003C\u0027pr\u003E\u0060 in one and \u0060\u0026ModuleNode\u003C\u0027pr\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cec1ccac727e7a62575a2a6abf8cb0da50b3f781a67eaf4eb4a27b9c445ca10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hashbrown/src/map.rs:209-218 | rubymap/src/map.rs:104-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4ce53175fef90add723f0ca621ec7a8c7793c09dc2043c312916f6a5c81ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/array.rs:1274-1283 | monoruby/src/builtins/array.rs:1328-1337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:1274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6b2ce7deac00e5f4f26bd12de00138b7ce85661f7d5d823cce0d7114a39e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/array.rs:2416-2425 | monoruby/src/builtins/array.rs:2439-2448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/array.rs:2438\u0060 calls \u0060Some\u0060, \u0060check_funcall\u0060 and \u0060monoruby/src/builtins/array.rs:2414\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfee3ead2229ba171a0ee07ab689a838784eb993ba5559f871b811655f4c7c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/enumerator.rs:383-392 | monoruby/src/builtins/enumerator.rs:572-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/enumerator.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e59b041c79e6a253638cf59dd08d72e489c041da82f1e49f2ed2a6e2db85991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/fiber.rs:491-501 | monoruby/src/builtins/thread.rs:339-349 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1891008669c73628adc400f11e6c6178ef6bdf9d8079443fdaf57d35905cb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): monoruby/src/builtins/file.rs:2460-2469 | monoruby/src/builtins/file.rs:2471-2478 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/file.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"430b7177c49caedc0af5e47be1a9b332a58c2788b9ae3b8d8c88644e4b05963b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/hash.rs:2395-2404 | monoruby/src/builtins/hash.rs:3976-3985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:2395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeaa4fc5171abfb322d601f1ff21432799fc8b3e0e21cc243a1632c0c764962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/io.rs:2769-2779 | monoruby/src/builtins/io.rs:6024-6034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c4c50163b2e3d86aab2922267cb556850b88f15dcb72e4ba73001a39041acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:464-473 | monoruby/src/builtins/io_buffer.rs:532-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/io_buffer.rs:474\u0060 calls \u0060Some\u0060 and \u0060monoruby/src/builtins/io_buffer.rs:542\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6424ed9ed914800277a9aa28641585abcddaf334eebcec483fd28c7bcf414a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/kernel.rs:5049-5058 | monoruby/src/builtins/method.rs:205-214 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/builtins/kernel.rs:5049\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5049}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51ab5907fab33b0c40202fb097c3f4030dc3058a071dcf0f4be9872930e7b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): monoruby/src/builtins/kernel.rs:5886-5892 | monoruby/src/builtins/module.rs:1939-1948 \u2014 before extracting anything, compare \u0060monoruby/src/builtins/kernel.rs\u0060 and \u0060monoruby/src/builtins/module.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:5886\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5886}}}],"partialFingerprints":{"codehealthFindingId/v1":"e114ea60163b148880890d8b20a2100c9b3097f5d2add40d3446a9e2f8ff4902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/method.rs:778-787 | monoruby/src/builtins/method.rs:799-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/method.rs:778\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba120a70ee90c7f1f26006247cd0f544769dd33181315b950b3f8002d99b0b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/numeric/complex.rs:342-351 | monoruby/src/executor/op/binary_ops.rs:53-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/complex.rs:342\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fdd5d074717d0d082add29edfb9c00c2356c0fd88a0f79ab9260f9ca373679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/numeric/float.rs:246-255 | monoruby/src/builtins/numeric/float.rs:272-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e1ad6267a11b407627978281ef67c113c0669a0c770d95c5986283990008f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): monoruby/src/builtins/string.rs:10745-10752 | monoruby/src/builtins/string.rs:11517-11526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:10745\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10745}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba073649516e13f4902fffe5211c3dee7ada61675dbafba4f799d8f682726a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:573-582 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:625-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 \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecd8c5ed02ef3a7d945a0658b75aba786bec32050042cb5b57bdf3111c67920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:415-424 | monoruby/src/codegen/jitgen/asmir.rs:4499-4508 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:415\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:414\u0060 calls \u0060push\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs:4498\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cac2f8364ccfe19f2f79d196ced3a78dbec604339760870ff4008f5f7ef19b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3648-3656 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3718-3727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3648\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"465559874da20aeedf54c82dffcad420047ab9e369b7c9e33634ccfa64e863d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/mod.rs:881-890 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:998-1007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs:881\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfbd68d2cbebe4878bf8774d41899ff1205f77859208c3da4ba00490cf546cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): monoruby/src/codegen/jitgen/context.rs:350-359 | monoruby/src/codegen/jitgen/context.rs:960-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/context.rs:350\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"95088ecce36c7ca9a811950310657953efa6521dda29339504f6ee67c36effaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/codegen/runtime.rs:2982-2991 | monoruby/src/executor.rs:3947-3956 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/runtime.rs:2982\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6591fed3fc41d755da9babf30af971aeeab84812d3dcfd991f07b44a1f62b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/executor.rs:4143-4152 | monoruby/src/executor.rs:4245-4254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor.rs:4143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":4143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13df18348316abd395d59eed94ae3584f1f411d9cbf3e8d36fdd994133992ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:343-352 | monoruby/src/parser/prism_backend.rs:430-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:343\u0060 it does not close everything it opens, so those exact 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":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e117694756424b636209fff383c4df8fed298359337b7bea938e8d40c2134bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/scheduler.rs:1608-1617 | monoruby/src/scheduler/native.rs:596-606 \u2014 before extracting anything, compare \u0060monoruby/src/scheduler.rs\u0060 and \u0060monoruby/src/scheduler/native.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/scheduler.rs:1608\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"666a66c2cabfb5651e6fbd4e5b673dc27b32e0ec737cb07d892d4bf5844cca16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): monoruby/src/value/rvalue.rs:1775-1782 | monoruby/src/value/rvalue.rs:1988-1997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue.rs:1775\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e9fd4b42be13e45a995dd6e7381ba3b1e725fd02c25cf47e7962cd5cecffc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): monoruby/src/builtins/set.rs:768-776 | monoruby/src/builtins/set.rs:795-803 | monoruby/src/builtins/set.rs:827-835 | monoruby/src/builtins/set.rs:859-867 \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 \u0060monoruby/src/builtins/set.rs:768\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c1d648e9bf8763bf1edda642124d35196dd4366bdf1d81c8df1eb3c8543847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): monoruby/src/builtins/file.rs:491-499 | monoruby/src/builtins/file.rs:962-970 | monoruby/src/builtins/file.rs:3046-3054 \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":"monoruby/src/builtins/file.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115792f28bef244df56e1189eeb06e10388ace2f0fc932e12da71439155a7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): monoruby/src/builtins/marshal.rs:2481-2489 | monoruby/src/builtins/marshal.rs:2585-2593 | monoruby/src/builtins/marshal.rs:2924-2932 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/marshal.rs:2481\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/marshal.rs:2922\u0060 calls \u0060push\u0060 and \u0060monoruby/src/builtins/marshal.rs:2583\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f211008a6ba56ad3370e14ab0734f85cc1b08998270dc6ee85eb980cbe7e5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:707-715 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:833-841 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1972-1980 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:707\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1982\u0060 calls \u0060get_current_address\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:716\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a9f5943573c8f357fc794ff1eb59d2004e1ee5acb5a8a870cf6c45810aa5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:1547-1555 | monoruby/src/parser/prism_backend.rs:1560-1568 | monoruby/src/parser/prism_backend.rs:1574-1582 \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":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d109b944365e48222e4c33f68c9c3a37e9d9f7731738fe9b2df0a360b2f1594a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/nokogiri/src/document.rs:125-133 | ext/nokogiri/src/document.rs:241-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/document.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0947b987986fafd6805e3ec12a3075c170eea68c4ae38650b60c98088bbdaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/nokogiri/src/node.rs:256-264 | ext/nokogiri/src/node.rs:281-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b798142ba7fc714c284d2a9dd4ad442f71d7ded90644ca82fb5e474eef1627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/file.rs:2210-2219 | monoruby/src/builtins/file.rs:2236-2245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf84c16b3f6f9a53914b2cf09eb1157b4d2b72895a52a44f8331cb7f593d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/hash.rs:1768-1778 | monoruby/src/builtins/hash.rs:1799-1807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5adcb1c278d5bd7729b0b74c2a02a6923c7e25d3876c5752149dc0e72b425a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/hash.rs:3033-3041 | monoruby/src/builtins/hash.rs:3299-3307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:3033\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"99657f01372652aa64936081bb98d9185d60744a6bb7188989187e194fac6682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/io.rs:2837-2845 | monoruby/src/builtins/io.rs:3025-3033 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:2837\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/io.rs:3024\u0060 calls \u0060get_block_data\u0060 and \u0060monoruby/src/builtins/io.rs:2836\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":"monoruby/src/builtins/io.rs"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5274b4d30c12ba17469c3ee7d9b0c60cedc7a49c818b0d510a73b3fe3e8881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/marshal.rs:2571-2579 | monoruby/src/builtins/marshal.rs:2906-2916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/marshal.rs:2906\u0060 it does not close everything it opens, so those exact 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":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4d55a8f061244a2427be3fa296dd9267bc736375e4259ca7779359026852d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): monoruby/src/builtins/numeric/complex.rs:613-621 | monoruby/src/builtins/numeric/complex.rs:945-952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/complex.rs:613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea23fec57e9644c6a59bdb68545c2dcd88829bae3a78877a4ca62aedb80ba8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): monoruby/src/builtins/numeric/integer.rs:618-626 | monoruby/src/builtins/numeric/integer.rs:702-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/integer.rs:618\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b762233e95b3add3f8f4e25010fc119eb38e57870f2af43bff29e39c1891182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/process.rs:1442-1450 | monoruby/src/builtins/process.rs:1473-1481 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/process.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c9886ec3668fcd12e27477ef5445e82c9e144dd14253e3980de2064094b692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/range.rs:730-738 | monoruby/src/builtins/range.rs:749-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/range.rs:730\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"3232d7056f51038b555eb0b18c47fde905695fc1ec84611e5537729318f2a0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/set.rs:920-928 | monoruby/src/builtins/set.rs:962-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:920\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"433fcda86558c50d1df295f9cd3878bdd39bfdb45a15c3b5316915c0a6b666a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/set.rs:1013-1021 | monoruby/src/builtins/set.rs:1117-1125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/set.rs:1126\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060, \u0060nil\u0060 and \u0060monoruby/src/builtins/set.rs:1022\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cb522dada76b08edec74b5f96ff0b698ac4fce8672bbbc220e805aa42aeea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/set.rs:1046-1054 | monoruby/src/builtins/set.rs:1081-1089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/set.rs:1090\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060, \u0060nil\u0060 and \u0060monoruby/src/builtins/set.rs:1055\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee855636b1c68758878651865a2281e883536df5f80ff49c9ed4eed220c08ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/string.rs:4775-4783 | monoruby/src/builtins/string.rs:4798-4806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7b8374f12cadb44283b20870d5f9cc8dd22e78cafe2d081d6332601c89b361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/string.rs:5947-5955 | monoruby/src/value/rvalue/regexp.rs:3193-3201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5947}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab67fa8624b58300ac2955a22e8eb1ff7e0e842f5e3bfc25b73fcbe7c9cbc654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/string.rs:7802-7810 | monoruby/src/builtins/string.rs:7831-7839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7802}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe116aa4de37971c1159e6aadac0c7ae82759e27a602b3383929462738e3fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:131-139 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:293-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f50c40eb992808233ee6f7386a0cae9117e48758436e7f0a00f49579e969b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1361-1369 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1410-1418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bb5d349f1ea1a8c2b9039f8c0a2d59eb52c38a0508917db999bf6f55917b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1100-1108 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3421-3429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:1100\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5578d83b0b329f024db9ada3b09ac2d36cbeaf795fb8f33c5f75925995352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2438-2446 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2452-2460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2451\u0060 calls \u0060a64_fpr_load\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2437\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6476ec72e72ad358cd7634adfbfa884f85c6be89767598051bc303c59f43f3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/invoker.rs:382-390 | monoruby/src/codegen/arch/x86_64/invoker.rs:413-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/invoker.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae760fff0ca48cb6bb62a26d31f157c7c85cd89c0e773b12ee1c961f7de1363f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:642-650 | monoruby/src/codegen/jitgen/compile/method_call.rs:2805-2811 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f2b81c89a3754a243606a6dbe6ce9bb379795bbce129f78aad6c2c7ac298f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/jitgen/trace_ir.rs:422-433 | monoruby/src/codegen/jitgen/trace_ir.rs:435-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/trace_ir.rs:422\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"bded10d9215b683a06033579633a3fee36ef7784eb7ed4a8911505d7ad783877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/globals/store.rs:1479-1488 | monoruby/src/globals/store/class.rs:309-317 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/store.rs:1479\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7d785d44f7bcdfb01dd6479fa617802db867257b3244098c78b739cf242d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/scheduler.rs:781-792 | monoruby/src/scheduler/native.rs:698-706 \u2014 before extracting anything, compare \u0060monoruby/src/scheduler.rs\u0060 and \u0060monoruby/src/scheduler/native.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/scheduler.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5505ca46750f842f2f1d9d661003c656b835b67eb00e41615d7b9a7b704008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:329-340 | monoruby/src/value/rvalue/io.rs:357-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/io.rs:329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/value/rvalue/io.rs:326\u0060 calls \u0060min\u0060 and \u0060monoruby/src/value/rvalue/io.rs:354\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbda7cddb42bbd084d4728c1b1c5390ebf43534a735f30e3bbc4574427d80f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:4799-4807 | monoruby/src/value/rvalue/string/transcode.rs:8575-8583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:4799\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4799}}}],"partialFingerprints":{"codehealthFindingId/v1":"31623cb3f076f09648de5cee0f730cfe93bed29d9fb069e01de0716e799cbe97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rubymap/src/map.rs:987-997 | rubymap/src/map.rs:1120-1130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map.rs:987\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5af8871c343bdd37f65c032b1df1c9360bb666be49a59d9ff86e2b6e7ddfe14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rubymap/src/map/core.rs:487-495 | rubymap/src/map/core.rs:706-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map/core.rs:487\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7123e0e36a45206b12ff0307fc94a0dfb78f08795ab0257768f4089f07eadc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3142-3149 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3229-3236 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3342-3349 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3583-3590 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4166-4173 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3341\u0060 calls \u0060a64_frame_load\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3228\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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1477f4aee3e6c3a74b24d1641e27c1dd50690080949865a363e533c97fe5ad93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): monoruby/src/builtins/set.rs:1010-1017 | monoruby/src/builtins/set.rs:1043-1050 | monoruby/src/builtins/set.rs:1078-1085 | monoruby/src/builtins/set.rs:1114-1121 \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 \u0060monoruby/src/builtins/set.rs:1010\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c081cfd043783dbd9bdc6cd749da1b468d962eee9c5222113575677c0aa5ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): monoruby/src/builtins/string.rs:4603-4610 | monoruby/src/builtins/string.rs:10742-10749 | monoruby/src/builtins/string.rs:11514-11521 | monoruby/src/builtins/string.rs:11635-11642 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/string.rs:11643\u0060 calls \u0060is_empty\u0060 and \u0060monoruby/src/builtins/string.rs:10751\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4603}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae4663e1a1fd7c38fc5ed51a5ee69f8c58f89eada0f30de3f9f42331fb715c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1667-1674 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1712-1719 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1754-1761 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1785-1792 \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 \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1667\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"1310bdad651f9f1bf4a3097ffd05646fd082e0eb9fee0f0d72fa632c386133f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): monoruby/src/builtins/hash.rs:3013-3020 | monoruby/src/builtins/hash.rs:3104-3111 | monoruby/src/builtins/hash.rs:3325-3332 \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":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf8e4322f5b56fd4b0dfb68af04fcd2e0005e371553e0a7eab3e3bb23ab05c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): monoruby/src/builtins/string.rs:12284-12291 | monoruby/src/value/rvalue/string.rs:2472-2479 | monoruby/src/value/rvalue/string.rs:4512-4519 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12284}}}],"partialFingerprints":{"codehealthFindingId/v1":"048416bf3da7cf9a4ac2a441449c2595e228bec5f70b7c2ab612c305026438be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): monoruby/src/codegen/jitgen/compile/binary_op.rs:1270-1277 | monoruby/src/codegen/jitgen/compile/binary_op.rs:1293-1300 | monoruby/src/codegen/jitgen/compile/binary_op.rs:1309-1316 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/binary_op.rs:1270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1f90d74370001e7e0045d1813b6d71af58269fc43ebaf4b4058bbae56c26e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:1423-1430 | monoruby/src/parser/prism_backend.rs:1435-1442 | monoruby/src/parser/prism_backend.rs:1447-1454 \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":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7202fbc7bec5fa364cac5dbe32f8ae6be9c97dc0452d85f8204028cdb487aae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ext/bcrypt/src/lib.rs:51-57 | ext/bcrypt/src/lib.rs:58-65 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/bcrypt/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1f26c77dfd8af6d86fb747985d3035ab41a01c7358f8fd0b104b05ebc286b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/nokogiri/src/document.rs:82-89 | ext/nokogiri/src/document.rs:203-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/document.rs:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11aa86f543dc5523c9e789357378229eaff6c9b90ba7d1c9fbba5f425b34b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/nokogiri/src/sax.rs:680-687 | ext/nokogiri/src/sax.rs:751-758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/sax.rs:680\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"82278d234b7f180a1436fe9e6218429f0f761ffa20f09c7ca7f83782ad4a17f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/nokogiri/src/xpath.rs:242-249 | ext/nokogiri/src/xpath.rs:435-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/xpath.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe4fe54b5373713d04f5eb36445eb4ee214f9668e8574bf01f36a91625eb313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/sqlite3/src/lib.rs:665-672 | ext/sqlite3/src/lib.rs:686-693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/sqlite3/src/lib.rs:665\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c9d563a04a354f9737a90bee7a573fa30ec8a301255f587d64b0d360c3e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/sqlite3/src/lib.rs:892-899 | ext/sqlite3/src/lib.rs:1751-1758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/sqlite3/src/lib.rs:1759\u0060 calls \u0060stmt_handle\u0060 and \u0060ext/sqlite3/src/lib.rs:900\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3097fae0a16bf5063df5f01a5624e3d26d7b8ee91e7f1da0f81b049353026d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/argf.rs:473-480 | monoruby/src/builtins/argf.rs:537-544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/argf.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd13f21ffb1403cbc85b8aa8abed0e2a003f1c6b054179795a31c89be305208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/array.rs:2851-2859 | monoruby/src/builtins/array.rs:2955-2963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:2851\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f542fcb85bbd974e62ec50680a1452952a1df6296b0a50237bc72cdff6f652a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/array.rs:3168-3177 | monoruby/src/builtins/array.rs:3280-3287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:3168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622618a990d8a48122150e5d5890d3a557713a86ce91b947a815fcdf0b0e084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/binding.rs:470-477 | monoruby/src/builtins/binding.rs:530-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/binding.rs:470\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8fdf44fa50ef3515e236972438b4703b7f8e1d3ec4353ab2f98fd84e4166d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/encoding.rs:1908-1915 | monoruby/src/builtins/encoding.rs:2120-2127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5e5b2735b759dbcf27448a9329d4130162f84d0eada4690802833806d5a84e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/encoding.rs:4654-4661 | monoruby/src/builtins/encoding.rs:5092-5099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/encoding.rs:4654\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bb24ce1da402d2295255b26d1936e2f75e2d2607f31b6fa9efac8b5206054e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/file.rs:2492-2499 | monoruby/src/builtins/file.rs:2563-2570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814665d1b8d796d0ff4f1dc4a80ed4e1b606e1083d6a931446a3cefe0de3cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/hash.rs:1200-1207 | monoruby/src/builtins/hash.rs:1269-1276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:1200\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad7f9714f9cd1fc3781be624fb593276131969ce23afd022f675c96f6453adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/hash.rs:1979-1986 | monoruby/src/codegen/runtime.rs:2743-2750 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f008ab144646fabdfa082498a6cbea7a128258d950ecffed0558698d9a25fbf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/hash.rs:2501-2509 | monoruby/src/builtins/hash.rs:2519-2527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b314942704c69c03807032c8a3b6e44a695fbaf6b8f59077b76f46be86ad95e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/io.rs:2973-2980 | monoruby/src/builtins/io.rs:6078-6085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb1a880547dc8a28bc6db33a1c4b361a8a80cec5d24571dc39bb61d766e59eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/process.rs:1857-1864 | monoruby/src/globals/gvar.rs:720-727 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3ed5eaf53d188db9be96342b00a910f6e6999ffe8bfb9f192cd5a170208513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/set.rs:939-946 | monoruby/src/builtins/set.rs:981-988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:939\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"48820dd3a629bd87fee88b55647041a0eea40c3327f818e3969c5f31a4549fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/string.rs:4806-4813 | monoruby/src/builtins/string.rs:4856-4863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:4806\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4806}}}],"partialFingerprints":{"codehealthFindingId/v1":"846270a10ec10c2237f541d1b00a7ba16605278ebd7554c9678abb05ee837c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/string.rs:5981-5988 | monoruby/src/value/rvalue/regexp.rs:3760-3767 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:5981\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5981}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c2e004905bddab9d788df25e84d22926f23e740fe896dc3595c991e5c04dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/string.rs:10873-10880 | monoruby/src/builtins/string.rs:10970-10977 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:10873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10873}}}],"partialFingerprints":{"codehealthFindingId/v1":"31efb87168bacc84129585750881a2808f0d55f64f7c42268d53283335c51abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/bytecodegen.rs:563-570 | monoruby/src/bytecodegen/expression.rs:488-495 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/bytecodegen/expression.rs:487\u0060 calls \u0060Symbol\u0060 and \u0060monoruby/src/bytecodegen.rs:562\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5277870ae34d6717481c6e38def0b8bcf14842a270e251ab71da57cd318e4eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:222-235 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:606-619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6860afc7b649fa0949aeae3143b560a8822d057dd7a6755b6973a765e45cd568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:691-698 | monoruby/src/codegen/jitgen.rs:2523-2530 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:699\u0060 calls \u0060a64\u0060 and \u0060monoruby/src/codegen/jitgen.rs:2531\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":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"35668ff4c97aa9a13b04df5ae001243acbc1b3010ee70e2f787c6f85c89f6e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:1072-1079 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:3164-3171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:1072\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3404369d6b50d08f269c3912a2ada30585c8adcc8dc8e17453a2df8d214141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2016-2023 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4253-4260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2016\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a0dcc3641da4d7ce3dc8ead7ff8bd8bc6db145293edce484e9e81a77a7ddd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2188-2195 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2201-2208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a150225cca3b038dba485f21c43e39620d71bb0c34f441b69f9be48230f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:735-742 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:917-924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"740ff4c70c9984ec006e953c8abbc1de6fbb1173d57561e72e108d9d2b1e0db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:731-738 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1053-1060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:731\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a57b1b66f3564719bd2a731646d84d143e8eb6436745b47754e7777455215f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/jitgen/slot_analysis.rs:607-614 | monoruby/src/codegen/jitgen/slot_analysis.rs:654-661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/slot_analysis.rs:607\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/slot_analysis.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fcf72e7743f26aba2014d8011b17d3f945d0d832fcfba563ac79ca3174f1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/jitgen/state/binop.rs:242-249 | monoruby/src/codegen/jitgen/state/binop.rs:649-656 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"62131ef5e6580abb8473be70e7c925af714fd0da59bde45add3539fbd31d8832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): monoruby/src/codegen/runtime.rs:1026-1031 | monoruby/src/codegen/runtime.rs:1051-1058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/runtime.rs:1026\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42caf4d0aee0e36b2954d221cb30e6b9446cacd15e53932d9cbd366f1c19272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/runtime.rs:2358-2366 | monoruby/src/codegen/runtime.rs:2409-2417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/runtime.rs:2358\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab5b7b910d98112e8fb5cc0b97b4740b3265ab4845b2c7b361c9543333ae116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/globals/store/class.rs:653-662 | monoruby/src/globals/store/class.rs:684-693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/store/class.rs:653\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffada3c9cfa61da7cc33b287cf440b88440f0bb190029440ad464da2ec5d79a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value.rs:373-380 | monoruby/src/value.rs:418-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfd777cd27ac775c0e8b29e7df35076e6a45549d3a56f0b145f878a25ae2a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): monoruby/src/value.rs:3742-3766 | monoruby/src/value.rs:3909-3931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value.rs:3742\u0060 it does not close everything it opens, so those exact 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":"monoruby/src/value.rs"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc61ade91853619e7a5a0b74deeb94abd0c1d75b08ca6969c3985de7de3603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:1767-1774 | monoruby/src/value/rvalue/io.rs:1787-1794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/io.rs:1767\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f23b36c27eae9c705cdfc8707e5e45c34e2120b85cbbedc19a915c0d1ba37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3104-3113 | monoruby/src/value/rvalue/regexp.rs:3336-3345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:3104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d371a7b5db7db8fe7724352d1a9955fa4cb2f1e321dfa788263ae2fee39f4cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3254-3261 | monoruby/src/value/rvalue/regexp.rs:3549-3556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"594e47d330e18aa2dd6d58a316936e377ff16941aabb2ed5535c2bab627d276b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3270-3278 | monoruby/src/value/rvalue/regexp.rs:3809-3816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb649e2b310f339ad8780b5f25799c7882c13de66fd2b6506698f3f9368efa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3749-3756 | monoruby/src/value/rvalue/regexp.rs:3818-3825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:3749\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f59c78ecffca3966c6646ad746ba363a5b9c94b9f442cc84c4518e4752ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:3521-3528 | monoruby/src/value/rvalue/string/transcode.rs:8155-8162 \u2014 before extracting anything, compare \u0060monoruby/src/value/rvalue/string.rs\u0060 and \u0060monoruby/src/value/rvalue/string/transcode.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e409404c4b2b7791ba73b66c5865b6ec855004956c3fc35e77db2a530c95834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:5779-5786 | monoruby/src/value/rvalue/string.rs:6360-6367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5779}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe989d831f2c43c6f3830514d1f5012dd18ae999ac04edec9ff907d0bf121b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:823-829 | monoruby/src/value/rvalue/string/pack.rs:836-843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:836\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:829\u0060 calls \u0060extend_from_slice\u0060, \u0060Err\u0060, \u0060argumenterr\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:843\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed73d5c3d8224fc3065eb361936fd56505480bf58dafd0856d867528e1a92a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:1240-1248 | monoruby/src/value/rvalue/string/pack.rs:1253-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:1240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:1238\u0060 calls \u0060unwrap_or\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:1250\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce344d138522f46ddd3077b010708c07aeef23e508574f124fb3cb07e291ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): monoruby/src/builtins/time.rs:1349-1355 | monoruby/src/builtins/time.rs:1356-1362 | monoruby/src/builtins/time.rs:1363-1369 | monoruby/src/builtins/time.rs:2698-2704 | monoruby/src/builtins/time.rs:2705-2711 | monoruby/src/builtins/time.rs:2712-2718 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/time.rs:1349\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a490a8ff2ff3b1f65fef6f4a6dcda1e65507290f78f2b1eb1f7c6c29cc29ea9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): monoruby/src/value/rvalue/string.rs:150-156 | monoruby/src/value/rvalue/string.rs:193-199 | monoruby/src/value/rvalue/string.rs:213-219 | monoruby/src/value/rvalue/string.rs:237-243 | monoruby/src/value/rvalue/string.rs:257-263 | monoruby/src/value/rvalue/string.rs:278-284 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c21f4663d46b4280b1cc3946a7b7126a84235eb481dba2f0095cb958796949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): monoruby/src/builtins/set.rs:1008-1014 | monoruby/src/builtins/set.rs:1041-1047 | monoruby/src/builtins/set.rs:1076-1082 | monoruby/src/builtins/set.rs:1112-1118 | monoruby/src/builtins/set.rs:1150-1156 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:1008\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"49927ef03750614d85a44858be24c7d505284b38b4b0972cf8fdb6eb87cfa008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): monoruby/src/builtins/set.rs:760-766 | monoruby/src/builtins/set.rs:787-793 | monoruby/src/builtins/set.rs:819-825 | monoruby/src/builtins/set.rs:851-857 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"475a91d26546af2634cfae923b914e2c72bfff55b2499fa0994a744ede5860c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:248-254 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:705-711 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:831-837 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1970-1976 \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 \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:248\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:246\u0060 calls \u0060as_ptr\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:827\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6d7c4e604f5b84ad0f133c4a290ebf399cffdf838242e8a3ab3d784398680e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): monoruby/src/parser/prism_backend.rs:2574-2580 | monoruby/src/parser/prism_backend.rs:2621-2627 | monoruby/src/parser/prism_backend.rs:3352-3358 | monoruby/src/parser/prism_backend.rs:3384-3390 \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 \u0060monoruby/src/parser/prism_backend.rs:2574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7489a5b3034b51f1d1792b95f06b709256a1683b188745b1c785d06fd47b3d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): monoruby/src/builtins/module.rs:627-635 | monoruby/src/builtins/module.rs:659-665 | monoruby/src/builtins/module.rs:687-693 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/module.rs:627\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/module.rs:637\u0060 calls \u0060define_attr_reader\u0060, \u0060temp_array_push\u0060, \u0060symbol\u0060 and \u0060monoruby/src/builtins/module.rs:695\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ab836bbaad30ef46dc95642ec6754aa3b888c3bd8530fdb0cd67c87377717a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): monoruby/src/builtins/regexp.rs:1249-1257 | monoruby/src/builtins/regexp.rs:1445-1452 | monoruby/src/builtins/regexp.rs:1764-1771 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/regexp.rs:1249\u0060 it does not close everything it opens, so those exact 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":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd523d6026ea29113c73eebe06adc11cb2b1a5b7c690f8ea724e8546859975bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): monoruby/src/builtins/time.rs:1097-1103 | monoruby/src/builtins/time.rs:1117-1123 | monoruby/src/builtins/time.rs:1137-1143 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/time.rs:1097\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd4bfdba9576318d0b6a96cfad5276ab386f25e85736a287ab13b718cc7466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:733-739 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:915-921 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:1055-1061 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:733\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a713a018900e9cbafa9984b63c3833748afdf2ed86cecbfd8c310666705e39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): monoruby/src/codegen/jitgen/compile/frameless_call.rs:780-786 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:940-946 | monoruby/src/codegen/jitgen/compile/method_call.rs:4014-4020 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8e7d28e6acf31b7539af903bdb6711311f39cfa88efdc374421f76d0b7b4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rubymap/src/map/core.rs:521-529 | rubymap/src/map/core.rs:566-574 | rubymap/src/map/core.rs:639-647 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map/core.rs:521\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4c25cd80c117604a3b2868394811315737a86872478598a323e7c68d0a7248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/nokogiri/src/sax.rs:714-720 | ext/nokogiri/src/sax.rs:733-739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/sax.rs:714\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62d35c6d926bcbb1a3f6ad024b4c49777cc50e7a71f7861d6db0920ead83c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/array.rs:2050-2056 | monoruby/src/builtins/array.rs:2062-2068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:2050\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"723839ed3f08aa53df14292953de852ded5113ed1f63c6c468ba7f44edaccc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/array.rs:2219-2225 | monoruby/src/builtins/array.rs:2244-2250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:2219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b877d3ba055ccc41f6bd1b995f50bc943defba15adca7974f112fab838a54224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/array.rs:3324-3330 | monoruby/src/builtins/array.rs:3464-3470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:3324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f51405d41300336d021a0fd94cebfec330bf7b72484d71d6452e64224d402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/binding.rs:177-183 | monoruby/src/builtins/binding.rs:206-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07b1fda8fd4fa17644591a7e2a6d8d48dadceb43a72ff7dd27e49e1cfec0d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/dir.rs:751-757 | monoruby/src/builtins/dir.rs:793-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/dir.rs:751\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb9cb073d52a6a223575f9c46472c3c74eaeeb568882f312a0ecf46fc7cb02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/file.rs:2503-2512 | monoruby/src/builtins/file.rs:2581-2590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/file.rs:2503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"4591f9bfe952c26aded43160bec8a78a0df78c60f6f200cc333def7958cac651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/hash.rs:2566-2574 | monoruby/src/builtins/hash.rs:2605-2613 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:2566\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2408d161e6574fb7bded48ab05a01f8a9042494931ea79447ab604dc412d0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/hash.rs:3448-3454 | monoruby/src/builtins/hash.rs:3499-3505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:3448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42bb786271e7842df5a301716ce6878779a78e814dc0b2205b81ac04a9d16b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/hash.rs:3497-3503 | monoruby/src/builtins/hash.rs:3591-3597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:3497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/hash.rs:3598\u0060 calls \u0060temp_push\u0060, \u0060hash\u0060, \u0060default\u0060 and \u0060monoruby/src/builtins/hash.rs:3504\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"924b4c86a99e3b979bd179dccd9cdfd4523f052cbd67f854f94eff1efdca8095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/io.rs:4982-4988 | monoruby/src/builtins/io.rs:5716-5727 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/io.rs"},"region":{"startLine":4982}}}],"partialFingerprints":{"codehealthFindingId/v1":"f292a6e2de11b6ca3a5ea8e8e0cb7405c37533a3e68b9521fd2dccebb2aa1ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:775-781 | monoruby/src/builtins/io_buffer.rs:1602-1608 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb06b20b56838c4c5aacd0e6fbe1cb87619c354437823e14777351a1b395b3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/kernel.rs:4076-4082 | monoruby/src/scheduler.rs:1720-1726 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:4076\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"daca56c7f3b10e1bfb1cc594d3171e03c1f6953eb0853dadda547cd71c61d5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/kernel.rs:5907-5914 | monoruby/src/builtins/module.rs:1967-1974 \u2014 before extracting anything, compare \u0060monoruby/src/builtins/kernel.rs\u0060 and \u0060monoruby/src/builtins/module.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:5907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":5907}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4700cacf58828a2d8781a9a03ed06394c7533265372bbf21748b73e9dc4065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/numeric/integer.rs:597-603 | monoruby/src/builtins/numeric/integer.rs:684-690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/numeric/integer.rs:597\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c13a09fb28fe0761496458b5d4234e9638538a42777444ae5e2a0e6200d2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/string.rs:5068-5083 | monoruby/src/builtins/string.rs:5695-5701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:5068\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9ab7bef7a166b3b39236ed67a99cc1019a727ab1730ce138031da5b4715479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/string.rs:10838-10844 | monoruby/src/builtins/string.rs:10935-10941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:10838\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34e86f9607718d47c3db830adebba637cf818c0b09db4be32a36201b2157f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/string.rs:10865-10871 | monoruby/src/builtins/string.rs:10962-10968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:10865\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4169c9351731b5dc4c77d84666ceb654e5924fa822bca0a566bb6d4769935eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/string.rs:11034-11040 | monoruby/src/builtins/string.rs:11062-11068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11034}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eab5c82e910210d6ec632fca81e33980286889ccdcc2b0b1428ead95f1e54da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/string.rs:12899-12905 | monoruby/src/value/rvalue/string.rs:3959-3965 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:12899\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12899}}}],"partialFingerprints":{"codehealthFindingId/v1":"a424f5836fbf0bb3c0f28b1a5e1adefc972cd4135d9551770a9b0b2294a3f545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/thread.rs:477-485 | monoruby/src/builtins/thread.rs:526-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/thread.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087cc99be2e2af91aee8d638e3b2bb225a5b1813c0b468b9eb9c495416016dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/time.rs:366-372 | monoruby/src/builtins/time.rs:760-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/time.rs:366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4c0c39c8fd7915a63114f79cd47e0382b0db5ad2dc2232b8fbbb9b59110fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): monoruby/src/builtins/time.rs:2357-2362 | monoruby/src/builtins/time.rs:2363-2369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b90099e3d3d5bef8b9a8fe063ad6b9db7055ec9687d8f00a790fafacb2eebd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/bytecodegen/expression.rs:1303-1309 | monoruby/src/bytecodegen/expression.rs:1381-1387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/expression.rs:1303\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b88bde98ba7cba118088eb768a2e65f4c571fe06856c8e8d05066350590d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:246-251 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1306-1312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad4eb7abeb7a0fd317ac817d5b049124afa4e433f64ae1e3a4507051327784b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:546-552 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:602-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:546\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1a860a30eea4f87acd83e7f34a24dee8ef291a204aa1c0c022d1380d1a4d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1309-1315 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1402-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1309\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9fba4db3364715f02f66d00bd5a0fff08b47df3af8432daaa45416ffdf3ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:379-385 | monoruby/src/codegen/jitgen/asmir.rs:4475-4481 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/jitgen/asmir.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcaef95a60d5de15429f2dac4266772ed6ed1d8216ba7da6e0cc84482e645c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2061-2067 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4249-4255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2061\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af996eda1b9a15ccf14fdf47656d8edeebb90c2fb5a8aec77619b4528f2c8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3681-3687 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2102-2107 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ecbab975c1994f4ae9c4470dc4b2873dfdababa2250bbca7add4f9b3596cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/mod.rs:2562-2568 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:2591-2597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs:2562\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"577a7b4365d877776b0fc4e8fc2a56b3f31915b707daca2a1a6623e69b101301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/jitgen/asmir/compile_shared.rs:516-522 | monoruby/src/codegen/jitgen/asmir/compile_shared.rs:533-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/asmir/compile_shared.rs:533\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c9c74e96c2f630cfbb99289ae9294638a6f70a1bfc1d6fff451533767beee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/binary_op.rs:746-754 | monoruby/src/codegen/jitgen/compile/binary_op.rs:846-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/binary_op.rs:746\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4a47fc64278569c5ec3e00a67a7906300b907acfbeb14894d5b29fbb9e8a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/ext.rs:1554-1560 | monoruby/src/ext.rs:1595-1601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/ext.rs:1554\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb4ed748e8299afad1feca50281c7b2510d285e2938398fcceca3bc3a29c3ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/globals.rs:1386-1394 | monoruby/src/globals.rs:1504-1512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ec325bade8bbb175644ca7cb6b432bf93b37f83963176c257633eeffbbf8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:1856-1862 | monoruby/src/parser/prism_backend.rs:4341-4347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:1856\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"38113d1f9dad3d6f7eea6f6808633e4b4e0523b5fa815e38332e4de6edb7836e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:2006-2012 | monoruby/src/parser/prism_backend.rs:4409-4415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:2006\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce64776786e3bc96a0b3d4e2c1ffce5027acbee6040cf01535130396b3c9b00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/scheduler.rs:1019-1025 | monoruby/src/scheduler.rs:1032-1038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/scheduler.rs:1019\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c84c8b3db71de4c0c9bbae7441e6f97d101647076cf6cfae44fb4b486a1357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/scheduler.rs:1385-1391 | monoruby/src/scheduler.rs:1402-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ffb6331c557b27709dd1e38bea8cace08161d9caccf7ba3dee544430b996b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/value/coerce.rs:414-420 | monoruby/src/value/coerce.rs:435-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/coerce.rs:414\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe42e12884e4bc3e431606fdf0ce576138fbd01b6ee7a0be0c8d189c43997f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/value/rvalue/hash.rs:1266-1272 | rubymap/src/map.rs:1712-1719 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/hash.rs:1266\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026Self\u0060 in one and \u0060\u0026RubyMap\u003CK, V, E, G, R\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28adf5f898cee6c8aa539cdd8e01685aec22320fcde4258be2e7614212df5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3963-3969 | monoruby/src/value/rvalue/regexp.rs:4069-4075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:3963\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3963}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8db761a07d4dedd0fb6e309304ee6b490ecd816e877e7503999c5f592e6a5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:6530-6535 | monoruby/src/value/rvalue/string/transcode.rs:7268-7274 \u2014 before extracting anything, compare \u0060monoruby/src/value/rvalue/string.rs\u0060 and \u0060monoruby/src/value/rvalue/string/transcode.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:6530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef73f59d002d877eecdb570c090039dc505761e0fb585224de5101f4c3ef6362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:203-208 | monoruby/src/value/rvalue/string/pack.rs:215-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:208\u0060 calls \u0060push\u0060, \u0060nil\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:221\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7ea095dc63c057d2f1816b123a4b3eadf945b24ecd2afad70780750421437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:269-274 | monoruby/src/value/rvalue/string/pack.rs:281-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:274\u0060 calls \u0060push\u0060, \u0060nil\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:287\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e0e3479658708e29623730f0abfde08f1825989f5b59d3d0e18eb9ec209b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:6059-6065 | monoruby/src/value/rvalue/string/transcode.rs:6948-6955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:6059\u0060 it does not close everything it opens, so those exact 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":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":6059}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bacc90cf42673f9a8c9a375019ad6995f70f6466e74363ee742bccd3aa7f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/value/rvalue/string/transcode.rs:6996-7003 | monoruby/src/value/rvalue/string/transcode.rs:7152-7158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/transcode.rs:6996\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":6996}}}],"partialFingerprints":{"codehealthFindingId/v1":"145dfc8fc2e8373f9d3bacb45c8ce11ba1cd39c2c876fa57759d30a72594d7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:247-252 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:704-709 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:830-835 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1308-1313 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1401-1406 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1969-1974 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:247\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:246\u0060 calls \u0060as_ptr\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:827\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"277f6fbd6164573c2a68c3b6c3b2b8130ddd49ff0e2159e5764ac4374ebc10af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1639-1646 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1696-1703 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1742-1749 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1772-1779 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2817-2824 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1639\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn a64_call_recompile( \u0026mut\u0060 in one and \u0060super) fn a64_call_recompile_with_recovery(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1325b028f39eb67cc82e56f9c66616700f9249a42128b2383c6a3a2bb5cbe9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:262-267 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:716-721 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:842-847 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1984-1989 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:260\u0060 calls \u0060get_current_address\u0060 and \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:715\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f721644f80888bba3697a5002892b837ab6ca656973e52888034a9be0177f4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): monoruby/src/builtins/binding.rs:176-181 | monoruby/src/builtins/binding.rs:205-210 | monoruby/src/builtins/binding.rs:251-256 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/binding.rs:257\u0060 calls \u0060arg\u0060 and \u0060monoruby/src/builtins/binding.rs:182\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"61744a07f0ea3bdffc119dab28e586504f54dc9b912fc943df934c41b6ae56e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1676-1681 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1763-1768 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1794-1799 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1676\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0fbebf52940110e4e8796c1326f736b0ca9ecba45035b2172d7e557126f020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): monoruby/src/codegen/jitgen/compile/escape.rs:1242-1250 | monoruby/src/codegen/jitgen/compile/escape.rs:1477-1482 | monoruby/src/codegen/jitgen/compile/escape.rs:1782-1787 \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":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"81aea346079283e5bd629b3830cb6ae17514584d065355fdb7bd2f4a7729f5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): monoruby/src/codegen/jitgen/context.rs:3606-3611 | monoruby/src/codegen/jitgen/context.rs:3642-3647 | monoruby/src/codegen/jitgen/context.rs:4276-4281 \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":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea916062a12c1b90eb83a3fd6b85512d63ac312aa84ccb8795cb468439335a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/sqlite3/src/lib.rs:1280-1285 | ext/sqlite3/src/lib.rs:1409-1414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/sqlite3/src/lib.rs:1407\u0060 calls \u0060aggregate_instance\u0060, \u0060temp_push\u0060 and \u0060ext/sqlite3/src/lib.rs:1279\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5074675b3a446602628bfefc21c7cea07dbaea4ba717d55b1ee09666fbdf2a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/zstd/src/lib.rs:333-339 | ext/zstd/src/lib.rs:370-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/zstd/src/lib.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63903e896da6042a878e52ca3dfdf45e20ee74d30324ba917ba5d4ea8f74538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/array.rs:2495-2500 | monoruby/src/builtins/array.rs:2521-2526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:2495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4721f94a2b69806e5e95944c5b498334e774bc7278a2ae1b1c738ce45f4ea4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/array.rs:3332-3337 | monoruby/src/builtins/array.rs:3472-3477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:3332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2ff8cda3d5f84f31af1480c6a6bfd7b7f1d3ee72cf7340d48533bba6963517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/encoding.rs:1207-1213 | monoruby/src/builtins/encoding.rs:1247-1253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/encoding.rs:1207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/encoding.rs:1244\u0060 calls \u0060Some\u0060, \u0060is_rstring_inner\u0060, \u0060replace_with_inner\u0060 and \u0060monoruby/src/builtins/encoding.rs:1206\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c6d656577ac91515acaaf94077cbbd8c3d6d5a835d8b1b9baa8299c5b5e922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): monoruby/src/builtins/hash.rs:455-459 | monoruby/src/builtins/hash.rs:469-474 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/hash.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef26b7ff22574292c5bca225d165f970fa31fdeceadd844c05fb0ba4dc81d34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/io.rs:5149-5156 | monoruby/src/builtins/io.rs:5213-5220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/io.rs:5160\u0060 calls \u0060self_val\u0060, \u0060as_io_inner\u0060, \u0060read_data_buffered\u0060 and \u0060monoruby/src/builtins/io.rs:5221\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6174e5493abb960b1303a0351dcb5756864a48ae74258bd1059760afed7252c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/io.rs:5715-5725 | monoruby/src/scheduler.rs:1620-1625 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:5715\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":5715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2907ce43b38fb675d4525ff0b4f55c7f2194362f7a70fcb95eb0f43dcf1c0325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:587-593 | monoruby/src/builtins/io_buffer.rs:691-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io_buffer.rs:587\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a826f550c1124178fb6452b0bf68551e7e86f27cc8e21e969940d02e258478cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:689-694 | monoruby/src/builtins/io_buffer.rs:1190-1195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io_buffer.rs:689\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a0942e4e11ba94c3d3886e2b4750387546326aaf7e38b6d88cac93357d2f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/marshal.rs:2599-2604 | monoruby/src/builtins/marshal.rs:2613-2619 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"177d56bd7b4eb5851a91e56f27b1a16cb1b579a5dc9113e85648609e1800d362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/method.rs:76-84 | monoruby/src/builtins/method.rs:115-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/method.rs:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dde2a4062ada046f9526a0277dadfee405952a7f79002e385caf6232b7afe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/regexp.rs:1409-1418 | monoruby/src/builtins/regexp.rs:1570-1575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22d91bb9d34158632da23ab9146f026e7c03cc93f97ae8e968cb8f57e64fceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/set.rs:1300-1305 | monoruby/src/builtins/set.rs:1350-1355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:1300\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd044475f2d9d9595676200719ecd667f03fdbf0795b82b85b2e7260bdb9975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/spawn.rs:840-845 | monoruby/src/builtins/spawn.rs:874-879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"3542b8112da524ca7fc93d969ddaecec20d864535ea3eea7221c5171ca93f894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/string.rs:558-564 | monoruby/src/builtins/string.rs:579-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/string.rs:578\u0060 calls \u0060guard_class\u0060 and \u0060monoruby/src/builtins/string.rs:557\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0981d14344cb775a73832461e6fa593c96937d821a3d5b6550969c6373aa5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/string.rs:5094-5099 | monoruby/src/builtins/string.rs:5712-5717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:5094\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"19504fbbb403c81417187e004c0599536f691305959e3179d7b2338aa86e538a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/string.rs:10831-10836 | monoruby/src/builtins/string.rs:10928-10933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:10831\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":10831}}}],"partialFingerprints":{"codehealthFindingId/v1":"e450d80b48d52f2a6c61a43275199bb24b2575a12fd02707e2e4457575322bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/bytecodegen/statement.rs:371-376 | monoruby/src/bytecodegen/statement.rs:397-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/statement.rs:371\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66208c7522065a8acc856b2cedee33a049c7e60a418c06721a43abb50c429d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen.rs:1453-1458 | monoruby/src/codegen.rs:1464-1469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9f4db049c3f37fc7d6cb219136759013a42c2aa3d76788f1b753488d1e9ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1169-1174 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:4248-4253 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1169\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2d31c41857871406599d5b4b859e65b99061318a6c753dffff483bb7c9941d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/mod.rs:856-861 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:938-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs:856\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf36f4918633ff3074da9d09139fcb96508cbef3c4552c5cfc95502cae9a772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): monoruby/src/codegen/compiler.rs:1198-1201 | monoruby/src/codegen/compiler.rs:1245-1250 | monoruby/src/codegen/compiler.rs:1309-1313 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/compiler.rs:1198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/compiler.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bfdf65ecc2faa9847c01ccfb4aa2a14f07c94f0a471a1ea942fbf574cc5e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/binary_op.rs:820-825 | monoruby/src/codegen/jitgen/compile/binary_op.rs:1094-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a15f5d5d783f4be299f404302f1714cb66a81e9bc0905a8e173f2a64c00239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/method_call.rs:1404-1409 | monoruby/src/codegen/jitgen/compile/method_call.rs:1481-1487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"964282578bf47c8796abff43c2fd5e5305ce34395b8acb8e2c407de1c86df4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/runtime/args.rs:356-361 | monoruby/src/codegen/runtime/args.rs:678-683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d1699b6b7bd9fa4e6d00628cbb7e675615eb0604f6dd818f643c4d632bdd5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/globals/error.rs:66-72 | monoruby/src/globals/error.rs:84-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/error.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f717672531ef7528f3ac7b71b9393d7066696157a826776337e4edca8d612288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/globals/error.rs:1633-1639 | monoruby/src/globals/error.rs:1644-1650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/error.rs:1633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb69fb7d154cbcf8857edeeea1965716f89ea29434cd27eff679d795ae87a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:2056-2061 | monoruby/src/parser/prism_backend.rs:2080-2085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e57dd94339eb1619cfaaa3350bd9ac15d2154ca7df90412f3b267094fa353b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:3019-3024 | monoruby/src/parser/prism_backend.rs:3145-3150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:3019\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8a2a708bafa00c965ceaa3094d0fa5d2380370e0dc0be2f300003c30418274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:5100-5105 | monoruby/src/parser/prism_backend.rs:5192-5197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:5100\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e33b763cf3f78800cbfad7241b6d426bea069c73ee48351da2ef3aca4b8ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:1778-1783 | monoruby/src/value/rvalue/io.rs:2158-2163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/io.rs:1778\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6499bd375f9796e00e2e2cbb59fca812c3fd46bb1c649b6d48678a722108e824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:244-249 | monoruby/src/value/rvalue/string/pack.rs:256-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:249\u0060 calls \u0060push\u0060, \u0060nil\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:262\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"391b6f7175634ecd7ae66ba4c867c61533cf9558441b439305285286c1ab4e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rubymap/src/map/core.rs:832-837 | rubymap/src/map/core.rs:905-910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map/core.rs:832\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c19e7c481f766f7276827f026def156953c6731590d4b1a217b0702e717cc0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): monoruby/src/codegen/arch/aarch64/codegen.rs:123-127 | monoruby/src/codegen/arch/aarch64/codegen.rs:176-180 | monoruby/src/codegen/arch/aarch64/codegen.rs:255-259 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1642-1646 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1699-1703 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1745-1749 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1775-1779 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2820-2824 \u2014 there are 8 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/codegen.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/codegen.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4746a3e7272d3f4485b377ac2ad2c69a17feac421623cc29cceebd75960bed7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): monoruby/src/codegen/arch/aarch64/codegen.rs:263-267 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1672-1676 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1717-1721 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1759-1763 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1790-1794 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2838-2842 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/codegen.rs:263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/codegen.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"229fe08b0d529f3836a7048b389bcd677c52eb0f3bf44937392a7a6a48643fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): monoruby/src/executor/op.rs:403-409 | monoruby/src/executor/op.rs:926-932 | monoruby/src/executor/op.rs:1214-1220 | monoruby/src/executor/op.rs:1283-1289 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d1fdbfd7aa501dc4d26653dc405898ac515eb4fcb3f818e0ddd74c93459c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rubymap/src/map/core.rs:487-491 | rubymap/src/map/core.rs:572-576 | rubymap/src/map/core.rs:645-649 | rubymap/src/map/core.rs:706-710 \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 \u0060rubymap/src/map/core.rs:487\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37cdfaf0a6dc98085ee9f2b36c629196b83a8a185f11f5f2234fcb4ffee2989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): monoruby/src/builtins/io_buffer.rs:775-779 | monoruby/src/builtins/io_buffer.rs:1138-1142 | monoruby/src/builtins/io_buffer.rs:1602-1606 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io_buffer.rs:775\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"a855767641068abb39cae56d1ee0a60d79960b9ab09304e697de287d0e69ab15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:220-225 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:548-553 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:604-609 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a663b0757ae8cd5b91950b9b46096c8c692b180c22ea49b0d7754995676a0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/markly/src/lib.rs:369-373 | ext/markly/src/lib.rs:382-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/markly/src/lib.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f4cf88a850d9e57b7cc7a639ba5a8bdba3572dca7569a372a93205bc21b743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): ext/nokogiri/src/document.rs:93-105 | ext/nokogiri/src/document.rs:214-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/document.rs:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a9e6b1f28a81eb6c751cd995abfd524a92808915befdcef3b5da69b1596a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/array.rs:3060-3064 | monoruby/src/builtins/array.rs:3328-3332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:3060\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/builtins/array.rs:3066\u0060 calls \u0060push\u0060 and \u0060monoruby/src/builtins/array.rs:3333\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a2e6df00b67abdd6405954446959960c88a2e8048fef8815c52622d0c45370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/array.rs:3731-3735 | monoruby/src/builtins/array.rs:5136-5140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:3731\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/builtins/array.rs:5135\u0060 calls \u0060Ok\u0060, \u0060nil\u0060 and \u0060monoruby/src/builtins/array.rs:3730\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25be11229fc56ab4394828bfae66e993d1de9bcb80a2017b8cc87f08756f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/dir.rs:206-211 | monoruby/src/builtins/dir.rs:1017-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a605f1bc341911adb56a11f5cb17c1ddb3c5b70be03761815e992ca0e0d8d841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/file.rs:723-728 | monoruby/src/builtins/io.rs:5426-5431 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/builtins/file.rs:723\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ba661050b7e2bdb5f872009e5005c4e7851b0c5afd80ef7a1e15e84f699f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/hash.rs:2799-2803 | monoruby/src/builtins/hash.rs:3597-3601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:2799\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2799}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc66d3973a471e49edf4be9ec3922e19a61b4a14373dd4e65823878cad122b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/hash.rs:3187-3191 | monoruby/src/builtins/hash.rs:3274-3278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6212368e09685ad33a13ebee49abfdffb4526ba6ff45ae045d5aa3cb2ded61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/kernel.rs:2961-2965 | monoruby/src/builtins/kernel.rs:3193-3197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/kernel.rs:2961\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b6e7dfaed6c93f5d8208fdd9db4812dc696be4f4829ce6b6976275108a2aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/marshal.rs:1315-1322 | monoruby/src/builtins/marshal.rs:1534-1538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/marshal.rs:1315\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbc3bcc85400b77c1416ded33df7fbf33966d4edf576556325f71b0f97ca0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/numeric/complex.rs:497-501 | monoruby/src/builtins/numeric/complex.rs:503-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/complex.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd42e9c4c6734b8ac192480a727e8e4d4739f915cdcfe27d6aaac819de25b916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/object.rs:476-482 | monoruby/src/builtins/symbol.rs:654-658 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/builtins/object.rs:476\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bd383d00b638a8d7605f4b86d664574623fe1458ad6716432e23a3ea6139ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/object_space.rs:679-685 | monoruby/src/builtins/object_space.rs:728-734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object_space.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"74523ca5d5706fbd2b7cf97f0821b45b745c3176c69ab435bf889b5baee1bd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/range.rs:673-677 | monoruby/src/builtins/range.rs:687-691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"809edd01bb3a9c898ba854695bbd733b802b34623af2b1f3c01e4dab26e5f7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/set.rs:1456-1461 | monoruby/src/builtins/set.rs:1489-1494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/set.rs:1456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/set.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dd85e5301089e5ee20cda597dbac6f0d604b0d34cfc8d5308ba3029ffee94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/string.rs:1270-1274 | monoruby/src/builtins/string.rs:1389-1393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:1270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a81471600cf8ab4be5dcd45985547d4474be2a059399c2c2a012b8d0dd1b05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/string.rs:4722-4730 | monoruby/src/builtins/string.rs:4749-4757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":4722}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4db7f2b4497aadf51e334dbaf4bbd69ad075fe88a1e4131c7b7935f80af83d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/string.rs:8067-8071 | monoruby/src/builtins/string.rs:8141-8148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":8067}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afe55b020f4c834bf2d1e76c49bcc3b495bdd318a2f2c327d19de1e1371b3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:292-296 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:340-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2314b4cd4c7b4294dcb4eae59a60a2d505ab25126c556da402928723f7fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:402-406 | monoruby/src/codegen/arch/aarch64/compile/mod.rs:2061-2065 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:402\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48564c282796020da878d8d89e59fb71426e89920e4f7d1ece86ead58f87f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:687-697 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:806-816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:687\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb5703914da2415a650b78913a9ec787759fd8ee4546f59ca7df25892a1cfa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1092-1097 | monoruby/src/codegen/arch/aarch64/compile/method_call.rs:1179-1183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5715cee3c5e87a6645c35a7b5a7e92a60a2802af16cd260442f5895b0eb9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3099-3104 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:1572-1577 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3097\u0060 calls \u0060a64\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs:1571\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"930af4d535038a71c7f0c4545fff22133d23cc7ff58ce21321e4bfbc10306e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/compile/method_call.rs:151-155 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:316-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/compile/method_call.rs:151\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"964af6d1092503ea281156550c4bb4d7017c9b834cc0a37828c5cc7f5ca0d881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:772-778 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:964-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/frameless_call.rs:772\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78052f2ba72241b3013b24ed130c4dc429288902d1c33569224909c9e8072e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): monoruby/src/codegen/runtime/args.rs:299-305 | monoruby/src/codegen/runtime/args.rs:620-627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"17166b868ebaff941e352c2d7b1f098acb0b34e55f60d0de6380949e8af56609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/globals/store/class.rs:1205-1209 | monoruby/src/globals/store/class.rs:1223-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/store/class.rs:1205\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"522762d6c71f1bf9eecc956045100dde71867fb87276b622e03bafef7e575ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:3878-3885 | monoruby/src/parser/prism_backend.rs:3944-3951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d205449a5553ad76fc25796554c716078552a7bca1345a7cea84354a9eee86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/value.rs:4145-4149 | monoruby/src/value.rs:4163-4167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value.rs:4145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"754fc79e1534ee4b474bc87195b6e991bda3ecaaa6f83c9e0bc07a293a179e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/value.rs:4154-4158 | monoruby/src/value.rs:4172-4176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value.rs:4154\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":4154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9808e03235339d691f6edc7db9bb9e4986f136384c529ad51258ae84542f3c60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/value/rvalue/fiber.rs:361-365 | monoruby/src/value/rvalue/fiber.rs:556-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/fiber.rs:361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060monoruby/src/value/rvalue/fiber.rs:367\u0060 calls \u0060set_error\u0060 and \u0060monoruby/src/value/rvalue/fiber.rs:562\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d639a3741315dcfdcab8520008d0c4f98304a1f84e52c21961734dc67b9024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/value/rvalue/io.rs:2754-2759 | monoruby/src/value/rvalue/io.rs:2766-2771 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"7440ae5db73b2f81ee5a3b3c36e7757f7b3de84fcf983ce78d4a0998c29ae4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/value/rvalue/rational.rs:680-685 | monoruby/src/value/rvalue/rational.rs:688-693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d276a013787bcc25a871395e6988be707a38dc13ba2d35eba75884da6b79210d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/value/rvalue/string.rs:3833-3839 | monoruby/src/value/rvalue/string.rs:3908-3914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string.rs:3833\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3833}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d7132ac48c3f204fa287a6a3df317767079196fd3c09490d0bc7fc0429b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/nokogiri/src/document.rs:308-312 | ext/nokogiri/src/node.rs:554-558 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6825766bcf0a25abf54bf4b880c9014730d9479b78a422cad93a03b6d5bce3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/nokogiri/src/html5.rs:467-474 | ext/nokogiri/src/xpath.rs:75-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d678afa865a79a852970435d2c3722fd1e85338b45ee59a1eaba1f3fa7ae758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): hashbrown/src/map.rs:2227-2232 | hashbrown/src/set.rs:1357-1362 | hashbrown/src/table.rs:1078-1083 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"hashbrown/src/map.rs"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c458d52e79dfe7dcebae39f4c8f1c5ed0d0944fd0f8c29443217cabeee1bf351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hashbrown/src/map.rs:2295-2300 | rubymap/src/map/core/entry.rs:310-315 \u2014 before extracting anything, compare \u0060hashbrown/src/map.rs\u0060 and \u0060rubymap/src/map/core/entry.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"338c872dae7165f56403292f30cc4d739d76d26371821cc717af6234cdb6cad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hashbrown/src/map.rs:2972-2980 | rubymap/src/map/core/entry.rs:55-63 \u2014 before extracting anything, compare \u0060hashbrown/src/map.rs\u0060 and \u0060rubymap/src/map/core/entry.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5e38589b4c22b094e949322fa935b9287bcca533836cd95d9dea031df34081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hashbrown/src/map.rs:3005-3010 | rubymap/src/map/core/entry.rs:69-74 \u2014 before extracting anything, compare \u0060hashbrown/src/map.rs\u0060 and \u0060rubymap/src/map/core/entry.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3005}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1a35fc9f8e1376c2b6829b53099ea5d84d44e6fc568e2ba827de6d7cbdb011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hashbrown/src/map.rs:3035-3040 | rubymap/src/map/core/entry.rs:83-88 \u2014 before extracting anything, compare \u0060hashbrown/src/map.rs\u0060 and \u0060rubymap/src/map/core/entry.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5112000d51aa0cb53bf54145517e11a0dca7b631f8096d8bdeefeb8f71be5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hashbrown/src/map.rs:3094-3099 | rubymap/src/map/core/entry.rs:110-115 \u2014 before extracting anything, compare \u0060hashbrown/src/map.rs\u0060 and \u0060rubymap/src/map/core/entry.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c7f447ae48661f87d1fbdb92b3bec89491cf148a70ce74e74e5fa3548ec752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hashbrown/src/map.rs:3125-3133 | hashbrown/src/table.rs:1263-1271 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a3c5fa35d7d5b75b5d734b041d847cc2c34819e4bfd8e1c23e078149c3e92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hashbrown/src/set.rs:755-765 | rubymap/src/set.rs:1072-1082 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/set.rs:1072\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026Self\u0060 in one and \u0060\u0026RubySet\u003CT, E, G, R, S\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ea7b7f0f6ddd3eb8b7a2d5342e6930ecf6955354270c6ca4bf16ae3fd2a88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): monoruby/src/basic_block.rs:79-84 | monoruby/src/bytecode.rs:78-83 | monoruby/src/executor.rs:6317-6322 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"monoruby/src/basic_block.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c6c20498f9a1e7481b320eb6837b6134e6d81be0b0b1cba43cf6f876176e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/hash.rs:2638-2643 | monoruby/src/builtins/set.rs:77-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/hash.rs:2638\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"5123c157c6f57d356f11407201e7c0d4f2cbed4c9dc148337da74a45770e2ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:18-23 | monoruby/src/fork.rs:267-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16603849efefad4185146eb4736d1eeb46af9ae4b203731e5c70df9e6ecc7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/kernel.rs:2394-2401 | monoruby/src/builtins/string.rs:13117-13124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"286513add00f48cf36b7d69689cdb4a3b4996ed3c9f96a504a80b3616b9a4202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): monoruby/src/builtins/regexp.rs:1510-1523 | monoruby/src/builtins/string.rs:1225-1238 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"808b06b35b014953cf4b4c9bb414d8727bbbbd3cc0c0bac49b49df000d457223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:48-53 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:492-497 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:48\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd969848b12e14c96847e4a7218d5584ca512c050f18ab0616a83860f73b6128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/method_call.rs:60-64 | monoruby/src/codegen/arch/x86_64/compile/method_call.rs:504-508 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/method_call.rs:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d60594d1ad6debaa1b4be201e32030ebfdcfe2ac77bbfd1a309f1e2cb907446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rubymap/src/map.rs:1410-1414 | rubymap/src/set.rs:891-895 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"898910e40de06d1d5c2f3e03de34ce328fd5d1e511e297d731510ac89fc90a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): ext/nokogiri/src/node.rs:561-565 | ext/nokogiri/src/node.rs:645-649 | ext/nokogiri/src/reader.rs:554-558 | ext/nokogiri/src/reader.rs:562-578 | ext/nokogiri/src/reader.rs:562-572 | ext/nokogiri/src/reader.rs:562-573 | ext/nokogiri/src/reader.rs:562-574 | ext/nokogiri/src/reader.rs:562-575 | ext/nokogiri/src/reader.rs:562-576 | ext/nokogiri/src/reader.rs:562-577 \u2014 there are 10 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/nokogiri/src/reader.rs:562\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":"ext/nokogiri/src/node.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e553806ae36baffad176f12b4202a5f7dc427e8486e20e09c708aa26a31aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ext/nokogiri/src/node.rs:608-612 | ext/nokogiri/src/reader.rs:581-587 | ext/nokogiri/src/reader.rs:590-596 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca278174fd0a60962edb113bf10e996871f4c009e579e99e960354d7b728995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): hashbrown/src/map.rs:2800-2806 | hashbrown/src/set.rs:1192-1198 | hashbrown/src/set.rs:1231-1237 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8872c1d7e61e9578f06fb62d0304c628c6ccbf558ebd967ab0139d39274c8e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): hashbrown/src/map.rs:3226-3231 | hashbrown/src/map.rs:3812-3817 | rubymap/src/map/core/entry.rs:135-140 \u2014 before extracting anything, compare \u0060hashbrown/src/map.rs\u0060 and \u0060rubymap/src/map/core/entry.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9e73318c8f139c44a6c8d93a0e79e66b54f995e444282434e4765a1f8eeaf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/hash.rs:619-624 | monoruby/src/builtins/kernel.rs:5651-5656 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/builtins/hash.rs:619\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ce352cefd0c90495334e7456cb7c16af4430760f10eed69df722fc9988c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/kernel.rs:560-568 | monoruby/src/builtins/string.rs:1041-1049 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060monoruby/src/builtins/kernel.rs:560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"611cec30aa4dc64f6221a56c1700943a42aa5ceafccea4ce260680ac9a4f4e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/numeric/float.rs:187-193 | monoruby/src/builtins/numeric/integer.rs:1035-1041 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d51fffc6f2d52a909d637c41150a4ee19eacc21c0a19ad79901c73fe941212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:2890-2900 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:1396-1406 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:2890\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2890}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea93db47410c63a876c4ca910f5fbc4f77a73cc50a6933c3e5d080b5bbd15036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3209-3216 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:1606-1613 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs:3209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbe8ff1ca3a90a9e2b20e92cf88ab79a152ed03ae8254302dd9e1b288228a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/builtins/string.rs:12389-12399 | monoruby/src/builtins/string.rs:12476-12488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/string.rs:12389\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1534c2bc87360b4b51a018fdcc699a9bc93440dec18a52a7deff78afda29f326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/frameless_call.rs:522-534 | monoruby/src/codegen/jitgen/compile/frameless_call.rs:567-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/jitgen/compile/frameless_call.rs:522\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/frameless_call.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"649dc0fb001eaa8845f4cda4c13e48262a31dda2d195cd3fcd6ae1058b315709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/module.rs:2337-2343 | monoruby/src/builtins/module.rs:2438-2449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea40d51d403aa14621248eaf85b082fe2a30df01732d466922ae5f1aae4ff9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/globals/store.rs:2749-2759 | monoruby/src/globals/store.rs:2769-2779 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/store.rs:2749\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92ba3e488a943dad692591234fa4db67953a3c41b15ee4f7ac74093a3dd7b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): monoruby/src/codegen/arch/x86_64/invoker.rs:335-345 | monoruby/src/codegen/arch/x86_64/invoker.rs:367-377 | monoruby/src/codegen/arch/x86_64/invoker.rs:447-457 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/invoker.rs:335\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cb63db69b44f4596791a0bfb05463655778ae0238efb1f34393cb8db89f58c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/invoker.rs:393-403 | monoruby/src/codegen/arch/x86_64/invoker.rs:423-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/invoker.rs:393\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"81222d491a9e5b8d4785816b47c74f695cb650ce00492d31462dd1127cff18dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/src/builtins/process.rs:572-581 | monoruby/src/builtins/process.rs:637-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/process.rs:572\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca450464fe52c92d5fcb41055150f9abaec20b9f72b59721894e44d5eb9ed37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/executor/format.rs:1093-1101 | monoruby/src/executor/format.rs:1177-1185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/format.rs:1093\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ee2773ba0f16e309150d42210f1ba3bfbf3221cb4a900b667f7a5791a3c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/codegen/arch/x86_64/invoker.rs:93-101 | monoruby/src/codegen/arch/x86_64/invoker.rs:122-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/codegen/arch/x86_64/invoker.rs:93\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/invoker.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabfc27eca58e4450cf208bb943b0184e91fc635749b65e9832313a339f86a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/zstd/src/lib.rs:419-427 | ext/zstd/src/lib.rs:465-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/zstd/src/lib.rs:419\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/zstd/src/lib.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"460807708bb91b5776a87788dd285a859098c97f4ccabe0e271d6d26c0ff8c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/json.rs:890-895 | monoruby/src/builtins/json.rs:921-929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/json.rs:890\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1cde44744f4a61dc9cebc46d5e7e963a7232d8843c843eca1946249592050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/builtins/io.rs:6810-6818 | monoruby/src/builtins/io.rs:6820-6828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c52228dbf1bb839de6134eed09c5e2651d4b0db4250605d60d9b2a41afe8907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/src/builtins/io_buffer.rs:999-1006 | monoruby/src/builtins/io_buffer.rs:1014-1021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io_buffer.rs:999\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"71517cce3cc5f57cfae959f7bc28b4d60fd8ef88ef685c403bc94a76d0bfc3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:1588-1594 | monoruby/src/parser/prism_backend.rs:1600-1606 | monoruby/src/parser/prism_backend.rs:1612-1618 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/parser/prism_backend.rs:1588\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b629a86142767a35e4691b9b619a5990dec699eed436292e6adfa5d265f1bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/time.rs:937-942 | monoruby/src/builtins/time.rs:1013-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/time.rs:1013\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6b7d687b272ebc64802b964da2c89e251c9e79c1b13930e1d5b0fc68ba1c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/nokogiri/src/dtd.rs:431-437 | ext/nokogiri/src/reader.rs:131-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/dtd.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bfe1af5e9b641838ec095ebfdca4f6ea4b02699925cd3b11e317c58077727a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/math.rs:165-171 | monoruby/src/builtins/math.rs:425-431 \u2014 both copies are in the same file, so extract the block 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":"monoruby/src/builtins/math.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4567bfaec69cd935a704c906fce93b2e7044474ad796b093e2e36fcec82dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/src/builtins/math.rs:278-284 | monoruby/src/builtins/math.rs:305-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab01f72d4cd705021e212a3a8df6750ea79feb3988c2357bd518783fe9c9ed67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/math.rs:332-337 | monoruby/src/builtins/math.rs:348-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3df640f8569faace2ddda51ea2b737561466f046b2d63b299bef3d815d8aa3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/executor/format.rs:1420-1424 | monoruby/src/executor/format.rs:1470-1475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/format.rs:1420\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"96188236b0fd9df7916c008ffd4a6c489d5e638a9bd5be80d5a87129e1fa2855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/io.rs:3700-3705 | monoruby/src/builtins/io.rs:3782-3787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:3700\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"063529c77780a8727602bf196f0afec2a90281d8607bd54af280d7a5e846c99d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): monoruby/src/globals/error.rs:1631-1635 | monoruby/src/globals/error.rs:1642-1646 | monoruby/src/globals/error.rs:1653-1657 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/globals/error.rs:1631\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/error.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9d1071ee71a3391e014f87e1796057a5f3382c1afb4321256229dfa447e30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/math.rs:251-255 | monoruby/src/builtins/math.rs:294-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/math.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dd53d0f8fe6139852878ff0d3a8f432adcf41c791319777b6ec7499e2a3edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/io.rs:2702-2706 | monoruby/src/builtins/io.rs:2713-2717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/io.rs:2702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cd76811a93400ed0955f410479b1957b305157b3bd0bc21409c0562b58eeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/math.rs:216-220 | monoruby/src/builtins/math.rs:297-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/math.rs:216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac797747589dc49c0a60f5ed27d6c6887ad6f429cd1db2fcece5d245a1e4399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): monoruby/src/parser/prism_backend.rs:3879-3883 | monoruby/src/parser/prism_backend.rs:3945-3949 | monoruby/src/parser/prism_backend.rs:4084-4088 \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":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"5012b1e7bde189f947d0e45b1e2305629095d8b07033b83f7a1015631f0acb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/array.rs:1542-1546 | monoruby/src/builtins/string.rs:8065-8069 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03665b6f257b9f1e75d45e5d123130985f71807cbd10e97d32e983680b9e8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/nokogiri/src/node.rs:706-710 | ext/nokogiri/src/node.rs:740-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"35212cd1b6b1365f81d77fcdc18a5c181872641e8eaeb93b918f30c4a052f967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/array.rs:536-540 | monoruby/src/builtins/array.rs:5126-5130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/builtins/array.rs:536\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dd19fabff9b23ddb248e3f041d72bcfccfd85293bc29932a59709ee3ab11b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/builtins/class.rs:73-77 | monoruby/src/codegen/jitgen/compile/method_call.rs:2458-2462 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/class.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3b582dd5d262e6686535799c97b7f555f3739756d0ced09a17a87d5e78cb85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): monoruby/src/builtins/io.rs:6732-6736 | monoruby/src/builtins/io.rs:6756-6760 | monoruby/src/builtins/io.rs:6780-6784 \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":"monoruby/src/builtins/io.rs"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"5495a431a37991dcb4b441f2c34d80b197aa8f0476effe9b3748dcb0be5b7543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/builtins/process.rs:2053-2058 | monoruby/src/builtins/process.rs:2070-2075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"17458cbf67d79a93956ff7ea31d1171a00bd97c720defb4057627a23ca0ab26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/bytecodegen/expression.rs:220-224 | monoruby/src/bytecodegen/expression.rs:613-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/bytecodegen/expression.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d24d0d5b62165a4d6f3eb256c481904dbbf646990a255f673fd271f6d561fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/bytecodegen/statement.rs:653-657 | monoruby/src/bytecodegen/statement.rs:713-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/bytecodegen/statement.rs:635\u0060 calls \u0060Some\u0060 and \u0060monoruby/src/bytecodegen/statement.rs:707\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e0d19ee28b209f0ce2f377afcfcfed0130a84f98b21380e67ccf4b9640aa9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/arch/aarch64/compile/mod.rs:3282-3286 | monoruby/src/codegen/arch/x86_64/compile/mod.rs:1662-1666 \u2014 before extracting anything, compare \u0060monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060 and \u0060monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0be65d4de44139226780f974612dd73113d6a0b3fba7c8d9c5951affcd0aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/codegen/jitgen/compile/escape.rs:1141-1145 | monoruby/src/codegen/jitgen/compile/escape.rs:1692-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0388c766c9ff6f77a59591afcd2cc3c9a388815ae68b8a0c8231a5e070b98dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/executor/op.rs:395-399 | monoruby/src/executor/op.rs:918-922 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf956e5dc1f65f05d8c4a1285d46c050a69fb409d88fdab482442ab1fe8d9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/src/executor/op.rs:1189-1197 | monoruby/src/executor/op.rs:1254-1262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/executor/op.rs:1189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e5b62a1d13636e0373ee1a35b9689f35f5117b0d22590b91426cb6b1eafee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/parser/prism_backend.rs:2327-2331 | monoruby/src/parser/prism_backend.rs:5752-5756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4a7b62a444faff1972cc842e2af2816ff6dbd89b399bb7a720a1f78e844bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): monoruby/src/value/rvalue/regexp.rs:3882-3887 | monoruby/src/value/rvalue/regexp.rs:4013-4018 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/regexp.rs:3882\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c4f519f84df1d3f623ca6e7e50abc3abfcd6d1ed40033f3352f0a11de5cfc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): monoruby/src/value/rvalue/string.rs:2504-2508 | monoruby/src/value/rvalue/string.rs:3762-3766 | monoruby/src/value/rvalue/string/transcode.rs:4148-4152 \u2014 before extracting anything, compare \u0060monoruby/src/value/rvalue/string.rs\u0060 and \u0060monoruby/src/value/rvalue/string/transcode.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c670924041e6d5103c9b3f7254f7a47be162e99c9d9ed1a61302ca7a545606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/src/value/rvalue/string/pack.rs:2217-2221 | monoruby/src/value/rvalue/string/pack.rs:2222-2226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/src/value/rvalue/string/pack.rs:2217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060monoruby/src/value/rvalue/string/pack.rs:2221\u0060 calls \u0060push\u0060 and \u0060monoruby/src/value/rvalue/string/pack.rs:2216\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c1bbb43df724746af114efabe0f9c55696e256b180c780387e6b088875dd4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rubymap/src/map/core.rs:480-484 | rubymap/src/map/core.rs:694-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rubymap/src/map/core.rs:480\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffcf3b174a776c828d9507d8dd01cc02f9cb0b1044947ba567f35b84380b8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): monoruby/builtins/array.rb:171-207 | monoruby/builtins/array.rb:331-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb416efead2808234153f2eef67bbc37d1752db34aa4f86a68cb9884a89673a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): monoruby/gem/json/common.rb:693-714 | monoruby/gem/json/common.rb:869-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/json/common.rb"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c763b5c55bb25c81e45d78a3d4d735c7bd562af30cafbc30f3698582b0ae18d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): monoruby/builtins/enumerator.rb:202-222 | monoruby/builtins/enumerator.rb:239-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerator.rb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f552b197b052c97fb9e5413e775f87c203b32a4f083e21ae9277e6a1b2d50bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): monoruby/gem/msgpack/msgpack.rb:253-272 | monoruby/gem/msgpack/msgpack.rb:284-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c0606daf041c8c87ee3d07949700be4a5824a62a1465e94eabeb1df6edfc29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): monoruby/builtins/enumerable.rb:912-927 | monoruby/builtins/enumerable.rb:1036-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c15fccb898471b166fe19c3001c9e31eda4baebc506ca865ea36093e4e2d716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): monoruby/builtins/numeric.rb:294-308 | monoruby/builtins/range.rb:791-800 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"917116ff03c7b12e197233961866eda29674ba108c0876f6ec04fbb572e225dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): monoruby/builtins/enumerable.rb:361-373 | monoruby/builtins/enumerable.rb:580-592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/enumerable.rb"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"661450f13028b93a65993b47059b6a1c53e358c430c3ed0ebcfc0d596bcadcfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): monoruby/gem/nokogiri/html5/document_fragment.rb:191-203 | monoruby/gem/nokogiri/xml/searchable.rb:211-221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/searchable.rb"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e11554da50acd64c4ae199822de3ba06a2591fdd135e9e79ecf440c84f0502"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): monoruby/gem/ffi_c.rb:1040-1051 | monoruby/gem/ffi_c.rb:1247-1257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/ffi_c.rb"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc198a69a8529c17f89d9bb8b4bcc6300116d5dd05c35ecb87c436964b48cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/gem/gosu.rb:1766-1777 | monoruby/gem/gosu.rb:1791-1802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"238990ccde6674e412868374425eba50096b879673dbf40a5e55c51c26ed9b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/builtins/array.rb:418-428 | monoruby/builtins/array.rb:442-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b12b28bc67531cbd2db11af5dd9348d4ac9d50533812932d7a2231b359b9993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/builtins/capi_config.rb:28-38 | monoruby/builtins/capi_config.rb:43-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"monoruby/builtins/capi_config.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faa886ba3ae6d6d2c770c877934c8548843a2366654896e2979c63339925629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): monoruby/builtins/enumerable.rb:375-385 | monoruby/builtins/enumerable.rb:594-604 \u2014 both copies are in the same file, so extract the block 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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c671f48d80deb6ed9350f7d5a9b55e1782804eb6f65066c123d209c5b50f277e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/builtins/data.rb:58-67 | monoruby/builtins/struct.rb:48-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/data.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d802800b531aa548145272e5c2c138c3b34fb8517a63083f4e820accad8a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): monoruby/gem/yajl/yajl.rb:637-645 | monoruby/gem/yajl/yajl.rb:658-666 | monoruby/gem/yajl/yajl.rb:683-691 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060monoruby/gem/yajl/yajl.rb:637\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a5cc75d915db7773e9cc0d7f94fb823f9326e4759c1d24d9fc37e31a026d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/builtins/numeric.rb:369-377 | monoruby/builtins/range.rb:965-973 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5327eacc83ee213e4f799925b690ec1d183c7345d244555120740b788e5a4d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/gem/yajl/yajl.rb:550-558 | monoruby/gem/yajl/yajl.rb:602-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/yajl/yajl.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92246c522314bebd271c6b715e6e2a3ed1674758a5cf9f236cd461298e3601b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): monoruby/builtins/array.rb:213-220 | monoruby/builtins/hash.rb:299-306 | monoruby/builtins/struct.rb:158-165 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d958ce33bb2054c6936d22af8c1f4bb7206210c5d70a8a9e93e5f4bfeb6b437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/builtins/array.rb:530-537 | monoruby/builtins/array.rb:541-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/array.rb"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd9b5190a7309f1f0b88f23ba4cdd3bf9a6d4d90a3462b8a2aa0a4ca12c46aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/builtins/error.rb:65-71 | monoruby/builtins/error.rb:83-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/error.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd10f830076a470143ece67e55a1b530aa74711dcb78485389f056e0f79b28cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): monoruby/builtins/method.rb:11-19 | monoruby/builtins/proc.rb:15-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/method.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf3ce5d97d4e80f5ffcf9d05f254eb10ea57836c61604cc12d877c5d80e5cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): monoruby/gem/gosu.rb:907-913 | monoruby/gem/gosu.rb:936-942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"06846f193a812a6d9c2c9f103a1808eafa35c66e865379e11bfb8dfc0b596919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): monoruby/gem/bigdecimal/math.rb:497-504 | monoruby/gem/bigdecimal/math.rb:525-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal/math.rb"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"da05da704faccf31cd1a36f61ff996dc70da098d94381df56c38ea11e193e315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): monoruby/gem/msgpack/msgpack.rb:841-850 | monoruby/gem/msgpack/msgpack.rb:854-863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/msgpack/msgpack.rb"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"870396a88d4bea66427f00a1ef999bc1b68ceb03a686ef8ee4f3e162f6cde1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): monoruby/gem/nokogiri/xml/node/save_options.rb:48-71 | monoruby/gem/nokogiri/xml/parse_options.rb:170-213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/node/save_options.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106819f48094cdc3666287738bf9450e3fdfd82e675029413ff623f41dd4d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): monoruby/gem/strptime/strptime.rb:68-79 | monoruby/gem/zstd-ruby/zstdruby.rb:107-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"69069bf8522078d78a5fdefc878d7df09b4bfbb49989212c63243dc8ad930db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): monoruby/gem/gosu.rb:1674-1678 | monoruby/gem/gosu.rb:1686-1690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/gosu.rb"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf77f300849963e968ee7a95ab8c2d90b2e5333cd3cccb30b924c92b3b4768d5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: host_ruby: host_ruby: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"018a64f79138bd0d48c4097fb8852b4b784b5dfd769e56fdcf08d1e762adc0e0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: libxml2-src: libxml2-src: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"842872111f917b7f988765de7a3993a1a0d8eeef2607dba32c6a988ef32c87cb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: monoruby-ext-sys: monoruby-ext-sys: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4a3736356eedb4f6130fd27736756a981a53ea0c37476b4a475e7821244faa45"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: monoruby-ext: monoruby-ext: abstractness 0.14, instability 0.13, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a2470c44eb48b19e4187f2b6a708a6327f5eaf393be3aad23d7d098653b56ef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Store (LCOM4 25): Store\u0027s methods fall into 25 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 25 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":"monoruby/src/globals/store.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b918f08ac2a0c0da1d015ba8dc3a75e986e5bba95ff04dde1094c48c4b2bd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Header (LCOM4 24): Header\u0027s methods fall into 24 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 24 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":"monoruby/src/globals/store/class_dispatch.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c218ca18d7b2d7efc2648893f3c6d2c97c8c3edad44c957b559bf6340a711"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClassInfoTable (LCOM4 16): ClassInfoTable\u0027s methods fall into 16 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 16 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":"monoruby/src/globals/store.rs"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af436d3c048c90bf951a1f3c54339e550fa1b357b8dd91235b017719e1d7cea"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Executor (LCOM4 8): Executor\u0027s methods fall into 8 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 8 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":"monoruby/src/executor.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56f5f42f6db6f8149109138715596c257051b4f9e0e7dd1353fdffe913b6a1d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Module (LCOM4 6): Module\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/module.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2604b0aa3febb5b95e701ef31067fa3060186c05b4648420cec9d86a9878e9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SourceInfo (LCOM4 5): SourceInfo\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":"monoruby/src/ast/source_info.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2873b1aceababf8edb221cd2b2d127bed6b0f37e48270a43bbe2a96f1421c476"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Globals (LCOM4 5): Globals\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":"monoruby/src/globals.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4216a92cd3d0b7b4979ecb38a2d2a6be8aa3ad6b26e2dfe2073e7b861d2c444"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Codegen (LCOM4 4): Codegen\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":"monoruby/src/codegen.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"12054c11ac783e3f66f501fb8662963e8826de5009c845343b99a72e869361ac"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Lfp (LCOM4 4): Lfp\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":"monoruby/src/executor/frame.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebab0a8155295da8bf07a7d87bac88b3632b1f866358afd03696cc37f82f607"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrayInner (LCOM4 4): ArrayInner\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":"monoruby/src/value/rvalue/array.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c19c99fac2be9a18e6211dc227e2409338ea9f61154029e08c5f4e8d19a2c2a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Immediate (LCOM4 4): Immediate\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":"monoruby/src/value.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b48b9e640b266273b600c9a2a035dab8f211ac82c1b86b894b02258a33fc1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/asmir/compile_shared.rs: monoruby/src/codegen/jitgen/asmir/compile_shared.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 209 in Codegen::compile_asmir at line 34. 2 of those changes were fix/bug commits, and the other 62 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/asmir/compile_shared.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"606b6d3ee5d325016c9a39f6b6a418e4a6fab4e3e31444612c932524bca4ac5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/compile.rs: monoruby/src/codegen/jitgen/compile.rs changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in JitContext::compile_instruction_inner at line 419. 9 of those changes were fix/bug commits, and the other 75 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/compile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ae766035feb9a7644aeb505ecbbfefc8a557c9c09ea003ae4f014d8071427c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/compile/method_call.rs: monoruby/src/codegen/jitgen/compile/method_call.rs changed 94 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in JitContext::compile_method_call at line 781. 10 of those changes were fix/bug commits, and the other 84 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/compile/method_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac2ceb15dfbadb2c63b8d85002271f6384d39d10a2a0d704a12585a686f1d4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value/rvalue/string.rs: monoruby/src/value/rvalue/string.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 197 in monoruby::value::rvalue::string::transcode_bytes_with_opts at line 5600. 8 of those changes were fix/bug commits, and the other 43 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value/rvalue/string.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2846050651ffa3df10efa6a27dbff58821f8fa478da32bb96e198253565786a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/arch/x86_64/compile/mod.rs: monoruby/src/codegen/arch/x86_64/compile/mod.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in Codegen::encode_linst at line 353. 3 of those changes were fix/bug commits, and the other 70 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/arch/x86_64/compile/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b5330f14b3696b1ced9f4e37948b8951c2095ee91a069e22008ac178f80ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/string.rs: monoruby/src/builtins/string.rs changed 85 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in monoruby::builtins::string::split at line 3331. 11 of those changes were fix/bug commits, and the other 74 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/string.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a0d38a7adffd6cfad47e89fc48b1ca3a09c7c973840b54b3ca778b711124c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/arch/aarch64/compile/mod.rs: monoruby/src/codegen/arch/aarch64/compile/mod.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in Codegen::encode_linst at line 1575. 1 of those changes was a fix/bug commit, and the other 69 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/arch/aarch64/compile/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"32078f1994c8e0f84beaf3c4ddaf87ec7211502f0c48ed24d832280b1e6d2499"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/encoding.rs: monoruby/src/builtins/encoding.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in monoruby::builtins::encoding::converter_primitive_convert at line 3264. 8 of those changes were fix/bug commits, and the other 64 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/encoding.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f37e92052d39b8e54581e1721c185d9e7ad9ca59ad2050ba918211b57c22b5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/state/slot.rs: monoruby/src/codegen/jitgen/state/slot.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in AbstractFrame::bridge at line 3428. 3 of those changes were fix/bug commits, and the other 60 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/state/slot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/slot.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1eb0304971acdba61ad055ac25e72d474ed7efd846c13b19ea9eda318f7b60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/bytecodegen/expression.rs: monoruby/src/bytecodegen/expression.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in BytecodeGen::gen_expr_inner at line 458. 1 of those changes was a fix/bug commit, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/bytecodegen/expression.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed54ea2ed1fc148a32ba814ae408f02782c70a6b1b3def0e1898c3981e8ffb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/parser/prism_backend.rs: monoruby/src/parser/prism_backend.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in Lowerer::lower_node at line 1105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/parser/prism_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b976aab6f1f165473c09c23728137f4196e07471b10e270f1fef01d3f2f57408"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/executor.rs: monoruby/src/executor.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Executor::take_ex_obj at line 2486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae8458293dd7f8ae7390d2b5a339a9491b7b0abfd02615921397d8787cbb8dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value.rs: monoruby/src/value.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Value::from_ast_inner at line 3729. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"53662a83f235b3b90436bde0f09cd89a3fd0b8771325879b37d7751940464c7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value/rvalue/regexp.rs: monoruby/src/value/rvalue/regexp.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Preprocess::unescape_nonascii at line 846. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value/rvalue/regexp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c48b509da315d02186fa384700e297a21279566a6feb234c4698ea173ba224"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen.rs: monoruby/src/codegen/jitgen.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Codegen::gen_machine_code_inner at line 1087. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76f7ad07baeba73085bf2723e5cf017b81055660b38e9b424b1943326fe95d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/asmir.rs: monoruby/src/codegen/jitgen/asmir.rs changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Codegen::gen_asm at line 4432. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/asmir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4247085cc4249ee907c7632623d6aaf057566cc9eadcf00bbd57835a6c3096"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/kernel.rs: monoruby/src/builtins/kernel.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in monoruby::builtins::kernel::system at line 3560. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/kernel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d63cdb7916bd06f942013184d18835af8d8c06ffc0270ec781338a373d0802d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/runtime.rs: monoruby/src/codegen/runtime.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in monoruby::codegen::runtime::expand_array at line 1696. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"9135f2312d26ac1ede61b35b95fcdc71ba272dc9c4095d02703d93f6f0a0d1d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/context.rs: monoruby/src/codegen/jitgen/context.rs changed 86 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in JitContext::resolve_dyn_var_offset_in at line 3425. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d743ee94202f63c58c8d7933f27e1b0a8c6036239c10e3b3433ce2787935782"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/io.rs: monoruby/src/builtins/io.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in monoruby::builtins::io::io_copy_stream at line 6806. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/io.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":6806}}}],"partialFingerprints":{"codehealthFindingId/v1":"5351963ffeef21371a322c146f19821075d5033de89850d369d988046fad91e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/marshal.rs: monoruby/src/builtins/marshal.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in monoruby::builtins::marshal::marshal_dump_value at line 2499. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/marshal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"717bdd10151246a1c9e499b2415d6845706be1455e4e0285ecd9243c4da843b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/trace_ir.rs: monoruby/src/codegen/jitgen/trace_ir.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in TraceIr::from_pc at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/trace_ir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/trace_ir.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9c90deffd6a527f695096c4180d7a98b4b91e8d995c5498261afb90226881e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value/rvalue/string/pack.rs: monoruby/src/value/rvalue/string/pack.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in monoruby::value::rvalue::string::pack::pack at line 731. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value/rvalue/string/pack.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"176f50dc679b7b28972b1dba4337d6b70bf35099ba942096b35de19828aa0f19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/globals/store.rs: monoruby/src/globals/store.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Store::describe_func at line 1561. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/globals/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51b583e584e336ebf7a357e0aed719191ab01d2314f23db9188c97b0cdd24fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/bytecodegen/encode.rs: monoruby/src/bytecodegen/encode.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in BytecodeGen::inst_to_bc at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/bytecodegen/encode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b385dbc8b882c09b643d6546997fb1be1303a07021b34631fb12e2183205ada"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/globals.rs: monoruby/src/globals.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Globals::new at line 792. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/globals.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9201b42e47052a25827afbf984491aa009f5da7079660a40eda07d1e53c820e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/compile/binary_op.rs: monoruby/src/codegen/jitgen/compile/binary_op.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in JitContext::compile_binary at line 880. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/compile/binary_op.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"561286f311c8a624b5a795715fe54e4a05460abfea09eb6ccf1d1a047f9b604c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/time.rs: monoruby/src/builtins/time.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in monoruby::builtins::time::directive_core at line 3518. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/time.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1187d1c7303a30074ea4305e5627b2b0627e23355b89296a498b377c8a912e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/spawn.rs: monoruby/src/builtins/spawn.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in monoruby::builtins::spawn::parse_exec_args at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/spawn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a009a5fd043c7be7586813838e0e44673fd13de1c8fc3ea368f425d801307d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/merge.rs: monoruby/src/codegen/jitgen/merge.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in JitContext::incoming_context at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"caef31e871dd03b3e2602230740bfd196d3d404103c248a4df0451ae8c067dd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/bytecodegen/method_call.rs: monoruby/src/bytecodegen/method_call.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in BytecodeGen::level_down at line 428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/bytecodegen/method_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7369fc3d8545024965e2dcd31c800ce345ef0e675ad930e4cfbf631732175ecf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/compile/escape.rs: monoruby/src/codegen/jitgen/compile/escape.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in JitContext::may_consume_virtual at line 758. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/compile/escape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4a2ad9fb09e4c79a10b1e4c29aa3ce1d125a07b367b8acef93ce43487c4ac1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/regexp.rs: monoruby/src/builtins/regexp.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in monoruby::builtins::regexp::regexp_union at line 735. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/regexp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6fc75092db0870a249fe9a6d06c3cf4aa76fc63fe6ca95f007592831a343f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/module.rs: monoruby/src/builtins/module.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in monoruby::builtins::module::constant_path_segments at line 1375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/module.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a116c9e4dd8788b026f6cd0d0d7eb81cb29f381532ad46c56aa4806e0ca34f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/compiler.rs: monoruby/src/codegen/compiler.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Codegen::compile at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/compiler.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/compiler.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0575bbd4168176a101d4b7e87494e8653ccea641b0bcd46340ebc07e227661"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/file.rs: monoruby/src/builtins/file.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in monoruby::builtins::file::open_impl at line 1302. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"402f36da878f3eeb0ef0c895381616758ddf68c41f5ac3e07c11c7dda77d3994"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/array.rs: monoruby/src/builtins/array.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in monoruby::builtins::array::index_assign at line 1490. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/array.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"580c9fe729f4d1183093367d5312d0b77bb3a6156df362215cb913e4e0412135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/hash.rs: monoruby/src/builtins/hash.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in monoruby::builtins::hash::hash_index at line 1141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/hash.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ae32b59b36041b15100d33373d636218d6d1d677ef0da17cef2f03a2b156c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/runtime/args.rs: monoruby/src/codegen/runtime/args.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in monoruby::codegen::runtime::args::set_callee_frame_arguments at line 807. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/runtime/args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5315df14648cd0fba08ed1b6597ca7e3971d21c261c3f8d2a92aa59963d4c792"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value/rvalue/io.rs: monoruby/src/value/rvalue/io.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in IoInner::getline_universal at line 2371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value/rvalue/io.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26889803cdc43a8d94026c0d73ff6175602a2da590950cbc1c67a2a31aa2a37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/executor/op.rs: monoruby/src/executor/op.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Executor::eq_values_pure at line 883. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/executor/op.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c7eb37c2cd0c427dd2ba427e80e2bed5f1ca466301f6d2ec5397f62ca0d53a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/globals/require.rs: monoruby/src/globals/require.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Globals::require_lib at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/globals/require.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/require.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"be986b03a0bd67da1b12921d05bebc99d3e3dd0aa4def94eca92980214b71607"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/bytecodegen.rs: monoruby/src/bytecodegen.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BytecodeGen::eval_lvalue at line 2115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/bytecodegen.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c43adb954ca6b9df25dc6df573c4b2fa5e13f4354f3285dd2e6c198e910506b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/alloc.rs: monoruby/src/alloc.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Allocator::gc at line 1731. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/alloc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb646540b69d8aed9dd8ed45297b1133381d4a76c968f726fa3ee71cf20c22d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/bytecodegen/defined.rs: monoruby/src/bytecodegen/defined.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in BytecodeGen::check_defined at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/bytecodegen/defined.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/defined.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6de820d56a2e6be68d9e48bb195a5165a96600192dab08de343eb1b92c6bb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/main.rs: monoruby/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in monoruby::main at line 614. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1233136f91952b35c6c913b5a80d2a7f6099f187c519ce9a54fe2d045c6f8eff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/string.rb: monoruby/builtins/string.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in String.upto at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/string.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":"monoruby/builtins/string.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e5acafca6dc27fa500587d3930f03d3734ad810ecff9dc24caf74c23ee162b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/state/join.rs: monoruby/src/codegen/jitgen/state/join.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AbstractFrame::decide_join at line 295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/state/join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/join.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d78a00a92347690b8fb09a302dd2e07a601492446157effb2b166007766bf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/compile/loop_analysis.rs: monoruby/src/codegen/jitgen/compile/loop_analysis.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in JitContext::region_summary at line 728. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/compile/loop_analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8176305522cb29d0c61d08056e8483b2a8a21ded6d740388fb7a1a69b8318fb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/range.rb: monoruby/builtins/range.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Range.each at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/range.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":"monoruby/builtins/range.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6923ea87473247eccd111ebf24344b5196f9bfeeb28af67d9b23c8ee013d40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/state/binop.rs: monoruby/src/codegen/jitgen/state/binop.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AbstractState::binop_integer_gp at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/state/binop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4449f6043ec908fb09dc7c4d766f51e476864fd45f4041d186ff535ccedc822d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/numeric.rb: monoruby/builtins/numeric.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in Numeric.step at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/numeric.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":"monoruby/builtins/numeric.rb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0df5f1863c88fc1d09c6b3c181c2f393bc1f6c8de3909771193304c582c393"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/prof.rs: monoruby/src/prof.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in monoruby::prof::report at line 2031. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/prof.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"363b1a6fe4cd605d3e09fa6fac3663eb79dc2292da692ff0afda5f1d3a909922"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/enumerable.rb: monoruby/builtins/enumerable.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Enumerable.minmax_by at line 992. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/enumerable.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":"monoruby/builtins/enumerable.rb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eccc47447c7d56568477fd78ee3270c9215a89f271df875b4489c9a4d912cb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/kernel.rb: monoruby/builtins/kernel.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Kernel.warn at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/kernel.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":"monoruby/builtins/kernel.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe6bf6eddbb10b9a1f260bff047f0f479efbd0f1f2d2e7086eb65fe0f33df54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/proc.rs: monoruby/src/builtins/proc.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in monoruby::builtins::proc::build_parameters at line 522. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/proc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b2d381720a61626b86a4f51970b5188a44a5f127cae0b369cf465544d1ec29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/bytecodegen/statement.rs: monoruby/src/bytecodegen/statement.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in BytecodeGen::gen_begin at line 435. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/bytecodegen/statement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8875b128c0381e0d8ae4d1dc248175407cb6ac44b34506c7d106699e56cb25ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value/coerce.rs: monoruby/src/value/coerce.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in monoruby::value::coerce::check_funcall_args at line 821. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value/coerce.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"655a4b5f30d03965af1ef27682952fc984662e2436bd1c7748001fa352b6d4bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/compile/pic.rs: monoruby/src/codegen/jitgen/compile/pic.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in JitContext::pic_groups at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/compile/pic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/pic.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeb0f78283b24fcf9c079b25017243d3862037f66247549df92a951e4c8806a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/executor/constants.rs: monoruby/src/executor/constants.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Executor::probe_constant at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/executor/constants.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2346458550a9a0a0e3f89c421b75ab9234c155ff339848e3f0dc52d02b6930d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jitgen/slot_analysis.rs: monoruby/src/codegen/jitgen/slot_analysis.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SlotAnalysis::new at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jitgen/slot_analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/slot_analysis.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d329e2a23dcabbb91e212c034de57e4fc7dcf71983bd1e5e54657c21931ee34b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/json.rs: monoruby/src/builtins/json.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Generator::object at line 2235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/json.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5560cb3c2822febdd84786edc0d14719d1e0c2faba804106e00b6f0b8bb78e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/builtins/arithmetic_sequence.rs: monoruby/src/builtins/arithmetic_sequence.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in monoruby::builtins::arithmetic_sequence::first at line 629. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/builtins/arithmetic_sequence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/arithmetic_sequence.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f1b241273bb7659953b6ed39e07760fbe265700576374c6addc248fdc64fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/codegen/jit_module.rs: monoruby/src/codegen/jit_module.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in monoruby::codegen::jit_module::handle_error at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/codegen/jit_module.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"601df71078e422a6eda6792128f24cf6da1588b9416530c25e1fad7a00bba78d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/array.rb: monoruby/builtins/array.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Array.permutation at line 374. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/array.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":"monoruby/builtins/array.rb"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ff1256e789dddd4010ddfa27e0cc6a6442dd96e099fcf386aab51a2757072"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/executor/op/binary_ops.rs: monoruby/src/executor/op/binary_ops.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in monoruby::executor::op::binary_ops::shr_values_raw at line 662. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/executor/op/binary_ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce8db3ace128c9a1230ce5ab03fabf25b87583ca728ecf376579aeb351dec1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/native_pool.rs: monoruby/src/native_pool.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in monoruby::native_pool::run_op at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/native_pool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/native_pool.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc42991f09fd0b09d878b8970001e2141e36f296e3dc2465753f99bcedfa916"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/exception.rb: monoruby/builtins/exception.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Exception.full_message at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/exception.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":"monoruby/builtins/exception.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8551c9eb02ef317ac218f6d70b8ebb4c8b636cedd0304ef2772a4c7ef1f14a5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/builtins/struct.rb: monoruby/builtins/struct.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Struct.dig at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/builtins/struct.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":"monoruby/builtins/struct.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ecd34ef2aa0f6c7c49f73486293797e73a629d58b4591a0ab9a16cef20023c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/nokogiri/src/html5.rs: ext/nokogiri/src/html5.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in nokogiri_native::html5::output_node at line 627. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- ext/nokogiri/src/html5.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec46328ff2aa1a31eccd9cfab44fb2cafe980ced09d62f51f054d3356145e7bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/psych/src/lib.rs: ext/psych/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in psych_native::yaml_parse at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- ext/psych/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/psych/src/lib.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebd7edac85fb6943e080e423440ca6ad240169a7dcb18ddc6250d7589ed9856"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: monoruby/src/value/rvalue/rational.rs: monoruby/src/value/rvalue/rational.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RationalInner::rational_round at line 556. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 12:40:57 \u002B09:00\u0027 --until=\u00272026-11-17 12:40:57 \u002B09:00\u0027 --full-history --no-merges -- monoruby/src/value/rvalue/rational.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/rational.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d6930a85e5dbba4025afc545a617203577a998aec9bbed85dbb2ca348e0a1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"57867322e92e50d2c1f11c8b64003d21edd390dc74cd9338127ecd1eba48aace"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42c2d4ea9ce2da7c66acdd53c17b73f70afc5b72c3f7f21fd17b5a581e7b193"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7259fe51b656fadfca39a9fdf5d5d91dff5174217cb35f6dab5066b2357a49d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2efa52f99626a6439ec847de5d25463b6bf3cdad0a0f4f9a01c42c61eacca4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"091206bc12a14085787e434b21730df087f6774b35db05ac71a06f3e023d0259"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0c6ba7532a0c8bfe909e3bbc91c3fe31efcc5926a5e678f80f31879124460e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1fa8fbaf8506d6eec7f1a002d12afa10cf4bcd2325eedb23327ede9102808"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b39bf9b3d0653473f7e7d2350642bdfade261a4ab7219c01d9550a973808e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we must name the unnamed class when the class object is assigned to constant later. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d259de05ce4b576867b83329b3bfc3f391a977dd03fd4caaaa78860591981fe6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this does not support nested fibers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec75111da0f91b7b933637d87f5679b3fbd0f87e3b0962574d55e0c88b2b231d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support rhs \u003C 0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11840aa509fceffdfa1b942fe59b3706a2e65d90a025efe9aaa6f8bf8c28409"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(aarch64): resolve_invalidated_outer (heap-promoted outer frames). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/invoker.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b2b4c50e832d25085edd9ac0f8393a1f6034f02c2969a42b6b5f58eabcf8cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(aarch64): resolve_invalidated_outer (heap-promoted outer frames). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/invoker.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f401e76602bc4d81769f924e3f1b8b774e9cb51ddbb97c1e8263cbf41837d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(aarch64): illegal_classid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/invoker.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc55a1df2c17b897d7c8a657a465c401a6f08588506cac05281e0634d7c673d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(aarch64): replace each caller with the real invoker. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/jit_module.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e0dc8347cde582151dcbf36bb28a448ac32201a011ffac80917cf2cf5bc8b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(aarch64): emit the real entry stubs (raise/fetch_and_dispatch/ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/jit_module.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"94be07b446c0e456f5edbf93838f27d7b407c1acc8b38fbc6b2255285888b1bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// (generic runtime fallback TODO). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/vmgen.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cc781666a844e0491c8c33ed0d91949dc3d4476965b87a2570306836a80361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// \u0060gen_vm_stub\u0060). TODO(aarch64): other FuncKinds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/wrapper.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0073535dc267bf2583dcfceccca4d47bd58aa175b7ddd13bb2d877cc97536b7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We must check this in parser \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bbc42906b7ae7f8a32993ec873c5a64509c4577b652c09650887eb3a562bd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: support ~USER \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a17a5d87e031af787047e9fd847baadd70025b2696d91369bc53d28badec0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support keyword arguments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ebc26714cd0e3c10cb2c8003ecb49960108193d3913a5d16418ca3970e12e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: we must support [] with \u003E2 args. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bab99b4a54f301e9ad849cedf5fcbd6766209c6799fb0906639082cd1531d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: support nil and \u0027 \u0027 for sep. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393bedc9337286951ed38fa9256b417f12a7a4a6cf0fd99e164cf0b711ca5cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: some methods (example: BigMath.exp) require more precision than specified to coerce. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/bigdecimal.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"441b346768c400bd69a0d77a7efc3cb0e0abf11c24337f6160b9e43fdd74e3a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Deprecate this method ahead of 2.0 and delete it in 2.0. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/css.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd98af3382afc2beb79a9cee6581f8aec10e448b742c39d28c1abd25823280a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should we instead check for respond_to?(:to_path) ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/document.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac290352be76e1daca5fd09b548f5dc008eaef9fe40be8800bc7284a9baa65b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this block when libxml2 \u003C 2.13 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/node.rb"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1379ee042fcb818e77d0164b26947984c6407c2f28fe81317beb38a799d88306"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate non-hash options, see 46c68ed 2009-06-20 for context \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/node.rb"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b791525090f58d6b318b51c41312bf5cbbd80e08bc6679c91e2df0dda87d0200"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO deprecate this method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/relax_ng.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f7b4dd2eb0bf6312f92bfaa9be62f3a5156b22c379c51e9796863550227ec7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO deprecate this method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/xml/schema.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05b21b305255e2a1df840f86a6d906563a303942778548f3eb9d208a248082c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace with Gumbo functionality \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/version/info.rb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"211a68ff396845ca34a335b5e1ad547e641dfed011667a0b4fd6d0f639788195"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this method should take a context node. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/nokogiri/html4/document_fragment.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ae191c2db12f634f6ebcd25e412ea94b23376c0b9e3efd5f5ee85908c8d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: extract :create_additions support to another gem for version 3.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/json/common.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a84397559ff24b8b1ef8f52678140d022900957b994f7c78a259e56855db827"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This isn\u0027t documented in Nutshell. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/monitor.rb"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2442f013df62c818c813518487e886514a4fbef81c9b18151f923a6cfbb2f8f0"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # xxx: Is File.join is appropriate to add separator? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/pathname_builtins.rb"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ba5d3988184e542616ba77fc13d5b83e86272281d2705eb13ca3c21c14b4f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: takes too long \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/tests/hasher.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adcdd217998b5375ca62fef3367aea868afeffadc2480f0e8b3fe69d051f662"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: takes too long \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/tests/set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892be5b622001515e2c6f0b3228e25673147cf8ca60a2cbfe1c583ddf3e3261"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: takes too long \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":4359}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f217810c7398414558738a384d793033c4bff5bc6b0ecbccb2233d842656d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Future Optimization (FIXME!) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdf714bab06f8495f838f3b5a1d26eb56e65268140a01d23f4a897eb4594e5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Branch prediction hint. This is currently only available on nightly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e3cc132e3fa99cabdd3b8b843ad0ab7fdd0bff21e2f56c4bee017b722c03e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use strict provenance functions once they are stable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/util.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d83ec66ae9848338dae62cfcc84058fec73cc86fe2431d02352db2aaf9600d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/rust-clippy/issues/3859"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/control/group/lsx.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0476d61711499a4dec7cbc9a5e6a08096b1e4a978969d39c9519465d73e5f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/rust-clippy/issues/3859"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/control/group/sse2.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6501f8286a17f9a2ff5556e296ac7d8fd90db219bdd9aaf1ba82c894f12aa2"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060monoruby/Cargo.toml\u0060 makes this repository a deployable product (line 15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/Cargo.toml"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"88348513b6d0c0f037d43ad2c89dffbb8318667166585b0888a1fba22141d446"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060monoruby\u0060 (396347 LoC, 1581 module-visible types across 80 directories) overshoots its size bounds. 1 of 18 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 8.9/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a2a4366d2946c717c4434ab21ba37ee383e525db23c17c71926182e37d5b3"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b6e8256a67029436026f8edb2ca474ffb3edad596e3566fe195ba186a34b2b2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f75a7065b47f421ed85981b5e29db0616fb0e28408d37ba40e36cebe2ec08bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3a0e3c90947ecec604f6835d6a462346d21b5ffff82f3aded779d923204cbc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eef9b105b1dc8adf120cb21b367df0df361d6bf1280f075a24e3ce205081e902"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"737caa037768d2fa52c1e025f89d565e2cd7c8010481e2bbefad6a8b73055798"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d9eaf0af6217acca969722e05a935a00f4281ac13238da79dbe7923ad377541"},"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":"efa7ec281b4f79cddf5932e096c875be24f6eb25ad981108f04b3e922a6ed8ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6266fb61f904e4965363b9f4b456516a2b5ae40b7053e2cb0fde5d0216d9a85"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54c6762f67f054806bd9bb0b548d39ab57ede4e82e6ee0a25ea6870f184dafe8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc08e97c9887f526187ae5a3ff7d73ca815a6022e741528d4d2c455ae406ab1d"},"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":"ed837f245719e63cf6fb6cca95a8a4712a37ee9f7938870e1a35ae544f8e92fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"333164c4a2f596ce52fb4dca5bef5ab5bd0d9e78a86c695034f7a9446184d00e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"125a3c9071cab32b8d2ad002a0aa4d3040e383c5e6adae2f71a0ff6abeb710db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30029a3da7cfdad1d077b068cd2dad15aa60d69e30dc6c89dbbe0647e5d7e5b8"},"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":"ce03a89fdf4c2e212dac6f8ea0c2281826511a510ecafe0d6405880440436435"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12957436e96eed580471e944957b076d284642347f89e369e1f1e67821710ab2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4192045b32020c78d8f6712353ffd7b22d3f6c08bd7662aab21d498352846261"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab3cc201292190cdfa0cf8b3374d21021c98da5230e1123bb5de4b4b1579fa55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7ee1f9a8123e37fd58333da134b655090c111609cea3184716d7a079b1564fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c630422572f92106b8782337b61686615da9cc97277a10c48ee725b2f3e2500f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f5c065c574bda0af1265df97711303085675a68ecd30a437b5071e8a0271c72"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48427b25aa8a230a0ca85f86c210a39ef12c8e40c2f186dc4dc944913ccb665a"},"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":"ef320f436148ab5cd80059c5dc2fa021327881c05255ed152d0d50080c769007"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc1eaef75ce507ab1fce3c71a5dd7b929e206d444c71a32f81569f798ac89d4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab44a6b3b806fbda7f94e963e2caee1322ad4923f42423a9d55beccee0c5b774"},"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":"24c63b0d075225eb89a7660e9b8baf5ea0efa9d32c651603a49a10d4ed4991da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39b9f6869e2455056d7cee7225d5f615deef9dc018ada49d543ab28dfec804a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c10030b14efa2f540c9498d4110156d49c2d60d0bdee39b7169e65d4f2aca1d1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9547ffe1fe450c6c27db818620d208444635fcb2b5e8020d78e0fe53a6e209e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c248d20899ac26a8a8f9aa46347d7acc29de41a0cdef098fa62261527d4b957e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92928b4ac93a9e33e967c71ea54cd8f6fc92693942ccc8a2c2c133efd41150d3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6f675b30725dc93c03e3f1c91b57f3fd74759406f52d4859ea2805670aec33c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f8e2bbffd43b7f60c28aeadd14caab05407def55b257f2f16b350f3b5f17e13"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c586ba926c9cd37323b039beb68c488079fdfd1627a74c535c4621f2838b8ec4"},"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":"aee3b21ec83c2f3a21f28727892f858f156e5113a09f4da77caac9939e09dbf0"},"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":"8f4f1cb653f629abd8fc6039b567aa6a298ab88b0d9e7ad44f10b9ef1410e492"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"573b6e61c9934278c244b3642f9749c0bcd626d78f5496b483ba48468b88a7ab"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89bb37b903bc30f61450a2205ec954e925681e960fc56e28dec9f39c9a5a6c25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25de043e8153fdbeca6947fa331397b76c592555894f24460ff7725969ec405c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcfadbdbfb93d405bae15569019fa0c22435a0e2641c75af84494862ddbebdb9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d131c32785c6d67895c6817bf9921917ceefb33faf83aef2f41038eb6e979d92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40cef9054b33ed8961145266b15687032ddf78b632171b41416bc7f60b34ea37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34508a86283bbe4b7eeb4827b607ec9a0728f4902d4d622dde1eef9b44ac20d2"},"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":"c4126ceebf954c37846791e501bff714a8d2546dac2572529083cb143009a55f"},"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":"bd04911aef2a72ed2f59319017ff286dc560f42a300c0fdc55732c50e3b98dab"},"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":"7ae7608ac207cd90a09f50682c2aea7f091be940dee326ecde204f9917b698b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"accce03b6af059161690e7941eb2352b6aaa9b2f109bda79aaf479a52d4b17d1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e912f43e3430839b1cf182589c5a18efa1b4e20778be37ac8bed96c4aa89803"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b40bfb5829c3ad0ac545df06fa369d532847dd70f39515772fb463bc565cb80e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e1d3aed0d86beef622d7015473a888fed00c867599aa68c46d9b26894072084"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d9315dea558b492f89123c5d9da2c86a3c4889c7a47373ca34185ca946208e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7dcfc90899059a2d594a3953672bd3973ffa659b048e14860e1e371cdddfeee4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1ef0091cd5d15507f0f6bc94865c7699182d3f3047ac2f249eb474949e6e5ae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f59efa3eea1c27a966a599b8adfa41f210a6964119ded7d9e9c34b2828cd2ff0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf3c95cdc75bd5a2be0693404f984721242d37d051ac0496622720e5026bb709"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ff0f2e0ebedb3e65aaa91a385c4e7e97c64d35559ebdb7b5b1fe216b37e9918"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e73cdb5f438133cef4721b481f7f8e4750f83bd1ed494db9ad010277fb472da3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"640f0f289499378f765cd52ab5ec211c2097ebfc2e33d4f989e8263d1d632c11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80b30f1cd2d62eb8febf9e347757a992a5af427c34499f73623cde9662e20265"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7694ef690b55cf9baebcba32a301e66e3288906e937afbd008ad5a6b9f8c0e13"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68be86e6c3ab6c3200951b1985c6dba7552fbec0e67e159664d1ed414ad1c85f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"054fa4507ec8ece73d77808ff57978cdb88f612be5c2bac0e0c8da4792f3e900"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5492d0dcfcde9c80441b3cd7ba1d22fd692b3111145c27703a5d88a8b914b50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab5e98f2eb8b79ff4560cd48793645bad0c8ead85b6fbfab1501e3a61752d8b0"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19434ea69535096d33c3289962d5c3dbc06fe3183dde47249a9b687b54a4d734"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64921c36f78bb112d9c99be3561e46ca1f643edc1013c182effbe16671f5fd7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"fd45cdaeef79b98694e8571e8fcc16a8cf4be0cb822f28c36ffcd31aeca2b06b"},"taxa":[{"id":"CWE-1333","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":"5f431648d74032cd8596dcdae9ab5bb5d3ab5e6e3d6dc996cef901abbc4b623c"},"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":"cf8c7f82bf501e5e805c326b1cc0e18bef05ffdec88f89c50220ede378582318"},"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":"99baa210d4d25f2a4570704e67ae6147a45bf6c7f60dc9b95b72a06e6f3c9cfa"},"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":"a0dd9627739800ab7f41a8971b04b9ba555b458a41c6c6f171372b113243cd31"},"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":"0bc9db506a37070bb3d0dd923c9cd2588d6bb20e54a40811ffda0a660b706337"},"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":"026980fd6c8a8313bb9bd8f08a2c2cb26246fc02df676dcb6c7c1305b921dce6"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b44db661135c720dcc748c72124e6f087333bf158c68aa6a9edbc48f0c64a797"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2781699ac00e10a60f22fb9abd93a7f727035119e25152ed27dd503237c2055"},"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":"18956201d860666a334179d60572aaa422812a37280fd4efabc39c248b167d57"},"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":"9e1f64e7620546ba5ee373cfa8849ba995bf8eae1e66c56560694bd22351adc2"},"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":"3bf7124090960c2316c0d9e857eb06dd12714838bd0ac0dc821956d8ae8f1fc8"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ce016a6afc947537e57598772ebd1aa3c8dfb61ed3cda7bd00af5ee8dfa8512"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9009365e40774e07bff66827e5c89228e149c97b935da606c39dcfa6d3f4e096"},"properties":{"dependency":{"package":"mio","version":"0.8.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2024-0019"],"severity":"high","fixedVersion":"0.8.11","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16cf4021024fde6a7e0adf07898b66363ea61120e269970ac69dff0889b06fbd"},"properties":{"dependency":{"package":"openssl","version":"0.10.52","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2023-0044","RUSTSEC-2023-0072","RUSTSEC-2024-0357","RUSTSEC-2025-0004","RUSTSEC-2025-0022","RUSTSEC-2026-0463","RUSTSEC-2026-0473","RUSTSEC-2026-0474","RUSTSEC-2026-0475","RUSTSEC-2026-0476","RUSTSEC-2026-0477","RUSTSEC-2026-0478","RUSTSEC-2026-0479"],"severity":"high","fixedVersion":"0.10.78","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a42ca7416279f52063a649dbc505340ffc7c7a5727193e601ae1de8d6db75e3d"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","severity":"medium","relation":"direct","declaredRange":"0.2.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.31","relation":"direct","declaredRange":"1.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"direct","declaredRange":"1.0.15","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"medium","fixedVersion":"8.2.0","relation":"direct","declaredRange":"8.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.1.0\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","severity":"medium","fixedVersion":"2.1.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fae600154bad3f08411deac0c335601753b8e6bc1360875ae80df276bf3dce1"},"properties":{"dependency":{"package":"anstream","version":"0.3.2","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0404"],"severity":"medium","fixedVersion":"0.6.8","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad7f11b47025b3276d0235a99bd0bab08ecbc32c7cf78df7ffe5a05f8fe90af7"},"properties":{"dependency":{"package":"atty","version":"0.2.14","advisory":"RUSTSEC-2024-0375","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14bd5501110f338f8788c7057df8555eb4ab953e362c0820bd1dde8f894706bc"},"properties":{"dependency":{"package":"atty","version":"0.2.14","advisory":"RUSTSEC-2021-0145","aliases":["[GHSA redacted]"],"severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b32322e956b8defe81d33870c5eefe45a576546d66261b4fee20c22d565cff7"},"properties":{"dependency":{"package":"bytes","version":"1.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"severity":"medium","fixedVersion":"1.11.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbeb6d9c6f09fc9b72d85e490d48cf1c34379b792c8edb0f106377c6e4bd024e"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","severity":"medium","relation":"direct","declaredRange":"0.2.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e5208c85bba091100c2e4c79e498bc2646e4c1a51707d5dc1eb0cb6c106f29d"},"properties":{"dependency":{"package":"h2","version":"0.3.19","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2024-0003","RUSTSEC-2024-0332","RUSTSEC-2026-0258"],"severity":"medium","fixedVersion":"0.3.24","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51d61741367e5fa1d988c14b1e8a8c215c5598f59a8780ef51d64a38a6261125"},"properties":{"dependency":{"package":"idna","version":"0.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2024-0421"],"severity":"medium","fixedVersion":"1.0.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4b437e62784e6d1a14dd009d0933412350f534547ce54bb7fa869cc48528f37"},"properties":{"dependency":{"package":"instant","version":"0.1.12","advisory":"RUSTSEC-2024-0384","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b35a07d53167c2202def9ca3ff71c6abec93ce2c1b73c6e78ef5adcee29a5512"},"properties":{"dependency":{"package":"mach","version":"0.3.2","advisory":"RUSTSEC-2020-0168","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17e6655315587c185c35b91326547df9f4a19b82cfe844b26e5dc597d351ee2b"},"properties":{"dependency":{"package":"paste","version":"1.0.12","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"direct","declaredRange":"1.0.15","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a611fb2660afbc36dfb85f3900091ad5f09287e0d0c313a4bb9356aa2eb483f"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"465fc84fca5eb1211f925376609a096c2e4a3f585bf90eb3d8203bf286ceb619"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce6a12a619eb12e1b1afae7b46e1665120a0e4f1a10b5f1833df8347f4b107d5"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.8.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69e7b52e883c63ba5a32455e73969a036cf46a4ff81b9568e45bc5dc5e0ec11b"},"properties":{"dependency":{"package":"rustix","version":"0.37.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.37.25","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42afc4c1e213f35ae37374f9fd66061e159850dfe877d9d9903f1191ddff70e4"},"properties":{"dependency":{"package":"time","version":"0.1.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2020-0071"],"severity":"medium","fixedVersion":"0.2.23","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43c522d3cbfdcbec161a72eb222466720163447c89543de3805da3906b6cdd31"},"properties":{"dependency":{"package":"tokio","version":"1.28.1","advisory":"RUSTSEC-2025-0023","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.38.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"179a18d9a3ae83685982f0e14c3fa362d9411a6b4a0d483898c1e826e98ca230"},"properties":{"dependency":{"package":"tokio","version":"1.28.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.51.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hash.rs \u2194 core.rs: \u0060monoruby/src/value/rvalue/hash.rs\u0060 (context monoruby) and \u0060rubymap/src/map/core.rs\u0060 (context rubymap) sit in DIFFERENT parts of the tree yet change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060d09591c1\u0060 Hash: consult eql? only after a full stored-hash match (#1284); \u0060adca54ed\u0060 Emit the Hash#[] probe as machine code for String keys and the indexe\u2026; \u00602875cde7\u0060 Emit the Hash#[] probe as machine code for Symbol keys in a linear ma\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa487a5060b84214ac76a1c83ee817fb33dc2d66c605223584c0663a7975faa7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: method.rs \u2194 method.rs: \u0060monoruby/src/builtins/method.rs\u0060 and \u0060monoruby/src/value/rvalue/method.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00600cf74987\u0060 Call a Method object\u0027s target directly from JIT code (#1335); \u0060064d9f04\u0060 Make core/method and core/unboundmethod ruby/spec fully green (#521); \u0060efb8c79c\u0060 method: support Method/UnboundMethod objects from respond_to_missing?\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a6aa15a5bb1ba7a077e91d680d14ebb61550c8fd3e0072f0505c28a6dbc3a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 complex.rs: \u0060monoruby/src/tests.rs\u0060 and \u0060monoruby/src/value/rvalue/complex.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060082afc31\u0060 Improve Errno handling, implement new methods, fix coerce protocol (#\u2026; \u00609296fce1\u0060 Refactor.; \u0060eabbd4ed\u0060 Refactor. (#57) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"110f96f4a88fc8af68a10a028a489eb8b69159cae1442b392cfb8c6e1ee80d84"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: inline.rs \u2194 globals.rs: \u0060monoruby/src/executor/inline.rs\u0060 and \u0060monoruby/src/globals.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00604a974f77\u0060 JIT: keep branch conditions in the CPU flags via the compile context \u2026; \u0060f7bfc00b\u0060 JIT: key the PIC\u0027s arms by target, and fold away the class-independen\u2026; \u0060cd4f0330\u0060 JIT: route the numeric unary operators through inline generators (#1117) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cb133f459e74a455cb02649a4a03db70cdfd710f7bf08e70c57a732561a713"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: io.rs \u2194 thread.rs: \u0060monoruby/src/builtins/io.rs\u0060 and \u0060monoruby/src/value/rvalue/thread.rs\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006029aeddb7\u0060 1:1 threads: a kernel wait reads as \u0022sleep\u0022, a thread\u0027s child starts \u2026; \u0060994cba8c\u0060 Kernel: easy/medium spec gaps \u2014 ===, extend, lambda, srand, Integer/S\u2026; \u0060dabb0471\u0060 IO.popen extensions, Thread construction protocol, real IO#dup, exact\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad1b672293d5e051276d43b790f96485cae0eb015e043bf4533c2c1242a774e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: executor.rs \u2194 basic_op.rs: \u0060monoruby/src/executor.rs\u0060 and \u0060monoruby/src/globals/store/basic_op.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 \u0060eb093795\u0060 \u0060!=\u0060 is BasicObject\u0027s alone and calls \u0060==\u0060 the way rb_funcall does (#\u2026; \u006016009edb\u0060 JIT: re-warm BOP-evicted methods, budget loop/specialized recompiles,\u2026; \u006021ed6aa5\u0060 Fix the cheapest ruby/spec core failures (and three bugs they uncover\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad26e331b6c6c2afe556fabc055c99b1e0e782e9484485fdb6917646df38091"}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"fc9fb72f7ac60662a93a2bc98f332cda2c243472789313df9dc5150a89d8d3e2"}},{"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":"46b6ce427485cf40782fe5489e825aceb8d11c69911df0110a167ee85a3787c1"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0957eb86d0b4e4ff95ba17163f812c0e829793044db14b2d769ef2e9964f48c8"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae2bbef903c4563cff978caa33e0e423e7470ee50f67024998b4a54be16c2d0c"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/bench-pages/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27089a222abc0ce8ae934fc434da6f58883a20497a1dffa0ad67338080fba3"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: monoruby \u2192 monoruby_test_support: \u0060monoruby\u0060 (production) references the test project \u0060monoruby_test_support\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"853cb5d5b5e0a7dceb0065124db6cdc15d776477a776fd7d396d9c676b7e001a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060io_close\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee4d069f7ad4828e8699664b8d65611df5fb009f0441bb6cb237e904b291064"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060from\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ast/node.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02fddf838521a7ceb4caf0ab17da0ba5119994564e91cdb4681e301af2f9b10"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060show_loc\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":"monoruby/src/ast/source_info.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd7f51b56cac72d7f44ad607ee37df0864717ef9d3e80c207833edfa66dc9e1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060to_f\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e906825f3ec5c5655c4716dbefa3ea741eecc97ab27432c0271f8c97c05d4adb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060succ_walks_its_own_encoding\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12535}}}],"partialFingerprints":{"codehealthFindingId/v1":"38de82ae5e474808e519d4fb2b23f6a0bee1728e034133aa3c60c72fc8222791"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode_linst\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417abe1fd38a31cb954a3a0b52b8e80b0f7be3e8c9c403180944cafcdbe39c6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode_linst\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea7f9b1346c32de0621bebd00343db6e7ce1e7383919e3f1a617f7df43acbb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060_dump_reg\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":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":3863}}}],"partialFingerprints":{"codehealthFindingId/v1":"416a577336a07fceaa599d0b555e361af9388714274b8897cc885b0a0035e58e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060func_id\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":6132}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e8e3cfc09cd6be97f88ceca195bdf6680fafc9e0070d757de4d7b2b72b4cd7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060noinline_gen\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ceb5ee9fd4d10c27be61eb69d56b8b8dbd642d170144629c351da2e272e04"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060ubf_handler\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":"monoruby/src/scheduler/native.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4527dabd77905398dede141ee30fb9bea21e88b5529ee8bc71c7f3ce3c45ae95"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060ext/bcrypt/Cargo.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/bcrypt/Cargo.toml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00f6ce226bc907e4cad875c8a1172439df5e14c04c4e178b6c7d54d6323a726"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release-binaries.yml"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A Ruby benchmark-ips/Benchmark/rspec-benchmark suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmark/app_fib.yml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d2351e38e71517186f680ed3ed9e0d03c80d5312a50876991d64014f903d91"}},{"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 (\u0060sha2::Sha256::digest(\u2026)\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":"ext/digest/src/lib.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4919e122ee5d3bc792a0b04400638e05ba7fa745fdd363e63115faca6a703359"}},{"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 (\u0060sha2::Sha256::digest(\u2026)\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":"ext/digest/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb88c8870e9717841a9dfef02d4feaa9385620e51763959b03ad83ce63d362fa"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdn.jsdelivr.net/npm/chart.js@4\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. 2 such include(s) across the repository\u0027s markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/bench-pages/index.html"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad827c94000078981b5ff9c35887237382419dc6b35fed7dcb78d9010d72dcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(endv \u003E 0 \u0026\u0026 unit \u003E 0) || (endv \u003C 0 \u0026\u0026 unit \u003C 0)\u0060 appears character-identically in 2 files \u2014 monoruby/builtins/numeric.rb, monoruby/builtins/range.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/numeric.rb"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc700da29be6949066b5e733ae7ca530f6f8266dd30a6131f786225e398a786"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \[e-mail redacted](n, @s.bytesize - n) || \u0022\u0022.b\u0060 appears character-identically in 2 files \u2014 monoruby/gem/cool.io_ext.rb, monoruby/gem/msgpack/msgpack.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":"monoruby/gem/cool.io_ext.rb"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0316fbe5310814247cb294192e297542994cd0ba1c93bf49159584e77e21583"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Hash === params.last || params.last.nil?\u0060 appears character-identically in 2 files \u2014 monoruby/gem/nokogiri/html5/document_fragment.rb, monoruby/gem/nokogiri/xml/searchable.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":"monoruby/gem/nokogiri/html5/document_fragment.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8e14a69db58f03466b36a4e6e71e54af611da8e05c9d53f678d313185c5ecd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b == 0x20 || b == 0x09 || b == 0x0a || b == 0x0b || b == 0x0c || b == 0x0d\u0060 appears character-identically in 2 files \u2014 monoruby/gem/strptime/strptime.rb, monoruby/gem/yajl/yajl.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":"monoruby/gem/strptime/strptime.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a990d0ebdc499f270987497038d178ada767035fb58a9a958ee9b067574ccd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defined?(::JSON::JSON_LOADED) and ::JSON::JSON_LOADED\u0060 appears character-identically in 14 files \u2014 monoruby/gem/json/add/bigdecimal.rb, monoruby/gem/json/add/complex.rb, monoruby/gem/json/add/date.rb, monoruby/gem/json/add/date_time.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":"monoruby/gem/json/add/bigdecimal.rb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddb613a5161711b6871db064883c5862867939ca23d27f414163b8ac9f9e695"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060g.is_a?(Proc) || g.is_a?(Method) || g.respond_to?(:call, true)\u0060 appears character-identically in 2 files \u2014 monoruby/builtins/method.rb, monoruby/builtins/proc.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":"monoruby/builtins/method.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7c2abc734a999ff94dac89470ca73a0d7161365e1611ec756e4b89c58fffce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!callsite.is_simple() || callsite.pos_num != 1\u0060 appears character-identically in 5 files \u2014 monoruby/src/builtins/bool_class.rs, monoruby/src/builtins/numeric/integer.rs, monoruby/src/builtins/object.rs, monoruby/src/builtins/string.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/bool_class.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"534f6828131c328abb46aa4986617fc1fb89fe148f7c6b19a9f9f204448c8564"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!callsite.is_simple() || callsite.pos_num != 2\u0060 appears character-identically in 3 files \u2014 monoruby/src/builtins/fiddle.rs, monoruby/src/builtins/io_buffer.rs, monoruby/src/builtins/string.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiddle.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"85508aa832cea69dc18c4cad8a19db86741f9ba09f588755d23a69e917e69a4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!callsite.is_simple() || callsite.pos_num != 3\u0060 appears character-identically in 2 files \u2014 monoruby/src/builtins/fiddle.rs, monoruby/src/builtins/io_buffer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiddle.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"394983ac0af1d2fc04c8e7a905cf757a16404bdbbbc238ef7a5bdd26d7e86dd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arglist.args.is_empty() \u0026\u0026 arglist.block.is_none() \u0026\u0026 arglist.kw_args.is_empty()\u0060 appears character-identically in 2 files \u2014 monoruby/src/bytecodegen/expression.rs, monoruby/src/bytecodegen/statement.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d07ca5bef12f9f51eda0ae25f34db9baa2796b9923ecc4d6c5543c0944375f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cause_kwarg.is_none() \u0026\u0026 err.explicit_cause.is_none()\u0060 appears character-identically in 2 files \u2014 monoruby/src/builtins/fiber.rs, monoruby/src/builtins/thread.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1ab286fca55aa450c8a09a7331492866703fb7567db35cdf2e363d580315e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dst_enc == stateless_kddi_enc() \u0026\u0026 !kddi_wrapper(src_enc)\u0060 appears character-identically in 2 files \u2014 monoruby/src/value/rvalue/string.rs, monoruby/src/value/rvalue/string/transcode.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b73af3b92d92955d411ecfb6c65d8132694d390681ea5c670c86c72d14a98f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060enc.is_ascii_compatible() \u0026\u0026 bytes.is_ascii()\u0060 appears character-identically in 2 files \u2014 monoruby/src/builtins/string.rs, monoruby/src/value/rvalue/string.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a929430879c79c1090d2decaa19241f2148280099de9283b867e48f2fbd26af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len \u003C= HASH_INLINE_CAP \u0026\u0026 !self.alloc_free_head_addr.is_null()\u0060 appears character-identically in 2 files \u2014 monoruby/src/codegen/arch/aarch64/compile/mod.rs, monoruby/src/codegen/arch/x86_64/compile/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff5a5e4e75fb15f8257aed5c896de0d5cf2078f2b3390e8682b873cdd099243"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060meta.is_native() || meta.is_internal_builtin()\u0060 appears character-identically in 2 files \u2014 monoruby/src/executor.rs, monoruby/src/globals/store/class.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":5760}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2bf88666ff9c6b5b4c3581424096898232d9fe27c11316c86c3d8cd3843a98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next \u003C s.len() \u0026\u0026 !s.is_char_boundary(next)\u0060 appears character-identically in 2 files \u2014 monoruby/src/builtins/string.rs, monoruby/src/value/rvalue/regexp.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6838}}}],"partialFingerprints":{"codehealthFindingId/v1":"3339670cbba2fe525522d7727c5179f218536fa9338a2a642523b9122bc9ca49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rest_pos.is_some() || len == 0 || len \u003E MAX_INLINE_EXPAND\u0060 appears character-identically in 2 files \u2014 monoruby/src/codegen/arch/aarch64/compile/mod.rs, monoruby/src/codegen/arch/x86_64/compile/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993c46d0bf1f7a64b6bce215ce01a5926062f0d2701dce0a4b96c0b7035d340"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.alloc_free_head_addr.is_null() || !v.heap_copyable_array()\u0060 appears character-identically in 2 files \u2014 monoruby/src/codegen/arch/aarch64/compile/mod.rs, monoruby/src/codegen/arch/x86_64/compile/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7a118c07b7b82500789b60c85e5fa34604626116e270160fbce57bbc8a0084"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spliced_break.is_none() \u0026\u0026 spliced_ret.is_none()\u0060 appears character-identically in 2 files \u2014 monoruby/src/codegen/arch/aarch64/compile/mod.rs, monoruby/src/codegen/arch/x86_64/compile/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d770b739f1b86d11997b168d6041a93fecbd0654c5c4a9c3c48513604b77d0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_enc == stateless_kddi_enc() \u0026\u0026 !kddi_wrapper(dst_enc)\u0060 appears character-identically in 2 files \u2014 monoruby/src/value/rvalue/string.rs, monoruby/src/value/rvalue/string/transcode.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":5739}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9ca65ab1db2861bbe81194c0217c39599e3a157ee54f8257eabe96c7d6b811"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let node = expand(ctx, this, args, reader) ?;\u0060 follows \u0060{ return Ok(hash); }\u0060 (line 340) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/reader.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fec84289b8c02d853ff7ee6f67cc36bea85d6b322bf198f14b61665ef1dd2c"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let node = expand(ctx, this, args, reader) ?;\u0060 follows \u0060{ return Ok(hash); }\u0060 (line 365) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/reader.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d395aa3b7934790250818aec1efb3006683604eb74d1da1e65dea2f074907b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 54 with a piece of the document (and at line 109, line 161) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/set/iter.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2652f0af5c34e16b82792053febacb7996d2135e68b62d6e70d48ac5a56846"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 63 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/set/iter.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fffa5f0281708c139440b221cbeedcd4cd66c71280a90b14c8cbf11644d0b2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_slice\u0060 is public and takes a \u0060Drain\u0060 as its receiver from its caller, and it calls itself at line 145 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060as_slice\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/set/iter.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940d7c4697dce617a591659e35e924edde574e76b0bc11d773c3f6f5b793b56"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_slice\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 53 with a piece of the document (and at line 113, line 236, line 293) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060as_slice\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd1e9d6554347c549b03efe2b9099ea280e7ada25f974bbbc693c0e332248ae"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 69 with a piece of the document (and at line 136, line 257, line 309) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca92fdb767111ed5b479fd482bdbec44757c71fcddf53ae38f8ff1d08964db6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 79 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c40987b3c5f655c48cc1ee0b0568c899c91d1b0b6b10a2ce25946ddb605747"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060into_slice\u0060 is public and takes a \u0060IterMut\u0060 as its receiver from its caller, and it calls itself at line 120 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060into_slice\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"219292d8544e9ad2ea490d33d8aa091c365390f8b9bd0fd7424b935970fbf5e4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_mut_slice\u0060 is public and takes a \u0060IntoIter\u0060 as its receiver from its caller, and it calls itself at line 241 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060as_mut_slice\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/iter.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf384acdeec367ba2d395ccd8d335927b6b17ccec779d5440b4d803f79978b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060index\u0060 is public and takes a \u0060OccupiedEntry\u0060 as its receiver from its caller, and it recurses at line 172 through \u0060get\u0060 and back with a piece of the document (and at line 191) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060index\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core/entry.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ac8d3c148aba4a52716038cac819a48bb3945b1f2ebe69d288125d32b391c2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060remove\u0060 is public and takes a \u0060OccupiedEntry\u0060 as its receiver from its caller, and it recurses at line 229 through \u0060swap_remove_entry\u0060, \u0060swap_remove\u0060 and back with a piece of the document (and at line 240, line 274) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060remove\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core/entry.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cacb97abb8ca5df706e940470320c48a1b189d7dfd6f8bd9bdfaca635726c3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060move_index\u0060 is public and takes a \u0060OccupiedEntry\u0060 as its receiver from its caller, and it calls itself at line 305 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060move_index\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core/entry.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f527ca22e85495ffe127b7acabe68e5c3bc1017b8369adb1c76b26dad18cb43b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060mark\u0060 is public and takes a \u0060Executor\u0060 as its receiver from its caller, and it calls itself at line 598 with a piece of the document (and at line 601, line 613, line 621, line 625, line 628, line 633, line 636, line 641, line 644, line 650, line 656, line 658, line 665, line 666, line 669) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060mark\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2638c4a4dc4e1c8de1b7db403e2a46cfdd15df14842bdfc4f81fa54413077f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060method_func_id\u0060 is public and takes a \u0060Executor\u0060 as its receiver from its caller, and it calls itself at line 831 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060method_func_id\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c76385cec22c0a90ec4c0a5cd6479b811ffd2a13f840afb47305d0ae29dedf9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060generate_proc_inner\u0060 is public and takes a \u0060Executor\u0060 as its receiver from its caller, and it recurses at line 5436 through \u0060materialize_escaped_block_handlers\u0060 and back with a piece of the document (and at line 5606) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060generate_proc_inner\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":5436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e065aea47b54d86f11f66bfb9a30ba41dbe4c514553589a36052faad251c074b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060next\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1958 with a piece of the document (and at line 1959, line 1964) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060next\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"d187e15ff6d2f2c8293b4135e5ea6de0d95ce10113aef58f707f632537f390f8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060prev\u0060 is public, takes a document from its caller (line 93) and hands it to \u0060as_ptr\u0060, which calls itself at line 87 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060as_ptr\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e5c2fd8e4d42bd0bd0e4f0eb832da3337161020df31f6f63b9964a08d81c93"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060format\u0060 is public, takes a document from its caller (line 742) and hands it to \u0060format_inner\u0060, which calls itself at line 759 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060format_inner\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f7e1b10591e197f36fa5a4a130e3d97b767b03e1320baf7d83439829be3941"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060jit_compile\u0060 is public, takes a document from its caller (line 765) and hands it to \u0060unit_inst_len\u0060, which calls itself at line 1030 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060unit_inst_len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd38749854f9d74462971dcead7493a50b861a8faeb642e9f411ac68ec2d391"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060push\u0060 is public and takes a \u0060AsmIr\u0060 as its receiver from its caller, and it calls itself at line 665 with a piece of the document (and at line 631) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060push\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dcd2cb36d097439aad18a998553d887b7be5a0679bd56d7bec41e27ffa6566"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_empty\u0060 is public and takes a \u0060AsmIr\u0060 as its receiver from its caller, and it calls itself at line 724 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_empty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa71fb53c10ffc93bbc70fb1e65773bcf4a64f5dbd576a7371a37e5679c12215"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reads_frame_header\u0060 is public and takes a \u0060AsmInfo\u0060 as its receiver from its caller, and it calls itself at line 319 with a piece of the document (and at line 323, line 327) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060reads_frame_header\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f7a5e098206d25305dc98734479c81e6b9197e6e06b394affa17592aaec1d3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060min\u0060 is public and takes \u0060vm: \u0026mut Executor\u0060 from its caller, and it calls itself at line 2860 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060min\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2860}}}],"partialFingerprints":{"codehealthFindingId/v1":"664036fea244fc4bc2c0f4e174e876e64d292acd430916fcb9d20ff2f53623ca"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060max\u0060 is public and takes \u0060vm: \u0026mut Executor\u0060 from its caller, and it calls itself at line 2964 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060max\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2964}}}],"partialFingerprints":{"codehealthFindingId/v1":"237fb341e88aaa9b2af4d1c864735996d7018b37c1f976de21482c84fd66d251"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060from_hash\u0060 is public and takes \u0060object\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 30 (\u0060self.from_hash\u0060) with a piece of \u0060object\u0060 (and at line 34) \u2014 and nowhere in \u0060from_hash\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060from_hash\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/json/generic_object.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cff2c242e8aa250a12a4db9123674a6b40742a461bc13e420db361b9a3e597"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060make_shareable\u0060 is public, takes a document from its caller (line 115) and hands it to \u0060__deep_freeze\u0060, which walks \u0060obj\u0060 as a \u0060Hash\u0060 and calls itself at line 159 (\u0060self.__deep_freeze\u0060) with a piece of \u0060obj\u0060 (and at line 161, line 163, line 165, line 166, line 170) \u2014 and nowhere in \u0060__deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060__deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/ractor.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e1d175d0a0fa0d6943da2aba0ec549cba4c02324fb9a8d393976172127d89b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060make_shareable\u0060 is public, takes a document from its caller (line 115) and hands it to \u0060__deep_copy\u0060, which walks \u0060obj\u0060 as a \u0060Hash\u0060 and calls itself at line 183 (\u0060self.__deep_copy\u0060) with a piece of \u0060obj\u0060 (and at line 188, line 197) \u2014 and nowhere in \u0060__deep_copy\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060__deep_copy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/ractor.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6f71a83431d5489b3719b28fae2d365e889cefeb926cc3396ce66e0458de2e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shareable?\u0060 is public, takes a document from its caller (line 123) and hands it to \u0060__shareable?\u0060, which walks \u0060obj\u0060 as a \u0060Hash\u0060 and calls itself at line 211 (\u0060self.__shareable?\u0060) with a piece of \u0060obj\u0060 (and at line 213, line 215, line 221) \u2014 and nowhere in \u0060__shareable?\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060__shareable?\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/builtins/ractor.rb"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"db47949f1106ee2979147d3e7d4aabf066b3758c83e652ed742afff57dcb5913"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1659 with a piece of the document (and at line 1959) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6bf9fcc4a5120eba8c17d7cc27c04f5e27de45d25e7dd2dd4f100aca134715"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060iter\u0060 is public and takes a \u0060IntoIter\u0060 as its receiver from its caller, and it calls itself at line 1759 with a piece of the document (and at line 2055) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060iter\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"907b86f887d050c301d7ca65c5f3b66ed748de938cc23265544e77a6ce09c9ea"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060next\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 2656 with a piece of the document (and at line 2759, line 2802, line 2921) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060next\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec85f562ea10c53656a3cc2ce4aabf6275a0a25b4b5e930498616460192ad95b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size_hint\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 2666 with a piece of the document (and at line 2763, line 2809, line 2925) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060size_hint\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2666}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fe795659549c101a6976547bede3132f810d74fe0a59b2ceacc7d924b92c0c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fold\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 2674 with a piece of the document (and at line 2771, line 2817, line 2933) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060fold\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"09022fa289b0c0bc7f01aa2f8049e5a57638c3e5013747e7f78c9f5298d9ff13"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 2683 with a piece of the document (and at line 2777, line 2823, line 2939) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f5ffcac82317aa7f184fe07674edfdd7f108484d6bb95d47743324b1d9c8e7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060remove_entry\u0060 is public and takes a \u0060OccupiedEntry\u0060 as its receiver from its caller, and it recurses at line 3281 through \u0060remove\u0060 and back with a piece of the document (and at line 3415) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060remove_entry\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3281}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd7ff9f476c4f4c4dcdf1f0fd431fe6d22c14b4a78045b6a74826064606b180"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060insert\u0060 is public and takes a \u0060VacantEntry\u0060 as its receiver from its caller, and it recurses at line 3557 through \u0060insert_entry\u0060 and back with a piece of the document (and at line 3587) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060insert\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":3557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca5fe2285ce9ee8722b675b33b9746ddfb3a0fbf4e2cc4882df53b41967393"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1134 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"763f595da746e33da1094e3eae93930c5ddb2a310478737d89caf1bfdc0214cf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060next\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1151 with a piece of the document (and at line 1194, line 1233) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060next\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"309e3560c36266dc1ba1464c951c4fd2ce5d49d2ec276fcee2592874e34766ef"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size_hint\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1155 with a piece of the document (and at line 1201, line 1240) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060size_hint\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a38d4fe651bbacd25630fe062ac00c14a88d1ffdff103ab56b8f47e9937859"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fold\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1163 with a piece of the document (and at line 1209, line 1248) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060fold\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df68dae81e731aaa539eb918853987e7653d2a4f68632bbb9d7c31d1f2f67e9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1169 with a piece of the document (and at line 1215, line 1254) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/set.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3c1d2be3bd519bbe58f99b9f7509e6076998080190c30d63ac49af0077876f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060remove\u0060 is public and takes a \u0060OccupiedEntry\u0060 as its receiver from its caller, and it calls itself at line 1379 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060remove\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3777e0cf6d76c504945f6724791a187cd22fc13b75c159746bd01eddbb64af50"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060next\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1727 with a piece of the document (and at line 1994, line 2047) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060next\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc014e396b896c873205b2d9ed56687dfd92775d028e9f01477d34feb75bcc75"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size_hint\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1734 with a piece of the document (and at line 1998, line 2051) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060size_hint\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"454b5a4d2f23385122a58bf3f15a6fea4b592544107dee2686cbf1c9cadb3f23"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fold\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1743 with a piece of the document (and at line 2006, line 2059) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060fold\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"504c7bf181864b9e7e3c7696117543579ed2111dbea3f176e6c744bdc33d4731"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1749 with a piece of the document (and at line 2012, line 2065) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0ebb9f9c0ee23c00daec5849e2c1c80858287164fd83e31a043c9a814c2530"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Iter\u0060 as its receiver from its caller, and it calls itself at line 1760 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/table.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd895a569b25336da869c53d06d1e6d6fbc802971032f150a8d26fddf1f147e3"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060f\u0060 (line 1687) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c924cbfbbc14a4b7de401b52755e86c9fd6d544ff7e06ffac80e71c37e6ea25"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060StdFd.0\u0060 is a \u0060ManuallyDrop\u003Cstd::fs::File\u003E\u0060 (line 43): wrapping it switched its \u0060Drop\u0060 off, and no method of \u0060StdFd\u0060 ever switches it back on \u2014 no \u0060ManuallyDrop::drop\u0060, \u0060take\u0060 or \u0060into_inner\u0060 of \u0060self.0\u0060, and \u0060StdFd\u0060 has no \u0060Drop\u0060 that does it. Every \u0060StdFd\u0060 that goes away leaks what the field owns. Release it in \u0060impl Drop for StdFd\u0060 (\u0060unsafe { ManuallyDrop::drop(\u0026mut self.0) }\u0060), or hold the value plainly if nothing needs to control its drop order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io/buf.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aa286fbb9ca46a81d4edd11a8883f59046fb7d16a82e02eb381e8900689f35"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060mem::forget(guard)\u0060 (line 3083) takes \u0060guard\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"1535721f3dfccd400e16724f20469d0c0c82e11fbfdba4e4364e419dd5ee6c07"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060group\u0060 (line 1804) is a \u0060Group\u0060 this function owns and never releases: no \u0060store_aligned()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Group\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb8508c3377f13b55ac53ba9dc0717bcc367989b821e2d8e73b4ab62f69a590"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CommandLineArgs.import\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ca9736115b1f898d62ff664c0b09b423dff0639c90af80a7b99274603c3fda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read8\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/hasher.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e85e3a6f1952dacd6f97c9cddd29b29a4a594e833fec8ef47d6051483eda47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[..4].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read4\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/hasher.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65cb174867ae26590026f6e93e02458b41b7c792abd636443fe8ed63018da0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060other.get(k1,\u0026mut(),\u0026mut())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"434b730cdc394257cc402fe825669c5118d3ebcd2d5760d20ef4f15dc3bf550c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(key,\u0026mut(),\u0026mut())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a9e538c52dcc33a278dceb07daec4d36730889461b6400e9a4083f8caa7081"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(key,\u0026mut(),\u0026mut()).unwrap()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"209b919db9a3f97b94f0f4ce39c23b9d77df3c6dd1982e19a42ac1d1f9bc0d15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table.find_mut(hash.get(),move|\u0026i,_,_|Ok(i==old),e,g)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a2e1b02aa7952de706efa4a37e7f986f4dc982df690c413e43feb9d0af463f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indices.find_entry(hash.get(),move|\u0026i,_,_|Ok(i==index),e,g)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core/entry.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f84696215250d624d3ec9a1dface439e2e914a797297c936daab04728e6033b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.map.swap_remove_index(self.index,e,g)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060swap_remove_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core/entry.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca4ed450a487908c8836aa484e5ea8514719d7837f06f374d6094b2f7c7dd4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.map.shift_remove_index(self.index,e,g)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060shift_remove_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rubymap/src/map/core/entry.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eef8e501e1ccddd66deaa3b9f967c331703845f3fc6bc725bf188d23c4f1d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slot.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060thunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby_ext/src/lib.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1831b79d22479df349a20e104858276b14789886d05bb262967d17b9ff87a2a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(s.as_bytes().iter().copied().take_while(|\u0026b|b!=0).collect::\u003CVec\u003Cu8\u003E\u003E(),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cstring\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby_ext/src/lib.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1317caf9938944f86f9fa7a4ea9cb4420e74b0c4ea56aeba7b72ebdb948fdfa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dirs::home_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d6a4fd5c54c90686ee4e9e92324568c4febfc4606bfd1c72f8c3782bd330b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(\u0026lib_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2446c4f4d8ba4c04ccebd7d5af9878b31dd6f546cfbd4733894295b1e2d220f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::remove_dir_all(\u0026staging)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5e59ea6c66b807c8f44850ef42b5958fd0ba8f96d383fde1c03394f6159258"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9c5f1d51afb5d0bf4eba664aea9cc04d65f7c344499d9685185a71034d5ac7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060copy_dir_all(src,dst)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"672691e1b54d86edfce36c2ef0f6b084d8c8fc84c305c1ca502d0bd48fef6e34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hash_tree(\u0026staging,\u0026mut hasher)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81475498c447bfcdb33a5556a7895153717a7a32e9e911c8b3436126cac930b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(\u0026stamp,tree_stamp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c29bfb3ae3b9d2033a32af236cde4105bae540b939050408fd0d5dd81adf1c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_extensions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9340dc221d1a3eaca6aa88a50f11706014757f7901b713bf3fd9701b8261bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"595de47c503c38faf76e736ef2bba091b54ad11c78f9b2e20b6098152f30b385"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(capi_dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb3d2d80c16405996eef2ec4e91af7294f4fa46a5d57c883a3fc1b2591a61a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::copy(\u0026out,capi_dir.join(\u0022libmonoruby_capi.a\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc32f05b30671c3586385abcdb3e4416ad677d3f5c295db5dd3ec86b49ddb8e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(list)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_cruby_header_names\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c8fbdb9f4cb7334bc460c30dcf574c31805612d99fb612d3b005ce28fd8edb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_cruby_header_names\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"60161aacbbc9892ea91bc5bf1ab47eae6a592dbd111e5d01fd78fd79b41cb8ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(path.parent().unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_cruby_header_names\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb330940324353d08b2c002ac962e1284e9756470fcc3b0c630f203a13ea73a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(\u0026path,format!(\u0022/* CRuby\u0027s {name}: monoruby\u0027s C API is all in ruby/ruby.h (doc/c_api.md \u00A73.17). */\\n\\\n                 #include \\\u0022ruby/ruby.h\\\u0022\\n\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_cruby_header_names\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68552322263eb040389d4dbd97c29e4f757c444b72c11f47cbddae3fd1d9a7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060capi_extensions_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0094f2a3053f8339e2e81e4dee4d5d9d9744f94753f32ac45e66e0dd49f397"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(\u0026dest)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_extensions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb910db29ad39d8b96b6a2f84c782a2d9abeb2fbc6e5af55fea96caeea8cc16d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060report_compile_errors\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dab3898cb5f56d7efa0b8a5f5d5e16a06566623b93c945768efce4c8502bdf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(list)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_stubs_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f82c48ea2f2b00b4567a7c729f895d2091dbb3618fe62bdd867ad050d47cbf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_stubs_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"8866d7083a16fb73cbd3917be95db4a701cc82f705faf434e1b37bcdbde1e80b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_stubs_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb2ff32f25fd5e9da089628946341a90b8e2806af38d43c6ce549ed05712f2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(\u0026stubs_c,src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_stubs_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"df34f08f21daca5ddecab00f6b021e441a4a270efebccdf0404c3cc9258fb512"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(capi_dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_stubs_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"598a1104f7842965d9f93493053638537778667d65d4a1e3969a7b42c857ae95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::copy(out_dir.join(\u0022libmonoruby_capi_stubs.a\u0022),capi_dir.join(\u0022libmonoruby_capi_stubs.a\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_capi_stubs_archive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/build.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86b0baa9b665ab4a29933c07cec1903a71d431868245f8fff827ab9b61a6751"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(ptr as _)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e9a70e75e6e751a46bd986ef04f6630d5ffb96cf796d9704f07447ae79f1ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(ptr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_page\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a47840ec9207d82adaa758f3bcc1356facb50a983aad179ca1d1d7a0581862"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.free_pages.pop_back()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060release_excess_free_pages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2942720386b5038b3c037270e0fe5a88a7c55e960bb5f484b8189094200e6a4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(\u0022/proc/self/smaps\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vm_flags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/alloc.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b300837a8afc1178c65f56f4a4acdae50a44987b611bb8b530cf51772bcd59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060loop_stack.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/basic_block.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"841e60a2250afc57c0a4c230f9719db9aed5b1348a39f7c01501bfa9ff31bb17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.object_class().include_module(kernel)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_builtins\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad33736152e9cf4bb3d12f36ff5d7be70d11849bb64d4b46a6b451e9fad30961"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(self.as_ptr().offset(rhs.0 as isize))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecode.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f46c33a9f0e41fc90b4e50d0deced35ac420ccd5733f624bf6ec1fd46bd3ddf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(ptr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecode.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b77f3226a6f842097caaa7993921c02ac4f10ca86d6a9c22681dd2b3c270a5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.labels[index.0].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"80774b9e3af21a6c067063118dcaaf9d4f2f8538e956f0070a4ebba4b9b140fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.loops.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060loop_pop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b6c705a4fc37aa48f91d2c78b04ce7927a81883e1b9dcad275e03873724f67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f.write_all(format!(\u0022{:x} {:x} {desc}\\n\u0022,info.0.as_ptr()as usize,info.1).as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060perf_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4401cc2be352f4a61fe895e06f803b31efbd9fa8a09dd9997d5403e1239750"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f.write_all(format!(\u0022{:x} {:x} {desc}\\n\u0022,info.2.as_ptr()as usize,info.3).as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060perf_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"37da28453b7a777319783294d021d806e54646265f5a2e56a522cbab81cf3ac9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(p as usize).checked_sub(base)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"58316d689e3bd6977f7d77e9be3e4d3c3953ba7ff7b72c94494d2e217b955cc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start1\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_vm_address\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fca9419b90aab1d3aeac52806d2c0d233b14ca5ef9461e0c6fa70ab29b953c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start2\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_vm_address\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86c2612e440dbeb382b3a04302e6009227fae2961fd0b814a472c4589dba868"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.jit.code_block.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dump_disas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed68807a6759baafb1946d13690d22f0f7f976349c3b02770e6c0a0427e8f68b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.jit.dump_code()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dump_disas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f8399d0402639bf90c19ffc14b5729961ae58cdb75688baef3eec9cd586e2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.find(\u0027:\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dump_disas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"136be77d3acf385d973f6c45360a01e847ab77838de7cffdac1128fc13bb9b72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.asm_return_addr_table.get(\u0026evict)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060register_chain_exit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d47aef0ecd45562d3af867ab122d322e91573e52dc9c685743319d5f99dbef1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060return_addr\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060chain_deopt_into\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b78d1c9e31d286f5b8c52f069bf7d8fd51bc69038f9045a76d03b9a47fc647"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cfp\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cfp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"745bfcbbf631a18093bd5c9727cdc6e4ed62e02f98969081f5c1af6cedf858be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.temp_stack.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060temp_pop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"760254716f552ebc34674663501efe30d22c4e600dc90c68ca5dc08e5de9adbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.temp_stack.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060temp_array_push\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"667b2b71b3cf525a574c0efc6023d25846347f858309679918429b7b1a1e4f52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.temp_stack.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060temp_hash_insert\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a07640a6efdfa2f1eed9fb617e5be468e86c7370c533a039669ab9a6200f33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.temp_stack.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060temp_array_extend_from_slice\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20091cf776faed427c319cc8ff0f92a854311f62d3f8841e50091a3221db3ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.empty_toplevel_fid()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060materialize_toplevel_binding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f377c2e2c9c42ccbe822e992b8b17c2394db0a4aa6a9fc367e7d11b777a0e04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::value::rvalue::Binding::try_new(v)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060exec_main_script\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8f77c6fff512c88ca87094951cba14bca4944f11a68d88a000ef9b0c4eb272"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060binding.binding()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exec_main_script\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a42480721c4421970e3d9357a14c1b6d0ed8a94ddc07b9029412b78706e97c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060push_class_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab250804fb3152450663d3a97c399fe6563367619d6775589fbafa99fbd3ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060push_wrap_class_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6919a1add04a7901f3055453d99e971237137b6b08ca43858b17208ec3119d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060push_runtime_class_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27a423f2d7af5eb130372ac7f73f59f34f197abbc0ea36a4d7ad7ada6128b3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060push_instance_eval_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c10ce34915db9d15f3516b41126f59a840220a8055860aae0e5b5c70e2922"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pop_class_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e930d121f9ddda3c496c02789ad1f34dc219ab6a304fb0ddda9e17436b6d31b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_module_function\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b8d6419bcef29f3f77c6c476d24a08715d64f99eb0a57cf1dd489b24bf978d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last_mut().unwrap().last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_module_function\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa106a2d01ed36604562b099249a9439b46d920bc3a00c95d7b6d222f73ffb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_class_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"557057a2ba6a4ca15a0ff5f730f14d52cecc81da55664a621693576fb5dec7aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060class_context_id_opt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4158729a63c6893218f65d963766bcbdcaccf7c6b201d6c3a6173d8ef019c60f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060definee_class_id_opt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b558a1ff144f17245a39c1c635680d3c5081ddcbc484429ed39acee20983c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.lexical_class.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060context_visibility\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"708a7f39c35a76655a37bc88748c163a943a3629e23683c8198a295bbb245728"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::mem::take(\u0026mut self.exception)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"199b35762eb8fcf431e4dc112bec8b5172831c532246af7e687b0d28b4cbb4ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.deferred_unwind.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060finish_ensure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"485817a45406ce8c24166bbd29c38bf06298ac9ac50ffb79c818176ea57aad5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.deferred_unwind.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060finish_ensure_spliced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ffdef88a14f7e18b187a218e0f70cb63a205e956f67efd41446478b840fa81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.deferred_unwind.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060finish_ensure_spliced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3701caa988e0d907b63953fb27b378098a387b5b4950613832add4b09e14ba49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.deferred_unwind.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060finish_ensure_spliced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efc73cad26278d07ccec992f9970dee60e8e5feb1f22ff9a2ffb91e977c45a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.exception.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pop_error_trace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2704d92f89a2f6a2b7805a7ac5911b69030c6b9718ab5228d1e059d60ed1acc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orig.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c02bcd92efe57d2678ceca929b271563a595b847b143064a020ccac12df92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/path\u0022),path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"43707e7a21afcc9ef63b2f226f4a8acbc3f72117b7dee2a14cc782c2d975aa9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/status\u0022),Value::integer(status as i64))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d3d3bc762645b191b426c3f83d399dbee71f42351bac5b49fdefe0cebe8f9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::_NAME,Value::symbol(name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aeb64473ec163db07efe9979a36cbae4b80c62b22d7936a6f146efb2eb0506"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/receiver\u0022),receiver)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"749a03645cb7e683b289289982c66242d84e735bcbfc89df994e986b3868905f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::_NAME,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b9c898600c8d2a6ea8cf954dca755dada6fdf8ce4ecbc90a1987d58154e67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/receiver\u0022),receiver)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce55747f3e521251f4cba7576e45ae70ae25fc4e84dcf77bbaa5aa744e3641b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/exit_value\u0022),val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"250d904d367c2a4aae0d07e005328b103cfc26dfd1f975acfdef3dde16671980"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/reason\u0022),Value::symbol(IdentId::get_id(reason)),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de7318d77990bc7e1e9c36fce51ba998aa4ee331d2d82cee227596483019476"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/result\u0022),val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac159b6934c91baf187e0db1b4167c31743f27a1cbd677a73d66a6a15a9620fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/path\u0022),path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d4a3027da99d22bcaeb76ba8cdac92a6bf6f5ae800ef0f2338e9f8d70a8f77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/receiver\u0022),receiver)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90e06bef8ab9e74da2499ca571b702914256daa9f80261ded19d2c84f92583"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/receiver\u0022),receiver)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"57899906bd2ffefb045296a5a20897e74b2b9ccfb401e3ebec0e00a0d5bbd1c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022/key\u0022),key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca049e5cbcc895dcedca6cfd810a34db19c8d1983c97bed32711f1a809149e0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(SIGNO_IVAR),val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c49da252709ad34cb71eaa475561d9fac5855195677e2fc1f080df958a135c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(ivar),*field)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_ex_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a25f2dbf5050be620fe2bcd6ded1dd2572f149091c467a343994c3786a2d9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(rsp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_rsp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a160aa0aa221deefa999e335f31788035a4a214368c904720e3bcfe598746"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.return_to.or(child.parent_fiber)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fiber_on_terminate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e739449b6aa41e6bb44b775743531be71247464305aa9f618669f398685ed9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_constant_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441776f8df67525fdcc77509313c7c74d5498a695ae8918c0b2c11557197a2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_constant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a448d6d18670ede7d337318c0f3c217e3497a46f1767e743808fe2a516c98d3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store[func_id].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invoke_method_missing\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":4312}}}],"partialFingerprints":{"codehealthFindingId/v1":"babc2529cd551df6ba2e936614c7c278ed35a80c90c4cca45463428b6dc195c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.register(cs_args\u002Bi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060callsite_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15a6cf0ddc499319da0bb0c06ab3d0f93b0e1d7f022ba0bd4c625b06d25afbd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cfp().prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_binding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":5625}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc24d4066beb6f1be5b166c56197a87afe5d5578fdcb128aac7e2f10da3abf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(i\u003E\u003E16)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_proxy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor.rs"},"region":{"startLine":6158}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f45cd16b0e44c3b48194b5fb8699a45b4d4b98a989972e092f122f985e9e3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(copy.as_os_str().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060claim_capi_instance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4d310efce452b9a01210c67df6cea1a7e4e3ca926339b02d2d99af97e2279f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(init_symbol(path))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_extension\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ext.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0783a09f7b64d49b7f57943cb3ea1af4c2d50cd3567724018beec38bb01471ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dirs::home_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"0754efe039d832d3f9b461e3dc441bb3d5713f44581f660995f98fcc10c68a12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(main_object,IdentId::_NAME,Value::string_from_str(\u0022main\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef5ceef02db134c2f898c7bdbe7b34abff90ced9df16e8b07c13d47afea9f04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_with_prelude\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"899d2cb14a11c61200d86bb1353425ae77c738767ac8edde183edb9a507d6122"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060th.slot.wake.wait(granted)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060acquire\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/gvl.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fbb3edf59f0b4e06b38e095df671337a76036b499b18d22bf3fb21153b2144"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060th.slot.wake.wait(granted)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/gvl.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf94e27acd4306737c7e83709598ed6f544779abffd7b5c367aa4f18d767c2ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_u32(SOURCE_BYTE_CARRIER\u002Bb as u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060carry_source_ident\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/id_table.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c12dfb7d40c56643c652ad5cb5d8ed0a6e31e71cca0b70789ef9eb035db68a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU32::new(1u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/id_table.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e245f8ffb48909f9c4f0a1175a700414b5fb366de9691ae54f85d1390db7656"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU32::new(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/id_table.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1148168b9a1d94da26d3f3388ae1a1ec6ad4f793380b324cb6af2e8f690eef5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060msg.split(\u0022 (os error \u0022).next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"846d458c26f4ef096611bfc734a27c725ec45fddbbecb5956ef7886641313069"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060msg.split(\u0022 (os error \u0022).next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"885f6543a313a41da72e37db6378b2456417f4511ba390a9589b00b3445ac138"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stdin().read_to_end(\u0026mut bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/main.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada785fb61526a35c5aee32cb27f3009e8fe2246fa8a110de76a35130b33c49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cv.wait_timeout(pool,WORKER_IDLE_TIMEOUT)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060worker\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/native_pool.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db7ac202658dd560e1ac1d17e62bc01b5c06a0581b9e34b1197cfa18ffd337d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060elf_functions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5de40d9a511fc91e878a63d6e57d741df30b977d826099b3193c76aa14ae02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060elf_functions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e94b6ee962814f06cf62da590e5bb7a72a765b500325d0fe4c1cca8cce480ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060VIEWER.split_once(VIEWER_DATA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b931e9db87838e998470cc35f7cdf7de8b8f08aec1e3c246df3883785df1114"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TIERS.iter().position(|t|*t==tier)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060report\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"05688ea6d9ccf6acc200870ea6c3da6f8e89de15eaf2187e87d906b0e1019961"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TIERS.iter().position(|t|*t==tier)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060report\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca258257bae487ac93872fcf3ed7c846dc8d366639a989d011fa214be0652dd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_thread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"15008fd984ea0165755e1e2ea7beea28f95008b741d87b9c386b968ff7129032"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main_thread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"27329d518858d499c5188e233e5365cf941ddc7c7e8bbce6d33dc25be9fa2a41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sleep_woken\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"323c637edba9840b5d3708eedad4560a11b4344b69a48f5db36502bcc003f64f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sleep_woken\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"359389e0a4e3428922b137f0b77b84be3bb416efbee4e3cb2fa2aef455d43576"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sleep_woken\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e3a2c19c620437fc24d5a3bcbb193a3507ce1114757c76e7c2e09724101f77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b606075a5e665525286d393ffcee2f6769c5a44267a82a14f1df9057d0ccf0c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9071a53ff69c6ac586cd51b1e77c59219ab8594766e27f5b9b50ec3dd26e6e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b6013b3e5138e490359b51e6f4174988aea7a79abd98fcca8518675bc460a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcf22492e934bce8a877797200103fba402f15da8774a4db8679c9be3a04fdc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcb9b7b64b994359e0f1c8e37af15ebec5193bda0d5480ff24a1c76ab075302"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8dca96f7aaff090c9df964c67510fa833829c4d342c8bd663a2c50bc5484a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060interrupt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e845808240ce082c69a7b9407d11f4064ed98597bd13543979c30e168815626a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_main_pending\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb499c86d43887eb3fb8f2e978ba5508c6a468fd89545383df8ff43baa781ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_fds\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8facaa57ce0a80812e00b781ad4cc20506fc85b2a78d9e3170eab330e289c16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_fds\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7ebd7fb5f90b0ec6d528a799e6257a30e12ebd1e372e455aeefb3926722c11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_fds\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cf46014ed704147201d8fa5cac256b0eb96847908e0833c1e3a8d25f3b906b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait_fds\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba3e68964297367a8f0c7a038c4169862cdff5855aaf6224dda9a5f7eb5a33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scheduler_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2f045f31e5ea995710f9f854289f17da9a78b8905a9fb678c818cc42966ff2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scheduler_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cb98d6cc99b13cb31301975ecdf3178e68d06181743705766af0a5778020df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scheduler_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cf840cf3b65a67036bab31c43bfb395011f1e389f8ec15e2b299f792306474"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.proc()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a153dc1495159e040830e2a249bb3adac9f79f243a84e5730b7a6bfe706886a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.resume_exec.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"a222bdf285ea804b457d4350e115988e03dcd89bf552bac73bc7b6d377b24fb2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest[pos\u002B1..].parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_float_to_s\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"21291885cc4917ac184e18f3244ad886c327a24361a7023a55676616f9fd4c17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroU64::new(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_u64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"001db058b6a86722b4a944e6eb40d8514c4b499a2340ac95086572b8fe8e29f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_rvalue_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_rvalue_mut_or_frozen\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64354cf478d742af2204fc8a7a5818f5136a96650fd8eeaa093f8063eafff1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_rvalue()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rvalue\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc5f0497d54b22dce5a59616b1c018ff7f6b8d995cdb5d63e78e0d786562b98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_rvalue_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rvalue_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03fce52a62ccfbd8b28b181917cd7e1d200b201f62512b4c588676f4a05e8e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060as_symbol\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"6238d7f4f2431dd693467b8a011b79b735cac8d83134f924c5a559f334e7612f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060as_regexp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54228c93bd6f271ae884ad928fac4d8ed7d23a161ba3567612f26e87ff9eca0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.rvalue().as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060as_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f05529a08c2e26c16ab96157cbbca48c09387dc6de17fa88af005404fe1f97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.get_constant_noautoload(OBJECT_CLASS,IdentId::get_id(\u0026prefix[0]))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3801}}}],"partialFingerprints":{"codehealthFindingId/v1":"288e2903c676aa578886143dbf0d6f0558f09f02dd817206728ff8195a28ca01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060module.is_class_or_module()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3805}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d3ab389b615952f157e740494fcb09b4e7833df1a166d21a1af142af56695d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.get_constant_noautoload(module.is_class_or_module().unwrap().id(),IdentId::get_id(id),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0fa8ef5cd7afd1932c40754538826494acd1cc235e22721a77ceb664edf628"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060module.is_class_or_module()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47fa78bb0987642d9d166b7f08eb13a64f206fe9cdda1860e707a118cb2fcd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.get_constant_noautoload(module.is_class_or_module().unwrap().id(),IdentId::get_id(name),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3815}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7748a6e6d5625eeabb2eecc747dc76a7169b95b2055e7645e8a3c1e359a4c1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060map.insert(k,v,vm,globals)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88bf590e8628fd991185c41a37af91ee0260cd95d46108c7013e4e85097ba49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Real::try_from(globals,lhs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc823e2741d681814503c7e75b39dc1759e9df8366278ed27af35a2574dbf74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Real::try_from(globals,lhs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_ast_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3895}}}],"partialFingerprints":{"codehealthFindingId/v1":"156a572d82088175db778f68b949d6832fa5ff4012d0975522e0113a68228ab0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroU64::new(u)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_u64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":3985}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d02e81e252278541c674ae0db87fe29d43a085b0ae6f688e2ac0a55506c00ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::flonum(f.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value.rs"},"region":{"startLine":4082}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f74078289b4fef6f417f1ba0b721447a5c875acff1783d336e70348fa213a47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060alloc_probe_memo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/vm.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce34c5a2d6ea66c91fd5fccec2cf7d5d539b51aae9c01f7c61484933c0568e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060coerce_to_rstring_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09ec63b95fc39532a5295bd9ec1ad3535ebe6ad2ce073ca1050c6d581fe41a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ary.try_array_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060coerce_to_array\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfff7dae5808609d4d6a1e1b64b4439cc3eb856d332816e076fc252845e6dca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_array_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_array_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"be640877628f39ee0b6ca50c26d2bb6d98a0e6251166d4e074ffd2caf37354a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_hash_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5734b9fc79f7fce199543634e4c819fc80b31346b2f1fd9623f49b56d35e0f3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BigInt::from_f64(t)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060coerce_to_integer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"80576651a2e2c771f527c488272c8129861cf2d516f14c3455b314dcf9148877"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060coerce_to_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/coerce.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c015149be2acc88e1dc9dca0acc919fc97b0515cbfc115e42bb4326650091d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial_cmp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0269627fdf89b77ae227445278dae2e43a62148c011c97454ea4260322f6986"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial_cmp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"503f504f12f3a14958bf0096643eb1042b3312bdbb1090bcfe71e8bedea23462"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial_cmp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0960a8dc0d9a6a59f913562d2a031f03b35d26ed8a0f846b530fabde154348"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_div_mod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f3bcef37c6abd2c96cf908b24c4ee9102b9839a5931a0d025672832b349e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_div_mod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb40cba0ac1e38766f497ecb454b2a0a847717eb03f2a983fd376d7202ff3e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_div_mod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95853e16b9f4d40a926a402a3f3799582b66c6ef864125d5398f1dd7dfedbe8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_div_mod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"de628e79630a7cd0d3229008e0bb411269fb7bafb7118522bebdf8777846c54e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_div\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcad6a119d63a3b0428c85bf560b021100d85bbc0497aab37637821412c8f189"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_div\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44f35eab97c7b3b58332ede60a2f9987a0b3972f9f1a947356693bb9253ee3d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_mod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39e7b1118bc09e8d83245f4ed35e8958c43d569c8ef71f66abf1338dd564781"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby_mod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a94cb626c231b17df269db998bd35cb21d5b79e53aa1de478806cd3a0be7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060num::ToPrimitive::to_f64(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_f64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/numeric.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"becb8ec19eef7694bb2b7b456c42c08ebcf51c81fb774ef16c717a0a37d1c79f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(next)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_next\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8031a06b4479fa44c3205f43c788edefbe8f81cc90548454957ca7686f1fee8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.meta.class\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060class\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2366290955a30222255f898345d2cd96916b919092d4649aaeaa759bfe7a004d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.meta.ty\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ty\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue.rs"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b90bf0e110190f3cdbfe50e609c0c7c2fbd8dcfbbd07c85a404496ece8ea2ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.as_i128()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060materialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/bignum.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"67953ea9fb65dd0785f44670b0beb4562438a744d0859340dcde9def1d175125"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.as_i128()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/bignum.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"504971a7aade35052c19d1848cfaa50d1b97cf7c4b6b0722db75704486234fb2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.proc\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rewind\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/enumerator.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a4ce22f6c146b954b75fce39516e3015b55e51bd3f6ba11c46c1010161779c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.internal\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_next_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/enumerator.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"295ac28460cc6bce0a96a5786f9cb032f66db2bf4fa79283898d1fb712edb712"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Layout::from_size_align(FIBER_STACK_SIZE,4096)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67c9ffa9e01bda9a6fcf68103cba7ccdbc56c8ed93ee4dc0fa1c1732e9a6d85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(vm as*mut Executor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inject_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ab2a1a2dd862109dee921865b71dddefa9eeafda8ac2991a3c0b523e7043a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Layout::from_size_align(FIBER_STACK_SIZE,4096)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f635bbe01765069538805cc6474ca731739488322c9dca5086e717b427a7cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(stack_bottom)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97f2e416e82a09033a589699671609992f2f4a46d2edc05e0b027ed62889c3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(vm as*mut Executor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invoke_fiber\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2173d4f0da3195a11082fbad9b4df2150ff83b7e45f7742d2093fd6713f0e04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(vm as*mut Executor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invoke_fiber_with_self\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"39db394718329f96f4cf3e65f04cf8e1b80f716f948e307c55055069ce3ed05a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.proc.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invoke_fiber_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"879dcfd7f1d80e8478ab7bdd9c6c4d1430510d96c332196f2762bf50b0dd0f0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(vm as*mut Executor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060resume_fiber\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/fiber.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"572835360afe278cbf6ed9c13be7d578617fa8edc0a0d4fa2fd28cf6dbd813fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..self.as_ref().entry_count()).find(|\u0026i|self.as_ref().live_at(i))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060shift\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c812af97a0c2950ef46bc1f45ff96a7d92e9405ef7b2481b0549ab67ff047d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060k\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060shift\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa88dd197691193721270b622265e2d2d25e445d4c624626a00e8efdd0e17f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060k\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060shift\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff9e42126693a1f63de48f5c415b128abe158ee74bf0a2edb42447dd0a4f0cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060k\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060shift\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b419ad1c65a7f1c467299a0da7ed1f8f1b67dec9f3763d198b797fe37473a59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060k\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060shift\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/hash.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"767137124291988b5ff424646869c08b6dc7efa4ea419b8171efc1e0e33b627f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060flush_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"6446b6b08856594ebaacb0efa1abf831efc6b9e12acb2ddf43b6f77735881319"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(p)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_sync\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76f196e4a7f9ba54ce7ac9cbf6518dab626bea83012cab8aec1a20eb1e41cfa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060close_detaching_child\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"564c85af3c1a5fa03819c6926d85b5c2a91df911eec8c02cd7d64ff56bdde22b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060popen_close_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ee3fbb3c2c3efff85424565461a7baecef49731e6091b583344bbf6b4a57ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060popen_close_read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f675ad1a75539f540dcbdb3b8ada903f6a8d3f275bfd6a430bac3c4452d7695c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b36704c019e90dc5e74dd199b01dd139927db98b6c2848754797b590d85a6a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060popen.writer.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ae51d88e5baa6efcfca207e1d4b55cf7b1a599e84c14948f1f3253b03252b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pushback_cell()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060unget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"170e6eb5b2ceaef010b27bc175676ed8b0dc31862bf8719446d730d15a7f0c2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_underlying\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a7ac4b191665cf089ca650cd1e4167d4b9985b36189e4936a0f74edbc043c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_underlying\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca953724535e4c67867a8cffbd1159566eb0999d8e1a9719d6894d0b37820e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sysread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df908c596ffc3d9fc1e3bdc0c6325ec058b3424fa907edd50645025fcb822a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sysread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a8da10c44a3c2890f82f0944024692b81310bba8fd38cbf721f83a83da43ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(f)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_buffered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a99b9903ba54a1a042383b36730099c53e55b738be8455096dae9021114498"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(p)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_buffered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d0206848c405a3a6b79465f87a4a84fb7d2478212170648bf93589a97e141b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_nonblock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1670e9ab0ff93ba3d1c14a87af4b1a1ad36caadca0ce6a6cdc141e028d118df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060readpartial\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9170517c106402adedcb586a3f3408f683052f2e830f32c584c1d096a34d76ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060readpartial\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"deef51264da01a8088c967208f0692bb6fae14b52bc58af95019afd7a3c26e9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pushback_cell()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_line_bytes_by\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6a96f33e749124eb4c8f24c27262ba8e672a6aa88a82f3c205feb775534d21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_line_bytes_underlying\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9ca9b9e15860162e44ef0899fcd7f4c4c833f22e623788eb07d7100016b824"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(popen)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_line_bytes_underlying\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7766cdc60c90bd8b4e1b03b5be7a1e7a6ba05351611592b6bbdfd294e8c7f9b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060getline_universal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f58b998a30a67a0d950f95ccb4b435b038008751853d64b6e9ee8be288e4f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::get_mut(file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060seek\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/io.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c6457e38824773c0a49f1428ee4b697da57b723302911357731c2cf3f5a8fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060alloc::alloc::Layout::from_size_align(num_bytes,align)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/ivar_table.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a108622ab780b07190c89b3e749076280e3df782576404932406a0401c9f5bd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060alloc::alloc::Layout::from_size_align(self.cap*elem_size,align)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/ivar_table.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"851e2ccffcfa1946b16b7d7f82f653ba96acda97b3dc9b7f0ed1c6bd30bcca3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060alloc::alloc::Layout::from_size_align(capacity*elem_size,align)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/ivar_table.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f20d6c249ddc833df77ab265aaae9af3aa48f153e64cc685799ad883362323"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.at(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_s\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/match_data.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75234e0adfdb0dc3fecdf19add21cc8fee613396051e313b15696fb13fd9614"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.at(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inspect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/match_data.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a2364379a968c0afd1b1eed14ff02f3f9edf09e3db322d6410521ba6b299d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store[self.func_id()].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060debug\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/method.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70f58f69a451657b31bcd61154136a5980edfa18bdfdda8a6f8562f7975c91a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store[self.func_id()].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_s\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/method.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f89f69f0405eb777ef5a541a1bf9051ad8dbaaf99983d182a9028205db7dda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store[self.func_id()].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060debug\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/method.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1170e42399f84e0228887608852cc2e0353b690ed973425d765461dfc9cc2a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store[self.func_id()].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_s\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/method.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8364ed740dc6ded6302c71f17c395b2d0b029a6b852f0dd8d9805f7e08a80efe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060base.superclass()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060splice_module_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/module.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9506812848f940fd5c8e81a390269e01b3bb1db786a8d90e103a419444f66bb8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060class.superclass()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_real_class\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/module.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f56fc0c2774f506b65900f00bea3939ac81486e62606324ceb70155622c4f5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(Self::escape_bytes(text.as_bytes()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060escape\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"1743c0f54a40cb9060e12092f9ab72c33bed25dea9a09a0bac900b1784d3ebc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_u32(cp as u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060append_utf8\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"77428545f3d4d18d319b69de4fe5747085830d787695a47ba2eca8d68670372a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(source[j]as char).to_digit(16)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060has_non_ascii_hex_escape\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec66ee891cb75e1c271a165b6f520a2e54b87e7452bcdc72d9eb0c2a2ec21ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.text\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f027f3fa94a25283851da8a8d8245db8f5b752b5ee8ea4cff0d638bd030ad9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_one_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc03f2fbe8be2645483cd2bdc701e67f142069953e3be0c70a3220a5cf71400d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060region.pos(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86f354a4bf57c32152e3102135771045c3c9a76f41f090b84eaeefa0f922867"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all_block_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0675cfa7c1a9d1ca22b65d26e8e0e9127f0eea3e4da682260d1fcd78dfb0a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_one_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfa0f7c823ab8af85a2a5acfa8f8db80d17997c615ed9c7211e375a58364313"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060region.pos(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all_hash_plain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b81c0ad37634b52fddc2c1777fd05a9c7b19b592ace973499b566169cd7136"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all_hash_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d84225e16f1e6835f156decfe1e9726115296bfa156fe11d9c7c9afa9408251"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.current_match_data()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060match_one\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3625}}}],"partialFingerprints":{"codehealthFindingId/v1":"633784f235678b8a7bf5fe52be618b310c72d74c03e91304b64c10ce65ad3113"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5c0c965920131d5d071b95b6657a8e996386f04d80b4781794e863a471fb09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_repeat\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1560f15b0e40923914f376283c9ded17eccea0ae09df9250dc14819d4afe2140"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_once\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"053123444e151b361524683a65311830aa8aaf9b64c6426686783219bd8d27fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.buf.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060template\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":4202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d8dfcf3af24dc5a1f682fdda364eef4c4803a325a6653c553a811557123053"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.buf.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060captured\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/regexp.rs"},"region":{"startLine":4215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10b73d506a1e874fa089eeb4bebd272ae5d7e3f255a55123d9cdff9bea181d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mbc_walker(self.encoding)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060next\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb84312e38debd19151e73ad1ff5058a7b21fcd0d255651896e3e6c363dca742"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060head.chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060precise_mbclen\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e10f94a8c258a8737a571991bab0d082be4e958a6d79b2bec3bb2a6a9c95f7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mbc_walker(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"35022f95da1121bbcded36b015d0de74b2e4608a731c9af77e565419621c02ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022STATELESS_ISO_2022_JP\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"495d37418371acd85da514035c6ec7add4c2cc996969860c66c153cab2997a5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022STATELESS_ISO_2022_JP_KDDI\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b8e442729b20c66fa2d6b5b568c510418aa6a0d5a61ba733e4365db865525c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Big5\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2675}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e5d821425529e1263c0b61e856b6df9e10d108452acd5db3bab5944f9c5683"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Big5_HKSCS\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e847fe4e6b99d693f81d6a163af91117c219dfc8b978eb19bb9f6f7be648fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022CP950\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8e4c5b996777952a8736d0577be39eb37bc2a19441ced38bc8ad4120d3eab1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022CP951\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"341943444ebeec86bbd93351dd497d49cb7463d84310509c7961a62e2cf40327"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Big5_UAO\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4de4a20ee639947f5ea5345207df0361ac747a0323db54b64179a7ce41c1eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022GBK\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"446043ba6f29e85709203608bceb1be2a0910201610f558ad6a2a9ee01db21e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022GB2312\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f62febc7b585281c36ece01413a06ab02946fd5c9593505c2ce9b7b262f9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022GB18030\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"83590f6061609e1eb5c036e44f80a60c3cbd5311d4f8da41419a3d7a42d2472a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022GB12345\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b643ab16165849e57d09ad76536f9bcfdbd2d3ac59f3cb8bf2d5a2d6116a90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022EUC_KR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b508f39522d1dadd2906bb12a1f656edaf0677cf90b4efb18c55ce94c12245"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022CP949\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a53712dd88eb6626cf677f110f29f5eeaf8056f0d46f62d71ff7a600b7f91b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022EUC_TW\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"192e1e66ee1dfbfb3a8ad8cee32ac973e390e1c5e45feb1c7dbb16015890c856"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022TIS_620\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f3985c1cf1ed7aef73ca83237b5a8b307b9b593358e723e279a9f7f2677f9d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM720\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a02c19c3e233ab56a6283da8b6fe05343cd302afe035f819f138115933c2985"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_874\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f99c5726647a80a3d05297b3761a7df2cb9e8ca081e2bd704bb88f8bc759d6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022GB1988\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"057c57ccae1ccd9446b7ca99622426bd980f3277be1480ac04eb972276271bd0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022KOI8_R\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff74a9301f345a73207d34e56bacb76c1c2d8bb3a96b7fd4c81695914cce01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022KOI8_U\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a21f1e9b5db09fd80c359302e11af11eea34661ec00e530361f062477c736f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1250\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0eb32927b93e175f2065cd6729b9e29993db44eb425d25c3aa38775db2aa19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1251\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de5d856c71803bedce45c9804fe7b14f3277883969a3a1f13374552c87d7d09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1252\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c13c413cd557d691d0f7491f66319215e662ec8ea82102798bfa1449f2ec7ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1253\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"27237487776924cff2c3024bfc07f6e9df5608a6e8a3dfeeefacf213ef6eb607"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1254\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f1ee0c326abf4b9184485755933192426fb671925ca954eedfe061b279977b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1255\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b76cb063bf5bf766b979e30599f657d9b33b669346041952ad3eb6844d3b59e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1256\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4e40c96319c91180b520ef191cd1d18bfb537e0d0d90a66b2d8f710a7c9e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1257\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b55dbaa20b341e222f128a788848d612cd8e811aef168faa7d82111e7f0672"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Windows_1258\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b32f571226dfd7357858386788de9842be22d0a80a48937f5399265441a256e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM437\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f8839eb875cd62bb0b5badf879a5862a1698c379e684ac03007cfdc1a684a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM737\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bcbca36b5d57a56797335be8d6344b8241c9a59906f80209330116fd511b2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM775\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cc63ef7b1f0e8867363ff336cd0df5aaacf100cd7261c5b7200a9a592f64ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM850\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc73743561e48d3b95967ddda8d7f5810dc57718779c38c7064445b6069aa67e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM852\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2738}}}],"partialFingerprints":{"codehealthFindingId/v1":"078dde2e3d765ea7953f0a4464be132788427d3acaa9b609af777ea66b7f904b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM855\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"249bd554dffe6e4c1405f16e31f4616604e12645ad39a221ec8c409e5b1f9210"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022CP852\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"596585bcbd309f15b5c27a10a24731ac1d324eef29a7696f4c8a28615286c048"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022CP855\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ae86767ef008928aec5fd8790c9ff683d1e1038ced85f9bfc3f4ee2e61d84f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM857\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c90dd30697b77e4863e08c5aa6417044d3274e9f070c8a29700a79c60cf3ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM860\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79a6ce29798370ee5dae3c4507167b992e017957d450bf1a767f84b22fceb8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM861\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c6802f1dd295f7c9fce680219d3a71177abc7e6da6a504c415630c230251fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM862\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7610edb68f68379220874a6211adb9759efec7f5e6ee8a3f24ed077570be9f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM863\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0e975849657efa702f5d433465f5e0bee8e4b932f0a4c8b1c7ad7f14d4951a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM864\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8e1322fa3c8d5b97c2816f3a18c01d7ca7d36ed6dba6bd8da39c47996dc8c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM865\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba518606f7560383a0bd0004db98f33f9315a85df631e751a5409fd15bf04807"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM866\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a77fe584f673fce687bbd7447f7dc8289a95a8c3a7a1953a04a71d7a51ffc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022IBM869\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca452327a975fcf00bc979f28228a63d863fa15f244ecf1707cc8a4854a0c184"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022Emacs_Mule\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d59e1a090e0b74515ee9b44fcbafe37d213bda5eb9e7f05765a127c99ac6b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacRoman\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"472d464f88f9f436ee43207cce2ceb9196f07d61d78223f4e7b692a0894d77b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacCyrillic\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac91fe247dcece2eac5b06ca3bb91ee0532cff444e1437a8e87a85d3fbb1d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacCentEuro\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc810d666d8ccb5dc8f869c3c14cc995276a4031f9f1a73db088f9e5e499e4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacCroatian\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"55093a741dda22ea4337b264117902db961c103e7bcc6a89dfd41604ce379dc9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacGreek\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc4f88b5d3db4a141ce47c20d2f4149a824edd8e3dcd93e3b799c225e2a2c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacIceland\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d63cc80693cef0d4c275cb7f2e6abed169bf59497f0e2e2d6d3167d162f70b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacRomania\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a06aa22095b4c0074832eaec4043346d97168b58e08f08317cd928aab9ca2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacThai\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"5802d321989132239dcedcd6582b738cf765b50e4be6cf566c80558a045de1db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacTurkish\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"177f0adfaade8f1c4346d119920ef040211ec7dd90f363e97bc2d662ad49ce84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060named_byte_index(\u0022MacUkraine\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"5517e38f07d07dacd26b409b39f733b842cf61ae5d297e70aeb72acb3ad1d721"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.partial_cmp(other)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cmp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6fe2f47a46c511c96b616d65630f6e48616eb01b4e73ae72234650c3dfed24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(src_bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060transcode_bytes_with_opts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6389}}}],"partialFingerprints":{"codehealthFindingId/v1":"faefd43e9524176fedfd94f4fd4227083b2e7161a3cc0c25ef55a52cb5ed5838"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decoded.chars().find(|c|!c.is_ascii())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060transcode_bytes_with_opts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":6683}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f7661f8c4b89d78074ce354ed42a2a2ac9478f4b529eb53cc2e1d1c3e600ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060carrier_base(from)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060carrier_hop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":7200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9572d0601b803bd0f90458e848a878a8572b8a3f631674556c61a922406e9b34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060carrier_base(to)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060carrier_hop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string.rs"},"region":{"startLine":7201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3aef1507b57380be035d2d2a3122f1c3580f1faf2cd40e441149a0cd2ab4c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Layout::from_size_align(THREAD_STACK_SIZE,4096)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ba11e552fa60dc4ad5c4ba7d7aa889dcd3a6f54dc1fef0885de4273a74fb7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a78ba8b89f6d313ee23059edf9153cd659bafa99df96b1a4a8ec479fac538e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Layout::from_size_align(THREAD_STACK_SIZE,4096)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize_stack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0154c424ce324e065f8a53a12d75c6f9c8ba33bf17dc2e07422a980541106262"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(stack_bottom)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize_stack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"406a5f45625d08a80805a0ad66282ddf355d9b43088c6c6a552ae30d98526cce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize_stack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b3560f4203594073f3eddf30ad24be83355cbaefd265dc0aa41f2d44de74e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060take_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/thread.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50daa2f5b5c89bda77fc1d543188e7ab04f8679d5abe774879dc232ffaf2e58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060at(s)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060base64_decode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1afae114e3e0be0e45a2b3a3dda94a1a77280df609f4d712bb5b367bd2d6a21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060base64_decode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c79fcec6296da7e162c66a688f4c8d63c61fddae3b110698f5b43ad1e34f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060base64_decode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7838d286c966e2068f5e908eb626c4f57c7abb072d3d0af444f3ae1363f6cc1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060base64_decode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c39bcf2de63e9a58c53bb87bee4c3e6f0f3a7d78f09cd2922f203ba1d1b6ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(\u0026v\u0026\u0026mask).to_u8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ber_encode_bigint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"961cc5b6c502ca5f2cf4df1cceb303b46c6897b50e8d638290920d9266a4ff74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(\u0026v\u0026\u0026mask).to_u8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ber_encode_bigint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/pack.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf3d6170103dc04d055436d3684ddf8b192be7de5871ca22a59971f24364e01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kddi_cell_char([bytes[at\u002B1],bytes[at\u002B2]])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060kddi_read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e63536314afde4a561e6e34aa9eef1cde2c7acf84abb2429ac1e07034eead31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026rest[..good])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mac_replace_pivot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1bea310a456220dfe117769481bcf911f32d6aa0cccadef0ac27f5d55e5612"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060marks.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mac_replace_pivot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5042}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce8ae7feeb2c3a73a9e73be4b732071ae0867e2c2078eaf27b5fe2c22100d0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(src_bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mac_source_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":5122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a45750ae831b7aa41609fd3b4a3a37e6de694500e95c859d69b494b1cb6278"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().current\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7487d95b30883e5c853a4557a2c6d0f815ab5dce591e4c282a7b9cb552c9e60f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start.gvl_thread.lock().unwrap().take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060thread_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"3606be7bf3fd2f57a284bd8c76c89dc369cfeb49b3b2cdee436568c3456d9e5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GVL_THREAD.with(|t|t.borrow_mut().take())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060thread_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2907170ad32c8c0bc309ca9c29f43e3563a14df99945836ab01aa3b0b6cc96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.proc()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c8619b837b14b95437db1d98bde189f22d5d72384defcb6b257e8f93150af7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.proc()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a89e82e5ad99c9555f4ebbdc2bec2bd42afcb4cd745ca8fd5141d0764b9028"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.parker.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060park\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a253762c954a8fb3a813070fb95c2512ef12b1ae8dc58889a5d1f7598dd44f99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cur.as_thread_inner_mut().parker.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060park\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c6fa991dfa905987a9d3472103bdce03f4d5b75533105de881f04a98dd4360"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.borrow().main\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_deadlock\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/scheduler/native.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9032b19ff070b5416e9121aa010600a978f372037791c4320fa2c70c164284c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_program_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_top\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"086a8b1ccb254c610ea1d909bc160f8befc72057670cd4f68252cb348f778424"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_integer_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"450eb1763321054de45c1852d5dd9feeebb26b5e145c0eac30cbfb237b2473b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_float_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c6e1c4bee17bcfb8b0d9a3b55c460e993f126d7a782b0aeb508ce479244f23"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_string_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5e698d392372f85e91da39ce1f69daf7a2ea76760e034fb3060c6e6e924d48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_symbol_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdd5b73c46166a411261df919f11cb58637344271d61a759fc68e6b32c8c286"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_statements_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a57628e13f26e6527450e5763525dbf40740c992e11d3d6f069d836ae4579fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_call_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08184cbefe80e3548f33ffd69e8c6cbb9ca13ddbca5d001c008d955d7d6b8fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_local_variable_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e702b13d17a173917e50908c5661a1769aba6d53a27974bdcff1ad1d12baebf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_it_local_variable_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c12cc09aadbb6804adb4fcdac68a4d601770e48bfc68c00d19230c6cb87615"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_local_variable_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8392d356cbfbcd698cf2c26b5f43b3b56158b4d44041a3f45ed68e1e4ac8ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_if_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e0498c087e730bd58907dd3acb4847dffe668add052b60949dd2bc9c9f239b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_unless_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e11f8fe86ae3cbd9303ce8c0190a970bce5f669d255b842210d0b1f2e0ac5df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_while_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2826b14d76ce7ae913374c2254db0d26edb23dbe6f1289af422d935ab8b0e85e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_until_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"877edbcf079ba329ccb554f0336afb2b21f510be00d290e6d9179e5cbf644cab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_array_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ef74fb5f62a70db24adf2b9b673e511e11834f18bb45f74e7629f3df6e0ea2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_hash_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"94739971ec4d9c73c0a7b173df54c91c9cf690bbbbbf86e7af6f3e658da9756d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_range_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a1fec842ae2ece33736384b8a59c13f45aca1da8a9cebfa24c518792b56efe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_flip_flop_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"129dd20214d11096480a440a24e10268e0fd58756c17e3b21ce903672b6f6ca8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_parentheses_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f189f3b6ce0eeb9c63d8c7089db8053e2bb85c91ab24b6a8807510735c8c5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2bf5bd5ea09faead80ba7f257e81cb693b4164c75fe35e929a839fe9a48b53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_def_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da8ee7ccd0011f96074ad39d3d041fc205a37d4843495ba86564a7278166c68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0a87092429dc8e57816de0398a1de650eeabd0dfd545d17755d2901ddf0494"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_module_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"732b0c1f8bf307572344458d9f5c3229d59830a07880f278b0b1689d6e2277b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_singleton_class_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa86f3150cc9b5c3ce538501da9fc1781874653d0209e33a8590bab5d9149cc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bf966b9ad0e56bda01d7ba6dcc99f2f51354457063ce93e71fb1a3ac09e864"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"045c80e60009f20a1f6e6a94e6031536ec2c476a990119c200a376f35e4d88bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58ff20dfbff64313b72b8b5a9e9f75f4aaf45aad60a5ef2afdc0bbdb580a34d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_return_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af7be000930b8de3c8a540290fac48dd3d0eda761529c7990d6b6079d5b89ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_interpolated_string_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b09607399d3628bc94be31f41f0a7a21fed8af11eda308325540d9978821aca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_x_string_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca063f43e66dff19e9e110e4ee5d528d73649a77bd08afc2ae0373536497cf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_interpolated_x_string_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d641b9a06a20271a085bcece8f65ce0be131b12e89e52de3a9a82db604f73f91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_rational_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb12441db60e5177690f73b0fa98ea5c1ef4663c1ed949b5e2331765c16fcb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_imaginary_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dc0dc3509a01b81be08d1b0806807c5abb718e06dfe142a78346f33e68ed29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_interpolated_symbol_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"781f6ba2434bead85da5156d48cf5ceecfbc4a7100ed32f20baeb01332514d49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_regular_expression_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc9cd4f4f89d22ca8e0d85d80b8c16b019caf812c81a7046a514e8b1ae8120c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_interpolated_regular_expression_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad119aec8fdd8a72a853157890bcc8c4b241283e38bfc6482d411cfdeb21084"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_match_last_line_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"597c4d92da21f7e853997ac778109c789742a9a2c415d89c11e64238b458a52a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_interpolated_match_last_line_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cca20a894b26c78a27a2f21152ea9bb95ceb6545ac5287604f1d2b6c4fd9dbd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_match_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c221f226ec5cedbf4bb723ef6c034cdac0d1bbcb5f4084e7634d06e1c33a80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_begin_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ec6d86c8e29227c5c9beeea3079203d844e875a811798c09aa8d248275cc68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_pre_execution_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff49c9f2ace7d4d0ab8ff67ed01984704530688961e7d8bc98058e214fd47dce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_post_execution_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97512f6301dc255084d3ac2efe423a51dd52b910cb242f5d8e5325bbd87aff8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_multi_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"354f6a747f6de0406b026f5cfbf90452592385ba275580b40a33c3798f369732"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_local_variable_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"200aba3e3d5870df13fbab3af2d26eaca1248e365082fa35c1377c8f9e117d7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_local_variable_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c68f94db9015b5134ae1913ed3007edc497865bbde7cf540b23b02e891f928"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_local_variable_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c03974d3987d6ed07a40b83a9c758a02a11765a3f823020bc8af65be81369dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_instance_variable_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e989d7fb6cbcdb8502a43d67a14f9c808c9fdc66e6dd02de1d93b4573e4a73dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_instance_variable_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75a6d7f31e890af8b71aff03e158bff2aaaf69959a360fdf0fd6788b1ea0f31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_instance_variable_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b35291164b1eaa6de7aff962889bb541e3473310ba774a997dcc6a86f4004f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_global_variable_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"416cf6542f8cbc354dd5a0d00ba9120534cd0d7a388dbf79cf981546e38f2bd6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_global_variable_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dae97ad7f15d32c86868903df1c59be692d0a9636abe2d2bd721357d016c6e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_global_variable_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7658240b25deb339c5e2b3f0232f93f3808ed068cd991e4509eec0cf27e5ad8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_variable_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca2c240690111322ad38268c230ff21df9140264044b58972c0c18e398d3650"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_variable_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1657bd83fdd757f89632bb2edb47b50fbd671a153a29b06e371c8163142b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_variable_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1202e080559cc1376f9286839929bec9d3c78cdcb5b8fa6cff652243886754"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4742b9f17a770273dcb426a6590c1704096649c300e23949e85b512d0c908233"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27f35201599662be94355df168c932e9f74d03335127aaa252bc5405dbf04db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_lambda_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f6abd2f4cfce4b2f797effb291f99fefe6d9e8f2d694ea8dc987446cf904d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"37643898fdb5695095d62afa76a894cc040a881a832dd6aaa63188fd29813887"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_index_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"049e64d4018908b7a54e4b5fc3e117ba5c8c79893151659509478b0e04f31d83"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_index_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e88b5a91e107aabbbe7128077e0fd7c9e8cfc748ea8ad2aab3fe146879509f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_index_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a55287b24b88ceb4fa2456fea2255a45266cd216b962f05c5ca5858f94ea013"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_call_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"727cc73f4b40599cb14d3ec3da78a774cc6480a4a5dbd4f78174508fc0a9788a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_call_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14060de2c06bcaa159252369dfed93b1dbb3c523ca0b1191797fab169f3bb72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_call_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c48ad1d26e8c3251b224b28a979ad6ebebc48ac2a9fb5386320e6e61c82e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892f86dcbbcd3ff311335327a85cf4ab165ebdf1694a3ebe10a5fae60c70764"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_operator_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ccb7be76deb5ba7cb35293782726f464b2613a02dcb0c41b0af5fa6aef0292"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_or_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8a5329f856ad6679a687ce15a9990ab92f9128d4f1741b4be63f62927ba029"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_and_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9140ed1ecd18acc865289b303b9ace8fad8a7eecf5f99f7430011f67a7c22c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_super_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"42410ae7399051df36312922704c7c4b566a043ed22d29d5863d81eb3ac951c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_forwarding_super_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb5b3080782f3325ab0ca479c30acc8ed109a95cee97f45f6f7ae44773cc0c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_yield_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a83ddfd4c1dda2e27b913131eb697463ffc4e776755fb2bd62e34c9b2d73e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_for_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98a19ea2a487c5b822bc1ee3a99726cf15e97b59a62139e5dfd8ae11dc32e4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060index.as_local_variable_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7a7a5a05fc968b6a97e2031bce27de0ea3726ca014ae5b8ea49cc99788cbf4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060index.as_multi_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"843950f0db0f845104bb969f26cb4166825e5f132d8311c7ed753b40c2463a8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tgt.as_local_variable_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21dba56d581ea361b560727d1ef3a89a7dd9db2c0edb6aa70ef61ebcd5d48e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_break_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b88de8ac60aa047f89e0c4d3c40b4f7fa31f7de3e3bacb14f688afdaf118e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_next_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"766cd074eee5890edd19504dd1307945c6f575703d2515542702dca502fd9716"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_defined_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f7772da43570c18c00f0680316aeb38aab7b33747358317508e824d0c0c4a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_alias_method_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c922817f579e9b066cbe895e0a02ae3cc174c598bce722ef543360c6f68f5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_alias_global_variable_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"2156e1ec8ad049d1bc0f925a06faf84c742d1b29a9d0dd76eb5056d8784fb7d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_undef_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c6e07462272114ff0273f5a67ca2a6debb763dc6080aa8449bf7ce461c3bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nodes.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae4d2afaf06f038532db76e081970878bf5aae2e518c0f72f2c6be5e4fff5e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_case_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd5b3aa686b7736d2416cdca720813d5463ab3c76c54623c60488bbcf2cb5ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060w.as_when_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f17056a5daa1297405572f9dfb2d608e56fc35b102e9bba2fe4d3d9b59d6ee9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_case_match_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5caba64fe49294b95f7ad8c7ab982d3570fcb376c96dc55520ea500c3dcb8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_match_predicate_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b141be58febd6ca4393e7daecb9497361e316ae73ad0326d3ee462189959b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_match_required_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"484489842329cbd7a159883c78ae476f232e2731c79b7294fca383ee739bb0af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_instance_variable_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f500022db3a9300a54abd88aed1e4fde5fc05cf0056cffc38df3b6f59c4699a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_instance_variable_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b45fd494aecadd1120eb4e3aa4e215d6f341d0945ca38728ce2144e5b70ba28"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_global_variable_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54bcb575a9ea1f94ba004504bc203e5106ea16311ffe62e77f4c3f2aa1c67f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_global_variable_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47b88edf6bd4a5223f5947deecf34ccc043fcdbc5620425e89b56973730b535"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_variable_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2fe50d10d49ad3dd82db7002ab88236f7d9cce8d650b062a28d456400fa543"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_variable_write_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8062739717e024411f05cc1d0799d81b775f2c0a50262b1023f0195cabc9145f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_numbered_reference_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b0d075b2601bbfcc72719b67d254c860668fb3216ca077cc5adadfa8ca1c60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_back_reference_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c1d7a372ce4ef0656874d96172ec4fe3c918a78c1ee397e9b8b7ef427ae5b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_rescue_modifier_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"342e8403614d1c972cc034b683c4c17903c0a183fd515192432f8b55c283c706"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_and_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1209e0151b74da00cd94b297280b22b3ba1bbf1cb70f7498ffb2b270f0233caf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_or_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"46930b490b5633aed30b6dfb2ce8df88fec32bc5d657eb44ba96f2d60f3e6215"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_implicit_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3bb4dd6479b5f9ec46eeae1cfc29088f2136466b81e642795165743d617d77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_shareable_constant_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1563517b81da0aaeedbbccfbd723bf3b5a58104303a440327ddef635ec94a0fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sub.as_if_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_if\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"04314dd0a1ff47e14514767e5515fb927035b4b414dc708c8f55bc949237b13a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sub.as_else_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_if\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"0165541f084e703d13d0690ef06933be1a64d6dbe4e91f5ff062157296859f45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_keyword_hash_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_array\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"616cab4e910c02cad231840fb0871479801f41cf54d6d3c5babbdbfa450462d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_array\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"586eaeeff7df60b65c9914290943fccaa78b37eca2350be5475f78ca6e314eb8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_array\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb0c7363f7ee20f01f5bc6a675bf4c85257e7736a9529199173dffab64e8638"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b81dfb507c92f6bf641dd868a7ac053e7de24d84deb0e4518d1b41bd7d2f50"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4503c7c69b7f2374e9ef26dad75cdf68b8ceb6056a7c039aef6013333f9b9d07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scope_wraps.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_post_execution\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2813}}}],"partialFingerprints":{"codehealthFindingId/v1":"009bde0f1f59461df9dc644a3d419874c791f0d71af03a81a6ec25276fc1a5e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.as_statements_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_compact_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a83cef981edf9b0bb5cffd591a3d8c3fb2bbccdea8f9647a217625d09d187b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stmts.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_compact_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034b3b92c594251bc653b2c6440bf5de1a8d5dd44699e0bc6c7e197b3e9063b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.as_constant_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_class_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f60eeb22e525538ed15ee9b9bf957f82e8e99ce520277dc02abf0f3ede5837"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.as_constant_path_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_class_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd6727a25a6f81141d8cec1f05461e7306dcf20dbc9fe95b3612089b8d3164"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_read_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_const_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adf2fa9b10abf58454a470801a86e61a2fc65527e334a6b74f51f4078175fc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_const_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b033bc1dc1fa42174b2e49310d3e2fc82c069bd6dce2a11e25aff62ff72b194"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_node.as_block_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_call_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd73a2fbe90e9189c1f8268a6ba87900e6e84400f0aca8f0cfa568806b9cfe3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_node.as_block_argument_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_call_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49bc2434c0575a50e16cd9a2bc0d9bf92bf4990f98e8f43e8f3d7005cf64067"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_keyword_hash_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"625b73c917ff0501cf10a52c262cb1274c0707105dab71e0d093424e5a0156ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"308199ca7bc9604987f3b1399dcd8c2f3ec6d57f96d061a7d92874725d5a0b3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cf4f6ad90f8ca90da463236d16efe7ca75b85bcd0457f323f5fa923a886822"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b284e34bcb70b04b67b3278f4472e10c19a1c7481c810f8dbbf3f475b2d7eee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"960aa6a642e65fafed26d44b6f22eed911f0c05a8d3073e29f7c156b34c3ab30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060key.as_symbol_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6b07be486da803c33f03347475fe7dfed3d0821365e1cbe80f9d14c4e402b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(s.unescaped())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd9c07b2359d322d69dd21d0f5bb82268e9f9318cbe4d8bd7a86e35d6d3c7de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060elem.as_assoc_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060collect_call_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef342224edc393b0d3445a83017337adbee44b5e6bbe1d020983ddd26e56457"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest.as_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_target_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0a4f89f4cdc861da78c288130958b5471bdd642384cd4201341ba75cf024e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_array_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_multi_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"91657f11a4fd52910d9a9f0d895f763db880c28632375e8cd58e6d82e2706fcf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.predicate()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_case_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3668}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b124f3658fa570febc2f45d3536e20160b36f504f99442ba63ec6ac938861ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.as_in_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_case_match_branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3708}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bdcfbb4550207a1172b69753d34d9cacd4b6fc992cc23a8fe161a8d5313a88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_array_pattern_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d69ad0b4c422ef073434197e1cc9507167c339a6cefa73caea3d2cb6436238"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_find_pattern_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f48bbe4856f17ca3ecb7bafd81ce63cb7ed4ac7a8b7a7f53f00153bc852d32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_hash_pattern_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb22a102bd9f88facdef194d2b98bf88a5c6871000520ba8948162b1b85e6c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_capture_pattern_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145711a9942723726a76cf83e409a48294fe2ff353855d43f8280a963225ecf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_alternation_pattern_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3781}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51545b246b494310c71dbba24a648b25fb5e351f9fbc406340e073b1485c0d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_pinned_variable_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dcccefa17fc98be7eee3e25a08c596c955bd5990cb13dc090daee614de7eca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_pinned_expression_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669ea8114a9bae38b2f10e00a1f0266843a6e4a57aeffacea823bd61d34122f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pat.as_implicit_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce9d1fe8f6443e8bbdccadbfe3313ff38a844f76e8b7226a1b08d834cf10931"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest.as_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_array_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3905}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b5102e071d04f7b0845d4d5d2b675d4514d82873e25fb81d5fb633f9270cf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.right().as_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_find_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":3986}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a208b19b4e453bb9094e5e5581632959ff782b60c3599fce34fca7b3c86774"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.as_assoc_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_hash_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4044}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e51058ba52ad6c57a9e07b0df0dfec95a5c8d3d07399d67b95251e88ac8dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060key.as_symbol_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_hash_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6190e8b1f5ee2ddbedf603f855b00d8f0d6bfde456873bbd2d4e97c8366afc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest.as_assoc_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_hash_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c216d2b753ee91604538ead980bf5b7969e4804a4499567f6ceffb43d414ef25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_local_variable_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4193}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a532fd27ec7c1c195018e242c94a604563deb15d421209b259cbcdf00ecc60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_instance_variable_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd475f14cc408c87dca282b40e735cbd4041d8b52f3a268af6574ef8dd51646"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_global_variable_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cff1a2a86d3dbf72541c7441f15cb3112ee4039eabccaa5fe0b5d5872096e47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_class_variable_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4218}}}],"partialFingerprints":{"codehealthFindingId/v1":"620d5bd011fe19923efd511aca279e9c78606c167b204b6472567c557a90f74b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4225}}}],"partialFingerprints":{"codehealthFindingId/v1":"491cf0d8b2aa18477636eaa095b8283f9b7d9f68e20174dc4e8ee64e7dbf6381"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_index_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22ceaa1dd3d119ad47caf221a85b66e318196bf9c6d43743b559d61c4e806bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_constant_path_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd5268fc1fd379a7156715444079c069c1fe5de90cf217ceb8838ecd50c391f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_call_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eec7d304c6d71e1c6c4834fc8dd1dab409bdd8151ea4ed6ab77a8c05a3f5c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.as_multi_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_assign_target\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4326}}}],"partialFingerprints":{"codehealthFindingId/v1":"678015f635ea3683d6ef40cdf63b4a7dcd98d713f015b32ed82757228a05209a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stmts.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_statements_compact\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4441}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a4c1221f143e72623a4e1bcf763915ba13d4d729fb89bfdd2b963e4b13481d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060part.as_string_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_interp_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fd6da4f62768a987efeac88124ac16c17d483c622a1fa24acf82858ce70156"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060part.as_embedded_statements_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_interp_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4501}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f03af0d105f87e46c4628b0a28c467f8bd76ce247516d747f03a6d06e698f07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stmts.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_interp_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91cbc4a11a0832fb1f6c5ec1107c13df18f7e827b03b634a8067c0cd2532ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060part.as_embedded_variable_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_interp_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdea028e88f252f7c4187a627917be42814761686c081507e69e504cba7cf03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060numeric.as_integer_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_imaginary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb871ae0598065a8d6e48003fea3cc0d19e6c19c5bc132610bc76a27357b1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060numeric.as_float_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_imaginary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4571}}}],"partialFingerprints":{"codehealthFindingId/v1":"17198a19565500bdadda65b7232288761f6de88e71ec5d22b2589fe25ded77c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060numeric.as_rational_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_imaginary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4578}}}],"partialFingerprints":{"codehealthFindingId/v1":"823a4455de5dd128b99f205dcfd51ab7cb736431dfd48b9bf61476adfe824901"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_block_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_lambda\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4825}}}],"partialFingerprints":{"codehealthFindingId/v1":"81153a7bd90b162a7d283dba27711b4de22bc7a54fdf98982155925a6b57a2d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_lambda\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4838}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4749fd68274482f64c16e9664c71b83c028dd8d30ccd372dfebaad593855ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_it_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_lambda\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4845}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa138519333e0d782ee971fdb07df5167e15e8f4efcf761346ec00a6838e678"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_numbered_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_lambda\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b9671dd37e7eb84fd9a4aac8c8c7fbeab4c6d962e775ca0bee42baf4e6d6bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_block_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4926}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5313c5c7b075d464dd2e577262d57581dad5ccd667e294e026ef5396f32cd6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_numbered_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e223a66ed85d640f7732d44be9ba0e2c62a0a71f0de116c0d65d4e5c14414c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_it_parameters_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":4971}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa96dcf0067e61c3d4b8010ec0c9a67e2ce17be335ab530a7620da2840f49f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060el.as_required_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_destruct_el\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5027}}}],"partialFingerprints":{"codehealthFindingId/v1":"98afaa570174971ededfb55e1f4b8fa0e38a26f607a9a02b31d1fc96db649c14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060el.as_multi_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_destruct_el\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5033}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d5a9feab588e76ea18a9b105590e4c654ee8eb411a521c3e30b70c038ec010"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest.as_splat_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_destruct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5056}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7b549c05bdf25d5027210b8f74847d32ae5af445dbb3fd7db2062adf0f4025"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.as_required_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_destruct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5061}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cfe287cf183628dcc3ff2505ce90af5ee9ec7b915a41ee71a3d497ff63ae32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_required_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5102}}}],"partialFingerprints":{"codehealthFindingId/v1":"952daafa9e1da2be417604474ebd024507c748a948e993608884f30794a75985"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_multi_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5117}}}],"partialFingerprints":{"codehealthFindingId/v1":"15673205a1a453d0a3d11d38e8838f88f2573d64670a5c1c93a3d52e14cba646"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_optional_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5ab797cc1193661197cfe4adf7fd3c0af9afbd163613f9eac6471be64eb124"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest.as_rest_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e80fb816deacdc2de6306a2be7f0e6956bb99afa4f622054afde1e7d40d4ba8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_required_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5194}}}],"partialFingerprints":{"codehealthFindingId/v1":"863454f0b546d82e3ad99b754d6cba2168f94dd30a7fb983e3c92539b313ab79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_multi_target_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5204}}}],"partialFingerprints":{"codehealthFindingId/v1":"249bbb9e28d398caac12fb2daca354065bb271ebfa653cb4c3bb751bdc755551"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_required_keyword_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4345160202dc46fabc83641c09e9032b9bd14f5687563c7e257302153e14567"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.as_optional_keyword_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5233}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f8f1521b56114c25acc0f81f6149cc87c2b83d45eed6b2d81a581e9814faff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kr.as_keyword_rest_parameter_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f949a3a8e1224a42158bb3fd9e7bf0e5722435736f86f27234d0eaadbad5ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5434}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd90ee406d4db9700f1867ef5f5975b6fff94cf68e57b1bf16868d3daf488447"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3521f6ea7e7295e5a05af6538bcca7c918f02cc828ff8b6b40b9551753261f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060values.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jump_value_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb715c058c0a4206dcbdcb5dd293d00e7bc4d9fb4c70bdf92beee58f3138fef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pattern.as_if_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_pattern_guard\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5977}}}],"partialFingerprints":{"codehealthFindingId/v1":"17524e0acf694ed4e8e275cfa1b0d2f693ee0d1e697574bbdea326da509ee7c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pattern.as_unless_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_pattern_guard\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5981}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7520fe1c9650ea9a297b43a76aaea34214f559f430dce5bc0ded1acc5fc09b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pattern.as_if_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pattern_guard_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae5a5967155421a0f5ac09063ddd676288512b996a228c2834a047dbf7fd4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pattern.as_unless_node()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pattern_guard_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/parser/prism_backend.rs"},"region":{"startLine":5993}}}],"partialFingerprints":{"codehealthFindingId/v1":"051ade462eea67ceaf8f80e56abc732a17e836e34d75de4822c04ae97dcc461f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_singleton(obj)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060define_builtin_singleton_func\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/method.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc03654ef392ad84f6bf77f09a46c1f6b2120846673e6fe1a145910b7d54ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_singleton(obj)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060define_builtin_singleton_funcs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/method.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"268af205ad59ec3b89d2db8ed9b5765182d05cb3ed3f6d115313570928055c6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_singleton(obj)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060define_builtin_singleton_func_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/method.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"4addb16bed7a7ad2e073e7bd4c7dfc2c7540bc1a7e72dbcb9a15484f18f5e08b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060[i*4..i*4\u002B4].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060word\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/prng.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04542454bb14eb7db2ec58dece9fe87d65f958e22d01cd9e116ed89ae606ffd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060next_u32\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/prng.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a1bd0d0014b0c753513263dbaa89d55915a3a47ddad6a12a7bbd0ff517e653"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060canonicalized_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060require_lib_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/require.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65974cf5ce56ad95c5b0cb808dc3fb3451cb18a411f1c7a47062012851a3d1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022iseqs: {} ({} bytecode instructions), size_of::\u003CISeqInfo\u003E() = {}\\n\\\n             callsites: {}, size_of::\u003CCallSiteInfo\u003E() = {}\u0022,self.iseqs.len(),iseq.insts,size_of::\u003CISeqInfo\u003E(),self.callsite_info.len(),size_of::\u003CCallSiteInfo\u003E(),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060memory_report\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4dad47bc2199b963983ee4bec861692a344f73b3113308cc62d2d8e221c2be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022basic blocks: {}, edges: {}\u0022,iseq.bb.blocks,iseq.bb.edges)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060memory_report\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b2d04ccbdabb34d0af5beca8b18266a74554377abfb59e3a65f3632333923e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022  of which with splat/kw/hash-splat: {with_extras} ({:.1}%)\u0022,100.0*with_extras as f64/self.callsite_info.len().max(1)as f64,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060memory_report\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ef52355df241a467e62c6a3492087e928d82ea985404ac13fc63b729323b1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022  {name:\u003C22} {:\u003E9.2} MB\u0022,bytes as f64/(1\u003C\u003C20)as f64)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060memory_report\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bfc3c5e1131cadb13bba86954c0327f5d6324825b45861c6c429dff5645ecc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self[fid].is_iseq()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2a7efe085cb388970e5f9ea5e717a6a9bd9712433f3e401ec1b5837e33942a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u16::try_from(regs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_func_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"237aecf202af9af5de18731e2bc494c571d687749a4b4ab2bbdb2cd6f6cbbc16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU32::new(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7f1f4bbcf47fb8682bf766e397be07208258058ca70df7f6a0c6667d52370e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.object\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_module\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdbad7ad4d9716dcc8e2ed493bb9d8be4ef3c5d11e23ab78585abf325311102"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self[class_id].object\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_module\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec68b77bdd27c0a56bb0945e93591b19727c2b5988a23fc18709c7b409a6dbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self[class].name.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_parents\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76ec86662d544b748ac0ce96a4228d266de4dbd914efe329af942edc3852951"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_singleton(original_obj.as_val())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_metaclass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a3f9179683f6bebda615e3d66361808824e13cd6b5477df2aefbdeca749221"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060module.superclass()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_method_names_inherit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b786348e8d0f5d18ca2c4b980417d4486ef0e994128a2adc0ac5fe75d9e8c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_class_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb51c09e883c3dddcd852a183741a98a8e72c72be53ddcd272b04ccf88668749"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self[func_id].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_method_for_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed857f4437297a469f7b02a6f9db62056eeeacd012cc606307df8efcc650d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self[site.id].cache.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060salvage_const_map\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class.rs"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a181168d6033b07b6ade89242b85c8a32ce5b0999504561f1d0e97e384a41ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroU32::new(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f77877396f873444ab486d56370d3e404379e0cf0589926a0bc43a52373e34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.outer()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060symbol_to_proc_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb87f749d3dd27d5b811c301b5537fb69f9da6dd7a5fefcafc863ca1e39711d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060symbol_val.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060symbol_to_proc_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d727ff1eb700d9fc84631d2c561cb36b2495a7bf05fbdfc4524ec63ed24760"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.outer()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060method_to_proc_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5666669accd1d8e8ff0684a8b92a5c7a453c51b610778f0d57ee81e52b58c999"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ext.entry.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060entry_label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ea04b4aed5e8a719e49629dd30d8781b643a97578b43af3dc0e8522ce7a650"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ext.wrapper.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_wrapper_info\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c48b475a3e9194f639812219351c6df0af0c0014640b385a765e6a74a604a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.data.codeptr()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/function.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d35434a9a3b7b46d656eb655bcdaa4a921c5be76758881c66435c92e652d781"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.bytecode.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bytecode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"4283da51e620098aeac55605bbf14a0e7ff83eacca36c95856d740d983ea67fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.bytecode.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bytecode_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"5631749d040286ebbfa56a2b378e4868f8993f3b2812ebb8a8a90d0c7807d66c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.bb_info.is_bb_head(bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_bb\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/iseq.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23957b02c846b4fcf36235bf9236d72eaab6fdcee712f9fafc31800092a3f25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060copy.try_rvalue_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060relayout_ivars\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/globals/store/class/instance_var.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"69289ef94a0ce54f9789e8ab41e7948daaaaeeff83b18e109363f777c963e526"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060probe_constant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/constants.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff14ff439418c308023aed4106bcf8d54bf30454b9610385010010ddb238f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_digit(max_digit,base)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060neg_tc_minimal_from_abs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"977276235b50a6621f6eb90c1026b9f6f40a645767e410acae3a5485d774a8a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.to_digit(base)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060neg_tc_minimal_from_abs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"83661114d1406905ef84b83427120c5f66da4d99313d4279133aa85784454345"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_digit(d,base)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060neg_tc_minimal_from_abs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca1c5be7e3b53627b618f1e221fc14da4e0fe533f8bf700e7fc531190c22bb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_named_hash_helper\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a6dac7fbb42680ce2a987be3edda5daa8816cb476df987230314c79e50ff7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_by_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e754e7e0311cfd533f30a87e43f62d35f37127071787260c6f5fb8c50f3d612b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_digits\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_by_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a82333e54163d0ec2f09f504745330e56cf48ad496e0229fc766b085fb31a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_digits\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_by_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc456cb97f76e14acf44796cbf07f73b450288bb1d1ec9523e0954c6b2553142"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_digits\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_by_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/format.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b103b44844b10a4c2a83123b1262354451f67697a9bfc7755b81917adc3929"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(ptr as*mut Option\u003CCfp\u003E)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"26910e894f07fed0ebc5f6356db1f934a6fd72891aee87189baee49ac9518194"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.parent_fiber\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prev_cfp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"22edae629d548f811d4add351338908856d863bf4ee43968a32690a51866a3ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(ptr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f531d67b3426f7ae03f954d79b873d070f433eead2b648a0cbb0656159c185a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_arg(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/frame.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f2baac68b329b7d6efbd2efeb4417d57a39e6efd21a50cd4ede66e5c7387f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lhs.try_complex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060complex_real_op\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5f9db5af1399def15d6a5b119947f8c97a477813303116e5b8e216262893e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lhs.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pow_values_raw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b542a47c9f8dfa5edf45654764f016c8f7147a38f5fc05e80c9a56f9b5c044db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rhs.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pow_values_raw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/binary_ops.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d38373f03dd915796b0f1212b5bb5484678e5ada8d0bd5a3a2adbef6504710c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_fixnum()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2afa22717865dbae696c9b1b3f1aed1c9079eff0688657166a680b5f3df36f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150e3a7fdb2b608c2b4303a09c7ba96257534d4c67aaa31b3fba3682a7b14a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c807c64937aed498743b2988b79703f45dfe421d282e0534ad0e431128d6e81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0e9be31d627d0cdaf6f70d432a574faa978efad368f86793570ca21cac4c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad591c69388c23522ba9e03c7acff1dfb0a1a58fe8848ae4010af7ed8660e0b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.try_float().unwrap().partial_cmp(\u0026b.try_float().unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sort_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72fb86e49de19944dbcafbaf9b849ae1f03f94bb9860d2769d718dacadb74a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys[i].try_fixnum()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_indices_by_homogeneous_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"13813fb91509db6b96e5891a8373f190e53749b42631470c6a286113f86c7f7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys[a].is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_indices_by_homogeneous_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3100c99ae6d28c67ca9d8dac534c2d911adf5960517465c887c24e49963951"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys[b].is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_indices_by_homogeneous_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c6490f1fd684e07b6242e69b10888b6b523ef2e7ba9938bc61ea38c1ebc946"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys[a].try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_indices_by_homogeneous_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b60aedca696f5bd461e93c3539d5e2fc7ed4347c5b2d8995f9a0d54c107180"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys[b].try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_indices_by_homogeneous_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"375b6ba2eb1d0cb8a5243d390ec0e84b5a72e70d4865d421d880a4ac5c94f021"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys[a].try_float().unwrap().partial_cmp(\u0026keys[b].try_float().unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sort_indices_by_homogeneous_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/executor/op/sort.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f8fd0bcdcddb50280c864c73cca24a327c481cc3eea79602935498950a83a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f62adbc770f1d28e0184cc86f78619731382523a6d65ac7264c0fd573551315"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95ad04ef85c033a85a8d057b7d21777f3fcfa430b8e9db28c6a16cff24589c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c596b5d9b2b7bc8fa88575a546b3db707041c3c6658b93ad3fb0211d1dba6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1924a280c0d93af64e0306e3228cc66f595899a91af7692d6f51d7b09ce34bfe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_callsite_id(iseq_id,call_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e71eca997c77179d9c115e406b712e31d007430da511e3398c79db1b5224b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f6eb9eb2334dd75b3ab8d86478a455fb76b0498ee39377e0cd1afa72ae05c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77130b418a17e20ace41a0b387e2ef55c2a572eaabb8f7613e9b384eb394b61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"80670a4f2554852d81c462dfc24c07d84c44b48cb41a65c047df5981ec421486"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_module.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff2cd0318ac27707f21379878d1338e1e79f95d291888bca38f62bddbb2585"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060exit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jit_timing.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f4a83b5412a49f3b64719427e9f2f4f86520ea0e35eb9e38955e2a11022adc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inline_ctx.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_inline_ret\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f9c636077e4a3b52b1ddf368ab366cb5fc0223f502e9ef3be446d345d59260"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inline_ctx.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gen_frameless_redo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30b6cd2e949069928cef7bb2c6cbb267a9a477bf6281e3893c936ef7b08d60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060super_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa000cd7103c456807237c2abb62089d0b34428b338a64312c81b61b513b7be4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store[func_id].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060super_resolution\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21d8fb457c2c0f0989e521b201ce6b483bc3e3fd492ec0350c4bb749a92392d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.outer()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_yield_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6308ce815eee12f49136337b491d4e3f21aae19dc75b0b6c00c173edee8fba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.register(args_slot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_symbol_proc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b12be9df23e498287388c7eaaa104b459938be3c08fb20a9f08b8cf9f595c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.register(args_slot\u002Bi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_symbol_proc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe97c2c0ad917c12622225eda46d5c6a02c6776ceb6309a6758d6ed9b1bff4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.outer()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060block_param\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e31bef3173cdb497365947e19ff1eb857cd5a4665f12c7da1ba3bc90abed793"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_array_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gen_array\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"672610a013803978c394e95fd43e9e7daad25777b8a4671aca1bbe109ee22783"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.register(SlotId(id as u16))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060correct_rest_kw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adbdcd9dd84946d48884a19a0db5d91f9b7524dcf31c1c67d88f53db3523927"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.register(recv)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060object_send_missing\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3e7cc6dc9a684f2fbafc2d71d805b27a2dbd14d0f04bf893ac990d09bb59a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.register(recv_slot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060method_object_call_proxy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f84faa0451e1c036d7ef617894883359210848285aa1b44c14527d3f7ec26"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vm_check_constant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b630e401dd49629bf3a526dc694911d981296c2c6130968ba3c4fb818bc67ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vm_get_constant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a703a28d8c3050962c8bd54d5e89fab1313a57c2e719ef3086660f368fbfcd4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lazy_marker_source\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1269007b4addb8a20b4698d02ac3cc5973ae9828352bda57b29c2608d8ec8921"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lazy_marker_source\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b53b6ecb3d5003273bb6b08f046a3787761e57bfe1f2b91950808c4909900e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060orig_lfp.register(cs.kw_pos\u002Bi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lazy_kw_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"9610c58a36643d5086b4c60bf94ca40cfb71f78e05b379eb5ac7a35e07720201"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060materialize_lazy_forwarding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3341da7b8e5777dbf93cdb012dbcf3ab27dd06ee92658c3e3230e458fcb8bda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060caller_lfp.register(cs.kw_pos\u002Bi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_callee_frame_arguments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"254fe18153f5bb4e9f2c836c5dcdd36516d3cbc06828ba7fbf2490f00d1dc136"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dup.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r2k_unflagged_copy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e88c57f69dc04a5fd9e813cb7348cdc022621de6b8ebec9191d1534f5614ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060coerced.try_array_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_callee_frame_arguments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f400e43745e78fc6023580ac0b5cc3874122058fc6fc95c7a78368f4f3d566"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_callee_frame_arguments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"95699287f157ab8a78778d4cda45e3b19ae0f66a67fb6d3d9caa69d8931cac02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060coerced.try_array_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060positional_simple\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2310899a8c5458903adb69d7f723479d1d023e558732231106f5f6f9bf029f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.try_array_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060positional_send_splat\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91c54429f85363a0088044d21d4a1eb640c332e3c83d1af171e12437bfc1b53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060caller_lfp.register(*pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060any_keyword_passed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1bc1884b9f31ae0b3ba7e4779f847ec7b034e9447f3e21b468e2f37774038c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060caller_lfp.register(cs.kw_pos\u002Bi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bind_keywords\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"72df31f3294745e6829b822aef1e487e7df5851ae824d7796894e06e8873cff2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r2k_kw\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bind_keywords\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a0464ea988835af2bb1cabf118d0a586ce45fb7a42b4619936021ced5e8cd8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invoker_arguments_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/runtime/args.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac53f7eca1a7f4ed29dbda3a77dfc255622a63f85fc8d47713ccbf2d0d4bbed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frame.asmir_dump.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_asm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir.rs"},"region":{"startLine":4664}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab0dc1d6ddf1f62156faa738d0cbe69684517d984dc4a7265ae39865d8e7495"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060iseq.bb_info.is_loop_begin(bb_begin)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060traceir_to_asmir_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada7576c3af575a5a5c36e665259fe510e775487c57166d29df0628a546b6f6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.iseq().bb_info.is_bb_head(next_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prepare_next\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b30fb8983e9f5bdfe106847954bbd45fd995c247d785edce095b64ad460e4b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.yield_expanded_for(callid,arg,src,bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_instruction_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd23d19d8fb92d8fdf63444ff9f37a846e0eee9136ba31e06ca3d19df1e058b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060call_unary_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f48303f6a043adad687a5faf8444b278655dba6ee7611d2697eb15728bdeede"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060call_binary_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"74000c49549a25932159198ccb85211d667fd7b57c80e294ff9a313d4e377806"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060call_ternary_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd0dc020a2f1ac80bc74dde5296710efcd0146169214db9f3124711ea8f83c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store[mother_fid].name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060jit_check_super\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8b56263a1b49f5c9cb5c76c88aa9d942eadbcb64efa6745b4590cac8f681b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.basic_block_labels.get(\u0026bbid).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060thread_empty_outline_bridges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c015162b1748299bf87e7c4daee980354161584d44c75480f32511f6c60ef54c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.basic_block_labels.get(\u0026bb).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060resolve_bb_label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f159b89b6fe04eda3008c9b5cf14605acc52c22d4c94b8c85b011694146290cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.basic_block_labels.get(\u0026bb).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_bb_label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a0a13b91ccebc75593fb9b53142e9e01887c32689fb84bafa3d67ffe7d7a85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.stack_frame.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060loop_analysis\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7855ce6688823da87e2b23615191a71d3628eff22353777cf3ba38dc813900af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack_frame.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50582b4c41a0ff7748da16da3521013b7884fb7fee69dec8897420a56bb6918"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack_frame.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_frame_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4d3ffda95bfe99aec3d8c426b84ead08669e96d58eed1d30ea4d2de8013b51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack_frame.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060discard_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c797b5b60024088cc1aae0b7893dcbf86323e1ae1b842e6556a585bbc728e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack_frame.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pop_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc9689d192102ca8f859bf433a73b8d5b2790a1d9c0050480cb13c916ee5568"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060caller.abstract_state.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060specialized_compile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e9704c3fde018bcca389aab173740e82718f1f9e9aa592e7817068f1ee2755"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current.abstract_state.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060specialized_compile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"188da75a3694e22154d444b515804da9a90dbc179f3072619da44cf9b121cebc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060specialized_compile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f045bc440163f7e3c053b330601d1098d6d4a3d9934abd6577dc330f4dd0fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060specialized_compile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ea8fede3eeed97a5b78e9b5f66939fc0127f9252f68124d7f77d848d4fc496"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060specialized_compile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28df3afbfeecf7614a280f59a2e21cebc2fb1a85adf265cd68646d12648b9d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack_frame[pos].abstract_state.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060trace_contexts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fa836bbb7bf8f4b9a08254feb1d64b7b8330a3ba4c78dbdd38434a6222e64e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack_frame.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_frame_lexical_outer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"918545bc01e135b290ff41874fca6f5f78bae1a2f15c89cf56d613233f622ef6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frame.abstract_state.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060unset_outer_no_capture_guard\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"05970322f7af21490a77c87ce0c65e819cb7e1a685ef8f263e5d6503cea7e65c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f.callid\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_exception_handler\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d365227a0e4d891f41863ebb66980b615ddd8485ab6b174369050b8e6dac1a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_splice_exit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fac6a038df01f35921767deb7768bec1e9b548009a2700d01916a8773602a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060iseq.bb_info.is_loop_begin(bb_begin)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_loop_region_end\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":4048}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfa4b9b98e31a6758c67f704e85485826aa32418d37c7ee71810ca95a08ff9d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060float_ret_src(inner.mode(ret_slot))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_return_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/context.rs"},"region":{"startLine":4679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc41a7a92941b28329b50ccdf50d7326cda41e9315c827c1d9fcd290dae05d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_recompile_counter.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060recompile_and_deopt_specialized\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/deoptimize.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"142e6075579270ac5bbcbb5636e284760ad5e6fc04aadc9c60dc3fea769c8011"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GP_ALLOC_SET.iter().position(|\u0026r|r==reg)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/gp_alloc.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d68c1a91f821d47e4e99660b4f1a24c54b12a081fc334f304776b6619aae66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..GP_ALLOC_SET.len()).filter(|\u0026i|!self.excluded(pinned,i)).min_by_key(|\u0026i|self.age[i])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060alloc_reg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/gp_alloc.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bd14baf3eaa6d3387b05a11ccd198f9cb3624df2fd67395f19ed5e6d860a1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..GP_ALLOC_SET.len()).filter(|\u0026i|!self.excluded(pinned,i)).min_by_key(|\u0026i|self.age[i])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reserve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/gp_alloc.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a06e697db123f66c1494e676263059648175b8cec304ea296f886a4ee7be03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.remove_backedge(bbid)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060backedge_branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"be805c3ac1aa3df590c024f297e724f940f767027af9aba8525450ede960291a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060backedge_branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6936b303faf762e494b0da4116f0920bce1d4a258a3e10fc9c99c8e9b7822139"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060backedge_branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"db98021f8a87ce23e3bf6f4e0322e423a864d76b05eff2a01e82e73a531e08f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_bridges_for_branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b2ff467e417fae487f5cb3782802aa5d104e7f82b0821d45440f8960e975db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_bridges_for_branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/merge.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2388278d4b58a8760503174831efa7c2e2862d4c212691b596cc5089032b07d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.frames.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060deref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cca44b0f001c3a493b25171984f935e5998526a0496f3348fb6ce0c234fe353"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.frames.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060deref_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9346117a0798357732ea3c8300bc5594157e80905651e887693da9d3c642e8c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.frames.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060overlay_kept_constants_innermost\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"32beaf9a53e47f42771761695cd2c0495c436803b785431fec80e2ad8ebad850"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.frames.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060innermost_clone\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36be91edf58dbc1bb703051dbb6525f4c6f77f9d79376037e781ddd2234d5a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.frames.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invalidate_innermost\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bb53a244d939617fe09b1c4819a29b8d4730fbbab48a185fac9eaeb73265ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entries.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join_entries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aa35dbf2670cf8533d7102443e4a927b6b6705dd2093ed753c749ca4e29aa3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pc\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79fcc103c8d02c65cd2ca90eae70a032574e29c381ceb2430b4d3ce2438a87c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060imm\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_cmp_integer_flags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eff19ca2d242e5b81b632c655ca4b0c23cb8294f5404b3c1b19b70f0f0fd1e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(!i.get())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060unop_integer_bitnot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca62ae7857992e16bc9901bbcfa2f1f50d14a9ec3bc25b066c8e545578e491b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(i.get())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060unop_integer_pos\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/binop.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"66053673dfb458950c409f9efe8a291204281df6d3d2445780445f8c8580863c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060deopt\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060emit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/read_slot.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cdb3af9627f2f2f9d9a8ada8502faa9a76441852a15073d28f9f29f90d308b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060deopt\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060emit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/state/read_slot.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab54e87c04e4f92aaec26592ecc1304104ab1d875f3bfff776123095b2cb912a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fire_binary_inline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bf64f580eab532f3082c94ffff395b9ed48d567d192c44e7b780b1f86fd267"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.inline_info.get_inline(fid)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fire_binary_inline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/binary_op.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99efcc712e12dcbd79d517317db93c2658f67c901a5cd62f825c4c3ef6d6237"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.try_exists()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dump_cfg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/dump_cfg.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeebc7b951fb1952807216dd2772d4a7f4f07f748a45f2a406faa859fd6ae81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(path.join(format!(\u0022fid-{}.dot\u0022,iseq.func_id().get())),s)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dump_cfg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/dump_cfg.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a19ed45a36a8496eaa9fdc31b337c1d5b4d144bcffe1f6c5fffbcc189246b6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.virtual_at(src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_mov\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"637c0b52c426d6c1cccd22159ac691b5f1265f8f9c72fb6108c08a396acba0cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.take_virtual(src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_mov\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c46e0b6b430eceda11d1351b4ca96afc085adfd296ed66bf7edbe84e9c646c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060base\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_mov\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"033835c48e08946eb4d71c39af07282b20e6bb594a19dad00d63beacfc4cf2d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060base\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_mov\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a32aaaf761c26ead3513e6fa519d64dd0154e29353414b2227df2857669658"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.take_virtual(dst)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060materialize_virtual\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a5b036bc20e80c1021a636bfa5c077c87ae7f66210bba751bf34cb317a256e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.virtual_at(recv)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b48327379e32f319d014836c6003ce4babed2572872835a0f2d111bc711e8a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resolved\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"23081b489b762d41992fd7e8c3e4fa30638f74798cdbb81d8c392cb5fa2421e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060summary\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3219d4628dc7b4f341b26eca23e2aef58601033a4537e0b8d64b4dbaae67a750"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.take_virtual(src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_expand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6b0dc1b3715b741369855492dc9b43c662184da90242b50359e1cc891ef816"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.virtual_at(lhs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_teq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"89068dc4cf6b418587a0c82ede7656578593b30bce1f14fc573472b6c6f33ac2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resolved\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_teq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef97d01fa1a458661effab7bad26993cc2e9ef2aacb6c2bb13f29b49d1d7cac9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.virtual_at(base)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"616531bf64c4b9d3f828b0cacf08b1e599f79f3ad78ec604ce62b9788748de0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060consume_virtual_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8fe13788a8438cc4af446601478e4b41fd6479561a87ae2927ac26e24bc6a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.take_virtual(slot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060materialize_virtual_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c730693895ec5c6088aa3dfd6744e954ee6da673ebff30e4ac3c59396e3ffd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.caller_kw_table()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060materialize_caller_kw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/escape.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b50dd2b2ea434b150610bf78bb78f95bee292ec3467fb625964a4c52d7453f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fire_index_inline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/index.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9765fae44876db3b4a2f0d39cb35ad7e08deb29f084da20e25a0a9ab034da18d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/index.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f96dcaa056f05d356f2bb22d7cd43561afd134e591df1f97d7b3d9461af5da7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060liveness.get_mut(head)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060analyse_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"19abeb40af29caaada68aa2a10566c5966bc9fce638ecfa857029c0e67303bab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060backedge.get_mut(head)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060analyse_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4facbc628ab342e3baa4db208f7d2040f10f2fbbb1f83e2aa0f0e04f93e8439"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060src_bb\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060analyse_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"356786864053dfe4821de90cc60fe57133b9de50246a9d8ea27ef98edd38e1e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.iseq().bb_info.is_loop_begin(*head)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060analyse_basic_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/loop_analysis.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dc25e10e25b7e0537580067f2a553e3bb52cd7fb6ee68d993f6d64cd3a2ed7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store[direct].name\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_method_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6d4516f85fd1555c2c7b94ca1af934a806384f4204ffc175d5134dc7764303"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dst\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inline_class_new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/method_call.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec59c733de2fb2ae82664ed2c5990a1eafd2bab5b9f29be478e7aab3dc238a9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store.get_callsite_id(self.iseq_id(),bc_pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fire_unary_inline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/compile/unary_op.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"78681ff74d1f527bfd7108aec6f812e838e609426fb6eb4ad36660d47cdae952"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060home.unwrap_concrete()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_asmir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65443af930a2b2f96081b985a3741211f65ca57340fb228318c16c149c64ac2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060home.unwrap_concrete()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_asmir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08e792b8b024be62ca8e867053391335cb7ca5809f2d9d3459fed6b9d3f5ca9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060home.unwrap_concrete()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_asmir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"85813ba9bbd5fcd41e4ef30c27c9b019b83476002ae5e5d83a77e5a394d4831d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_asmir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/jitgen/asmir/compile_shared.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c6d94a787c0e2ba37a65fba11eea7c53f5f90066a7e26cf49161c7c0c28e76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch.into_boxed_slice().try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/jit_module.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d78e46d67bc42a299af2abdf818b6f6d748279550086d8b928e6251082746a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Value::check_fixnum(lhs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_shl_lhs_imm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/binary_op.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"6710db74025f073ce034a50e210d980f9c9453549ad7f8c706c35c57bfbd2a0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_const_version.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060guard_const_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/constants.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0071349369ff9d288f196b918231e28d18405562afb413be881fcb75a98f0563"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_const_version.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060guard_const_version_specialized\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/constants.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3ce0981ffc6e5f1b3a392263c02ed51a862e15d77ed1aa03f7d6ce062e3187"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060callee_pc\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060emit_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2c16b4f983fe1355d6a3ca081bc3f243d85999693b2b920671ba49fcfa2736"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060layout\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060jit_set_arguments_forwarded\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/method_call.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d3fa54cc113efc71a322b3634dc3823cdec684d45a5fb44fdfc80ab41b85a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_recompile_counter.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_unit_recompile_deopt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"93841a717397abae822c781bd7319f25332648fe68f5f8ebe6ff9451b5099f8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(disp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_store_outer_fpr_home_f\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":3439}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8a338715719cbb340da5a1aba771beb65a731eafa83c4a497f5132a7b5735"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(disp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_guard_float_to_outer_home_f\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"113a880f52fb0f6b4b56725677b2fc694a57d861de7f26ed7cc760e7b67c7afd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(disp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_box_outer_home_to_dynvar\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":3491}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd699e455c034fc59b407cf985982b07e7aaccbb9fe3b0654c7477979ca2f717"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(disp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_load_outer_fpr_home_f\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/x86_64/compile/mod.rs"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"27195db359dee59c77470f31543999769bbbba524d6792a253428fb71eb7645f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch.into_boxed_slice().try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/jit_module.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56ed795b36dd0a20c87ae322da4617c7746595f6b5085e4d9a1897c7b90d77b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Value::check_fixnum(lhs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_shl_lhs_imm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/binary_op.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19ae0c6b6826fda9c8b29b6f61fb6a4ba9b0b3a4f9b551e3617b4ddc543f86a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060callee_pc\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060a64_do_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/method_call.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e59462390a7deae15a3dccb4f86f2f602c1eab9c77417114a71523c768f59fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending[i].take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060a64_drain_side_exits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"da57a7769ddcf2b99361653dc77657faaa4ad379a5b8df19f577c07a516bdb8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060links.last().copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_asm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"128ea4f7c79e67c5b247d3cca92740717dbcc070e6cd128d472e6f651e69f4d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inline_ctx.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060a64_gen_frameless_redo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f432ebdfe913c81463aa5688c0680f0c6e1ba2a0ebb66bda8fcd28d8fb9bd02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inline_ctx.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_inline_ret\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0941cfaa3c4c9cb9c2e85c98fe464fde931ff4898cf3e42d098afe76043639"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_const_version.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode_linst\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b47a5710c4fc910040f830bdc77bfc2c6f13918e7a2ae9471430f96d4212a81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_recompile_counter\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_unit_recompile_deopt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":3988}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82743fec3b8574bb894d90261072ffbd93d9e39b62483649307791363d57691"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_const_version.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_asmir_arch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":4810}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe3f522c3f633f08e98b7d4f720e15ca3e546438997ef7276cad343c6fa3cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.unit_recompile_counter\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_asmir_arch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/codegen/arch/aarch64/compile/mod.rs"},"region":{"startLine":4837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9880971c7e45610434000fa4d5263ba7c1842ab295443ab3871a7cd6c2415c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dst_sp\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060into_bytecode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b653813ba5d55138dfde877c637695539ce318603cc2c0c51e722b90317124c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(self[else_]-bc_pos-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inst_to_bc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78838c163577735a09ecfc37422673dd4824e1111a09a282e8a4898d858d6cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(self[label]-bc_pos-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inst_to_bc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcffaa143e24ecfd08a2233ea51b207cf2a2b881c2e8c5d487cdabef2a4990b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(self[*label]-bc_pos-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inst_to_bc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/encode.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f5f19ae9d31daa7c20046d346dc5ba9601bdcb53bbf3c2baed82ee88658787"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060getter\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060emit_op_assign_getter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2192de2895a109becbfd45f38c7caa55b83205fa44264eba9018a0e78dd44b32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mrhs.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_mul_assign\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"432840d1421a5c1fb7336a681ed9438a0c35c80cdafb38932e86dbcb108ef4f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060iter.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060emit_hash_pairs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/expression.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce15b631b5edb489938f7b1172ca53bc8fdb040148ef191b6eed6215f3c70dbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.refer_dynamic_local(outer,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_each\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/method_call.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebff2f0452465f191b02ef91988381e94384847f19fcb8193a7bf35bb0780fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.refer_dynamic_local(c_outer,c_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbefcc17ac93aebe3e5bf21fa0e93d0f21be8c7ed4f15053ecd9f23c5a042711"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060errinfo_save\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gen_begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e67f2438e118160a36418ce0c298125aae4bf595e20028bbdde4dbaa689b39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ensure.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cf9dcb272dd3ad5ed290227cd8b2c03c0da074db8c4130878a38a374e294f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ensure.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"7293b29cc973136e5e2bd2af2330a58a6ddad8371397003e78b7fa176a9e33dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ensure.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6521f45c6b75dcb340cebec9e8a1b8e86df9a66be8921fbec5bf60c50a9f7254"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ensure.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1dbd668d5f541a1d98f03845ec99267d116ab6eb3840062b2e153dd8fdffbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ensure.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gen_begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bytecodegen/statement.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a93eeeb50afec35766354f4034a890d9cfed2b989037217b07abcbf2c293c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.check_method_for_class(ARRAY_CLASS,IdentId::get_id(name)).and_then(|e|e.func_id())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_recv_escape\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68855b54ae4f9cc2383f1bf7eef3372421222b0c8da50d58c4f7e0cde5a26c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060min_max_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d052812998df75a669caf401a18e5d2b9352c7bf2d46aa5a828685d9eb3a4bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060min_max_homogeneous\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37059ddcaba61242732f48ab92a560b7352235573802d269e85bb4f752d3ff7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060extremes\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060minmax\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c0a6b74c0931cec8d6e8259c92b1bb2179aee995ced160d825254f7a37ba62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wrap_rotate_count\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/array.rs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf62fa911be433840f2cfdd3ea83bdd9b1181886e57d8b0714ffca340634f22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"121336e1f804ce48b08a34b265643fa8a1e3ea4eedb889522448e90ecc134d46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Binding::try_new(lfp.self_val())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f070ba9bf64157637af57064e5d76e4485a53b7e6ff23fec6cef465537ed4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060binding.binding()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d141eb5ba5c9d06b012148bfe631505ae416d7796cd0df4f6726275ef75be0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Binding::try_new(self_val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060local_variable_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"222616cf9bdea194dc31c407e308578632065cf2aab7302516cfe7b6f754d3a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060binding.binding()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060local_variable_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f3fb147d72ea2a94f9024792a11076244ed4d2e52057499ce5f3be733737c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lookup_local_in_binding(globals,inner,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060local_variable_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/binding.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c26d946428da44a139bceabd62620ea56a9fb39dc654ad3c17814142a828161"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/data_class.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddefd5b0d25a45c07e316ae27919a9a2eebea75d2147c1815b8b79db9f430431"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pwd\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a79080b22386c3b1073faf0e2edf73eb1419ab3f4bddaa98a82c492ec95c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dirs::home_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chdir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfebd4236bd8cd5e3b3b22870847c7bdd4ede1dd03c1d897035d49edafde151"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_dir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chdir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872323535dd8af47e939b61e1962ba8dd13a463bc4eac96b762bbd7b8a1d5ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(path.as_bytes().to_vec())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dir_open_fd\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/dir.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1471af2608f46cba3b74336e85d6d6edb3bac44c8b48be25353c14131a7269"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_constant_noautoload(OBJECT_CLASS,IdentId::ENCODING)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060encoding_class\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ba1474f70462c0cd8c78cd30f447f9ffe9115c156918863a2e248e2989cf7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(val,IdentId::_NAME,Value::string_usascii_from_str(\u0022#\u003CEncoding:BINARY (ASCII-8BIT)\u003E\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43864bced34f179ae27804af3b154057691603cb67a8fcc7de126a2969dd7f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(val,IdentId::_ENCODING,Value::string_usascii_from_str(\u0022ASCII-8BIT\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d327b2ae90f7cc12358331230690b96f5732e9dabe8bf5e861f10509694a010"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(val,IdentId::_NAME,Value::string_usascii_from_str(\u0026format!(\u0022#\u003CEncoding:{}\u003E\u0022,canonical)),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d511f75f5ff58a11599c5af6b2f0cda28cb43d4a8e4e79650f2c1c5690c02f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(val,IdentId::_ENCODING,Value::string_usascii_from_str(canonical),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcd20544f41f5408babd8821754957a08e578ee007e7173c64502fe410346e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_constant_noautoload(OBJECT_CLASS,IdentId::get_id(\u0022EncodingError\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"553fe0154f0d34cca37db9a80f65ca1d14fa635afe2712a90238ba0ccaf09d31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060enc_error_val.expect_class(globals)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5abb0251e13ca42a171b5159acd37d8dea841afc43b6f5ae3c3e05b9f013b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(v,IdentId::get_id(\u0022@name\u0022),name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"422914b0788330f2acf0bba9708706511a85ee70872271957ce17bea825281d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_ivar(arg,IdentId::_ENCODING)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060resolve_enc_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69e92df21e3e95ef86c3d390858397ed665c03eda710fa802350b90cda9080d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060opts_val.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_xml_option\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44a469268e297f5105361c6d7f1cc8ce85c2c017bc3ff766aaeea76b36209c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060opts_val.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_transcode_opts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f4ca0302c98c1374f6fc9ad5eaf0872735e503388a42258462d0fbee7f41fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_ivar(arg0,IdentId::_ENCODING)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060value_to_encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc2c70dcd3bbac1656658d6102474bc96c35736ab35e3bd08667651d07478eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.string\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_empty\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/encoding.rs"},"region":{"startLine":5220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9743dd4e3da52b48df9c8a9c637224dfbb7af8047bccf9e2c1ac57324d7bb8b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_constant_noautoload(OBJECT_CLASS,IdentId::get_id(\u0022SystemCallError\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/errno.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"1538b137a05d327ddc47780157c0d96a5d936e00a0290734322f7b9d1493ffe5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syscall_err.expect_class(globals)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/errno.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"88adc13a8d40583c1e5f5ecad561144146623984884ef23425664c26227d2328"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_exception_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060nameerr_initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"59667c8e9d6354a2e5969a7157bc38f8c1cdd4c5924015ba47148ebc7e9eaf32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_exception_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060nomethoderr_initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7ae551b382eee939ee0f2ff09aca6bcc00017d9b0b68c08a776705229e012a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_exception_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"17195fe2da341a087b559381ed03ab9a02dc25c4507d8f7b30acfbd16c254451"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_s\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5fc8d2d1defac83e3767f7b6ef13d1f8cf5a6fcde4ce23334286f8aea885e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exception.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060message_showing_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0875cea768031cf3d170ff0368b33cad9df23fff563ff69ce8d4ed96494253"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exception.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060message_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3e5bcef2dfc793382d897643426a00f2a7c424b5132e59381ec3e100e4fba5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060backtrace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e38e47c854cf101f205459d2c937c2618d0e637bdefddf47c63719be1cc9261"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060raise_backtrace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba7e7d78f16ae97490cd01fb17ff88e24bb59a11d61fff8a9eeb3afb9f5482"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060new_exc.is_exception_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060exception_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"8535725075b5ef419b2ed072eb557d49d658e66a47068c75e625f8f01b4dcdbf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(ex,IdentId::get_id(\u0022/status\u0022),Value::integer(status))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060system_exit_new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/exception.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231db119bc49593e23cc3cf6b23f8de0332dec011ef76afc9559e2215359d8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(vm as*mut Executor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_fiber_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d500e16da4293e92f4a57c1c435ffc50762fd6276e51dcea6edff39130d654"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ptr::NonNull::new(vm as*mut Executor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_fiber_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f97906e9ef294f83221922924e638b7d461a035837712586d32be463a586551"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060storage.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060class_storage_get\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adac7f3e69fd5f048cb49c5e278fda3b6eb9a9072f932463bcff822bd12add6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060storage.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060class_storage_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/fiber.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aa6e32184dacf22f660e67a2dcd5c28762cdb08875f591981efeaafc1be3fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_constant_noautoload(OBJECT_CLASS,IdentId::get_id(\u0022IO\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/file.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80a2a7053cfdb536e089801b86cb12d4dbab33b5bef6447dc871d293017c73a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060stat\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/gc.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9713a8d8c64018dfe856473977aa2cebb1caabac29b9e289c7848be3e02ef9af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env_map.insert(env_string(\u0026var),env_string(\u0026val),\u0026mut vm,globals)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51c4d5d6093debc2da178188e2329518fba53e592593bbe50ee7767887e8f16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060home_drive.unwrap().as_string()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88151cd0e8e5b78941ffd481ba110212a39eea19d8e7325d79d370cd48327fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060home_path\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6879ce47a2cba06f061851333a0268cac9e8aefe18072830b7cbd3774cc02f8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060home_path.unwrap().as_string()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"763d9039fabfe83888967858b42c20a599c0051e405fc0a51ca19c70366ea84c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060up.as_string()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a71e9adbe5d5084e8f214d27c80c966867a55d2b39466a8f684bcaa11aa76cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dup.try_hash_ty()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ruby2_keywords_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d12f71186ec31474d62680539dad8c948d2e93bcbab1f945cdb9b617f1f6130"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060proc_val.is_proc()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default_proc_assign\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/hash.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d45f596b59850e86a1c29bdb5c29c3107a94103d58874aa061236e9f9f2113"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sval.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bytes_for_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd44b010f68ed1ecd2fb6d2e0b99ef7951248ada59c3d07fbfb008d45143abb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sval.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bytes_for_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"62283b6cd267515f877a794b48b611a784b8f39a24e6ad6f3278d7f79f54769b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_fixnum()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060io_class_read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"135f0bdb1339c8a17f3cfd762fd3e2b4dbd38b47416af96600ae404c24141a65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.try_fixnum()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060io_class_read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6be811a5e0c74ee666a7eb9861d2ef1e7d850b2e5e818ed748f75ffa3fa50a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mode_str.split(\u0027:\u0027).next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060io_sysopen\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3105}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ea67c375febab965c9718005b923d2962c39448a9e93d09b3573da75b2ea76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060io_popen\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e724824dc474bd3ecea0d4b4e5933700a63d2c4b8a1476496da609d78d765fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mode.split(\u0027:\u0027).next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060io_reopen_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":3992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7302f6a34a5b155474e4e96a0d9abf6dd0145e8712bbf9017bfb5edde2662c64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060src_offset\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060io_copy_stream\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io.rs"},"region":{"startLine":7037}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fcde4011ffb3d62d130d77503ec06df2c357b6800a365e0107706387b4fa89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_value_type(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060value_type_arg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/io_buffer.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e8f15f5a7ca478afac22ed3c101434b07cfc9b6b3eb6581d50171403e8d1b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(text)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88d57abbf224904ff93a34b8ee1d35909bb23548ca0093d346fb614b181a855"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060num::BigInt::parse_bytes(text,10)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e79fa107c2c180d3e04e8a8c40b22e33cfa2baad9ebf6fec54ffd07c448b59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text_str.parse::\u003Cf64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db4d53ef3e2bb6e1f268a6c6407d4f217761e91382f8c47a386d46db7610dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.config.as_json\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060call_as_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa74b5428655182d76a967438f8eeb933146cc648d7213e505991aa89d35782"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060float\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/json.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"881f34c4da311962c4967d3bd939d601a08f1b3f51f60d560281e8d4292ee49d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_constant_noautoload(OBJECT_CLASS,IdentId::get_id(\u0022Kernel\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060define_loop_mode_builtins\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee967df1f6b6c3088aeeebaf1fbe4480029caec41699f53bb8d8ac49eabebd6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(kernel,IdentId::get_id(\u0022/undef\u0022),undef)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef72dc0a717ce8ec14828d4e4ad7b75d2cb790a7a7c6bc62dcc9239b45f9059"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.cfp().prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060local_variables\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d98b29a992f9c504df4676efb6cb4b0f8149798c973e62ddce02fa36a6b835a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ex.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060make_exception_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"999ba437518860f626bde469d765e5ea48df4ff43449ac779d341de8dffc9faa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.cfp().prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060block_given\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7b03d940f8eb5f2beef28e0572c953aa7b50b9831bfbaf375085c0ae072c01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060t.to_bigint()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060kernel_integer_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0e051175ab385105d048c7151a37859d202c767fff4817b3b69d2a0fced730"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060num.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060kernel_float_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1248a33f162e621c4b23267086505d343b96de98b090e31cfc9aea6624698df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"43eea3c897f8a990091910e31ce92a3b7987a9edea40293b98836fde8332b40f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060binding.binding()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bb5f1a354c23829f47c5035cc9ddebd4ed53bdda033fc3251b4404922f11aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060command\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":3847}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b0a8100605efe76241d66df3564fcdf1361056bdd524c3c82b01022d4233f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(arg0.coerce_to_string(vm,globals)?)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dlopen\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4676}}}],"partialFingerprints":{"codehealthFindingId/v1":"2599aa5178314ef8de8a6970a3ace3be37e6220ebb3b58cd9ab8ce80b127b3d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(arg1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dlsym\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/kernel.rs"},"region":{"startLine":4721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f5551e4b352614cb85f196a5ec9dc9d30ceebab0b4ee34cf1614fa863ec311"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_singleton(main)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/main_object.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd5da8212fed71af5203e3518aeb763f158bc44904b35a9c0ec51c113ab5d33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.change_method_visibility_for_class(main_singleton_id,\u0026[IdentId::get_id(\u0022ruby2_keywords\u0022)],Visibility::Private,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/main_object.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"658791b6f196ff45f1bc4b70deaae46c906dbca4f74eb0873ea43c026b2b73ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_singleton(main)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/main_object.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f03a1c4375a51cf16be4ef893c47ab04c141d387901e8b29d3d07ad1f452ce5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exc.is_exception_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_user_object\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d496b9a17601fd4d213dab347da1a54cb932b2e884d205368bc0a670cf04825"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.extmod.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_extmod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafb24441bd3af634270753441b7cc2960eed159685da08440ce46f92aa88d50"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060members.get(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb0d784c6231488e24885d84a7bb64735755de34b7b2fa58853e4e4bd5745ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060members.get(i).unwrap().try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d588f250c7f542f53c33b1cbce5de753d242d15ed24af61ed4b5f692ad8f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exp_str.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_dtoa_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e0f510b44672936565b19928e8a7db52ab8078f45faa57ec33679c9056125a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lookup_struct_members(globals,real)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060marshal_dump_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ff33b50b2307bb4539a8b87cc0a9b22c2f8ce637251724406df06495c63339"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060marshal_dump_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/marshal.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a33fde5ebff82a7dbb9ff49a4dbe99831bfc26025aa354f17aa3f922239ce87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Value::regexp(inner).is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060match_regexp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/match_data.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b6ba520496c14353a5414f855157d64828eb59d6d9448e1d942868b0dbacc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_constant_noautoload(OBJECT_CLASS,IdentId::get_id(\u0022StandardError\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/math.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"36077775892a06309e01b32d4cf85464e8a29b051737c114c351fcfad5bb5c2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060class_eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fee1ed5a86607ef159a7bac2c3e0f711de8d9486f4705cce36cf5dfe19cd18d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.bad.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lookup_constant_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5bb7e781808a0f1256dccaf7fa7891cb92d29222628c06addb7b94a5b635ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.bad.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060probe_constant_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77e71d24c81e29e66a2c7043cdf45cad2c4c425ad556eb2c3a0ebc647cc6ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.bad.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lookup_constant_with_owner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/module.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fe3253c1a3fde6284abb005dad10e73f8102ef457ecb2478bca1c4b5d00608"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exc.is_exception_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060no_method_error_with_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4afd12f3fa8ad98f136c5446e870411e0c4f9eb8b529c3fd8c1bbe6de9ff31e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cfp.prev()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060instance_eval_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/object.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8290212a52c625ac8766237b718a2e03d69bc447fa49fd5671d590e3c8aa55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.outer()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060proc_curry_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4633183d43d63ed1d2fa5ef4983d1db8d04c19d6a9cd4573c9c4c38c5cc0aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060st[2].try_fixnum()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060proc_curry_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8daaba3e1e283c16f5fdfca9727a21f4b5e69bae0afc490b81d9d41380e7b22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060proc.self_val().try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f331f09999e3547dd56cce4d2c979f5cc54496673fc30ebb7aef2ef9b109684"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outer_lfp\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060binding_\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/proc.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e569930a628e0a7db09d27cba5735da30012a95c92f92d3c3edd6a5560fc24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tp.nanosec().to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clock_gettime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2bf10bf266e682b514aff034a53f42ea025e94932bf512f25c1284a86f7760"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tp.nanosec().to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clock_gettime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a329ac8dc14579655064978faa0cb94eb93c8187cc4a6e8904b2d237a1ce03ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tp.nanosec().to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clock_gettime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb90b4307a8620f50242ef2b21ae36b853fe3a722c82cd218f8a00aa8d81c7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.get_ivar(self_,ivar_state())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060with_mt_in_place\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/random.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f87775b1d20fe9c0612f05b8dc7b44e18a9d1652a0b6fb6309610743dcd12bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MtInPlace::new(bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060with_mt_in_place\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/random.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a9e75bec5fbdd2016322719adf9194aa9a704995558ab27d600a7077ea366d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prepare_rand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/random.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58e7280887e1a42f6e0518efb7cdae3de250adf0c2455b3c37ed663b7194baa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e49b2a979f2d180fd69726076c1aa1b9e2ec59295571e00d101671f5d803de3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"2790cc9233b21f1a57cbacf97b4bc6ffc05da9e3b231ed82df342089253db2a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b5c9ba92f5422c9dcc41b5aa00a23be89aad5d6c2e1dd00c19eb812abce877"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9e2c91587fd2ffe627b3665f60a9603f9c9c90886e9355ca77b93631e68fc7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6e8279eb0d39dcb621993929b432f02665fb80253cfb32348df303ff338d41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"014cb977734595e096c2f94be60a97ab76324305cb134e49a173106cc9316d86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"6599f8fefc1c34d016d48452745fe4d3f253fb479c893d47a623c6b560f2ff4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060range_include_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/range.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e019a092c26c1e354306878e202a0f5d56024341e0fdcc495a4eef8f5b20aa1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RegexpInner::with_option(\u0022\u0022,0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060regexp_alloc_func\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a7f7c3243e90fc050b337467183d9ebf840f26402be2d8c0f65b39c1d06a8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060teq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a04664148af997d3a9619f0e18f9f84219b0a36f03094e89753d4d4e5f475"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060regexp_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1d65dfbcbbcfe5568a013251f0279b66cb838313689a62fd7f4df33960920c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060source\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6c140d6db7076a873a2f602ea59cf0e2eaf47438a1ee56651a24e8a451dcab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060options\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455856476b5ec854614eca2e34e9a8a46f22a55c696cd31a3ba4fe9e7097976"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060match_\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccd13ff509f401e23733e0f65c0aadade8a979d31f055142c7b10a59bc2fc75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vm.current_match_data()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rmatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7c2b06aa8a96e278cf40603149dbfc209136d5019f485ca42a98b52142753"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060regexp_tilde\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"734c868437fbadad451ca9da12341502394edd921dfb614ed4eeab2eb7dc6fbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060casefold_p\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"584db6d1dcdc3489d356e27ec1ca77dc73420dacf857e3efcc09ede0cdad168f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060encoding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4e08410c9778a179840206261ae7e7f95cb823401ff73c0acab816598b5c06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_regex()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fixed_encoding_p\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/regexp.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"de469df3e31fb2aa9cc9320aba867d95f9f689d49568c86f2e86ba8066519aa8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ary.get(0).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_exec_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"13971113395323b260ebf77c22868fc28f01b85ecd5dd267ee2f28ff00f3b71c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ary.get(1).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_exec_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/spawn.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca33abad2d009d16d0ccb8a62c0b5c1a86e0451da0da64033c87177985b73a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partition_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fdd84f5329e60443f9938008d885a5e2fe6ca84459af06f828de5b0279cd77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partition_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"99563867d6f5da2f9c96fd8e5d1509f213b8cc98983ed907dffd1f8d7f147cdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::char::from_u32(self.0 as u32\u002B1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060succ\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a3ac945b380b1398965f9bdd2a56331700a7e9217e23f12293c7ef28bfe0ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::char::from_u32(self.0 as u32-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pred\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a87ac7632990eb80529c5d042d7d2987aa846b887203f1c6d670b2ddaa4b47d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060string_start_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fca83db1235fccaa2a03a1e94ed6804b28afcb71a9b62a2de0a6463bc75b68e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RegexpInner::onigmo_encoding_for(enc)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3483}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f91363b2f2d6ebec789b85efdf7d666fc4daf6d130c41746bb092afaa8c101"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"628cd6d63be802cc4257c9b0cc527639a4bf54892aaa886eabe7ab180227bb4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg0.is_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060slice_\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":3925}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f61cc9624bbda596d900c9608ec2bf362def31f9fa46124b6a3e1f270362c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scan_block_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":5973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284bc4658bccc9fe599c50d9cd5c9cad668b18e852dcf8cec67223ddba9fa39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060string_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6425}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe285927f77afa931e584cf50a13548bdfedaf435100ffd7d468bfeb5eff639c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spans[0]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060string_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6479}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e685ddfde79b660c6638e44679651391a0198e2f0180183a16d484f569ecbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060byteindex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6496}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc01016c3dd2c827b6f383099c51578866491f61ffea752892e884ba5b83978a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060captures.get(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060byteindex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d891d84ff504c7860cdcc65715b9672b597c7f5efa979e9f6cfbc1e568c37baa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060byterindex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6603}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a551f4dce488582ade81b7b04df06b0288835437b7b9f96e363b33e1f9a1b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060captures.get(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060byterindex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6722}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2f0154c6b2d23935afe7368288b27aea248ca6d43ec9f5993b337bf1862ca8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_.is_rstring()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060string_rindex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6859}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3498326a10a0e161469339f357941e5aeae4239f94465d5ff3570ee0a222e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060region.pos(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060string_rindex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":6909}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a70ec51cf04482784edbd4d3c1aae3204c5f2388b5a86a4f80784e18fc5128"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060needle_val.is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060string_rindex_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":7189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2c87baf81a693c3523f72a9f8b6869b4ff38f80b89ebf37854dca42eb21661"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060to_chars.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ascii_tr_translate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd559cd88c43d12fd7c76acbf4ca7e85e4f854a3ef07cddae730842516d4aa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060to_chars.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tr_build_map\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11200}}}],"partialFingerprints":{"codehealthFindingId/v1":"18173c74f4804c2ced5430556f0115af356b4dcfd0318b502a6bb43020d9e70d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.is_rstring_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tr_sets_cp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b98e7a2f9054f80441894b6099576a16bcb39330dea3551a81ee0b884a4b1bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sets.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tr_sets_cp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c45490386f171c1e998512896e7eea6b291e3ca671dd37bd1cb79e08f44e6e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sets.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tr_sets_cp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44f84d5c4c60796c691017b9dc9c5066bdd83bd21e910d54e73cc98c768bc86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060t.members().last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tr_translate_cp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2b10c13de6e8e9ce6f4427ff041ecdc119dae72768eceb5e333ac17f34be89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tos.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tr_translate_cp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":11320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd776df1adb1cbd57591ef3b50ba8ba63cc4c1293a40291c873f07773ed155fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ex.is_exception()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060no_memory_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/string.rs"},"region":{"startLine":12126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9764f49b68f72ac80a59b2e99afdd22f163641353c112ff776f70384b93e87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.set_ivar(new_struct,IdentId::_KEYWORD_INIT,v)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060struct_new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"26181dd2266aaa0d8a096f0f2c7baf37d2e02196ae43f5beb12d11fcb94cafb8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060globals.store.find_method_for_class(CLASS_CLASS,IdentId::get_id(\u0022new\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060struct_initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aceccb0442e7ff1e1f13b2dc2a132af4bf3025b712ac8c880cbf6b27968c2e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad82385977054094af7227cd1016f7f7178a41f4f823e5061f9fde4aef43c073"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"75829b3744daf14de557acaa8109117183ffce996f15fe103394107e7fd41b1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kw_args_val\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a883c4b4d0c39144f9e517723137fb886de003932bdf6c0cfcfb51f9e7c1a6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060inspect_members\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"be49850d14752eb6da1cc343490a2111aa21e9eb2bfa1ba30a3b5e4a909ec3ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.try_symbol()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abced63911dd9b4e7b7de7e6cdccdab46a23befc77d87e04c60325f721aaee8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_val.try_struct()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35d6d25f54bcaa454ec95314a9229550fbe73d77bcd60e4a4c88fd7b8a181d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060other.try_struct()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28b43e9a7e2f7d6de68da9a7667444cd6b071ca08e8a4e569b68837df64ed67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self_val.try_struct()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eql\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"634db24fe25e6ed3d5b04e4e2c2c6c7ebd29f8383c4406c94032eba5b713228c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060other.try_struct()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eql\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/struct_class.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38551b901015f32989e6566fbef76f43816bc2b63bd229a338a991fbed0e8ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FixedOffset::east_opt(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060local_offset_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75f3738108cd028d34b21700fb1c1c803b71cf4872edbf1d8234b5d1325d89d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FixedOffset::east_opt(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060time_reinterpret_offset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"2836cf1b2e13f5c6a815d29cb8169c756dfcf66c45019285c01813ee14eb4459"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060t.with_nanosecond(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_subsec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed929df37109c0db13fb2e56cbd5dccdd0a6a1a81844eef7c0fa74f383e0efa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.with_nanosecond(new_ns)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_subsec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e08688005acea411e4dd700bfebdc3c22f74985a5730c54430d05ca0f496e5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060t.with_nanosecond(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_subsec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f610f14f7cbead181915dae54798216485e2542d493b3bb6c9e39afc87a0c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.with_nanosecond(new_ns)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_subsec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"072c544b1f2baf8995f7e1c05c4d84bc57c4a6c3e2835d9bc76f13b4e8808482"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digits.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060time_build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a2bda652a6bf579cbbb562ce94564d1c30f3d4cf42ca1579d894a65a9c670f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FixedOffset::east_opt(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_utc_offset_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbae243743dfad8363387bc5df4147badb6d1ad7ee2cde2564ed7184ebddd47b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.is_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_time_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"946f6628a496d9f4df43c0d57b55ee0ecf43bf862977e39d4d8c95b80afa7c1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fmt[conv_start..].chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060preprocess_strftime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/time.rs"},"region":{"startLine":3393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cefdb99f686a4d7a053e4b748fef740232fe5d80153b3c9a654b1bb76b52de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sec.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_f64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process/rusage.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7f0672673257625d7c520f4f2257686723e8ffef5adee5c86f20920d2c3314"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.usec.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_f64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/process/rusage.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"37685329e10987e8cf579835249ee3e07fd520408e93743b0c9e8aac69d42262"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060float_to_r\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74687d438dc187ad487a7b9111b1b34031f310797c920f8f0cb67a49c9a09a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060float_rationalize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8909162b6dca1d20ae4e9c4d45947c9bf0ba6232b6e8cd5c47be62409d25a70"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060div_floor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be91b6816dabb7169251f43cd9ceca383e014e5c6e3cc38f2a8d49bc8f2ff67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060floor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"d723f917d8b24073b449b73207ab653153dbaf39201a7273b076cc5067a6a481"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ceil\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da1e078a9b18a2b26b38a4b948c8e8d0a636df3cccb5754b60943efe9fde156"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060truncate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d4ae67d752b7a815335786a44408e95919ca3a4f5b1aef0096659f773463d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060round\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca0e37e220a4a9ed667dd38fdf4bdd6abc6c6567818aecadc9c67fcf48161a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060finite\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995f7954da62edc2f8c03924a9dbf49647fba2e0f5d1b2d11e3748c2c7e9c9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060infinite\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686bf757d6ad7e6b7684125670260f72b3c5bd098aaf1339559bbb9346780bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060nan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3f367c8187dffaed13780fd3032a3e0643f08ce99d7edad76333e121f9ede8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060abs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15a6cf66e766ea149bde7eaf3e6f7d10e7d800bc2be8f11ec2dfc02b3af2a09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060angle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca63c4684fd46ee7b4f8dc6b38f970dc179b2860d4ae14e988a6c68ac533437"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060next_float\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fb0a59fc8c36a1408766ca5f4c1c3a193201439fff25427105656e1d6aae4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prev_float\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5f95ef318ee7dbcd8c5895c6b0695a7442ea951380a83cd3d3ea1306c0e598"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c915c9b665f8f3e35dabf880c026bcf44e1a54f3f95d366c81fa2a76b618432d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lfp.self_val().try_float()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060float_eql\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/float.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"43760484343a795cb4c017106199204380a9dca9becadce77c767ea9e924ac4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(i.get()\u002B1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060integer_succ\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f121209a89aad1be538df4d77318391f17dc57e156dd9fc1a006f4e4c24ab13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.to_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_f\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"438173c81a04008632c8a736a4dfc6a08be0ad04818c243bc0d4e2c6212f70b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(folded)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060integer_shr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a42cf8c141811d785f20d30b9dafae75e7b5eeb3bd3a0ed3072ea7b953e39f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(folded)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060integer_shl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a341425079f785366491dc8803bded13a6083564443b58b96932993558e5acf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060integer_rem_int_rhs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1befd093c9ba608a0082e8fd9611a366c366efd2fc490dccbbb472225361ae25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060integer_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f810ab3bcbbd1747cb750d69f97a8781b158a530b3542397c93a8ec1ec78fcdd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Immediate::check_fixnum(bit)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060integer_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf92b5bd7b4b1c9aade9632fa180ea59a2cc251e56c0a08c30206dce42842a14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(buf)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_integer_base\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b191e32ecb65e01d6c3159768ddc4006ee44a2fe22b5548dcd6d5440dc030"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rem.to_usize()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_bigint_base\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fddbcd5f5f1472f44ab28ddd9f4d12ac35908b05ad5201ecc17d2299d60a646"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(buf)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_bigint_base\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/builtins/numeric/integer.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a2303a84b65e19aa07413b84a08511edb8eb64ec821be20f4201913e3a3359"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DefaultEditor::new()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084c90cd6ebc165bd4c6bd087203b2e1b39220eec8939ed323ba100fccbc3ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Executor::init(\u0026mut globals,\u0022irm\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ef705a3e748440d6b510acc0388cb7162cfc59b8b143e2a8154b2102d71b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060monoruby::parser::parse_program(String::new(),std::path::PathBuf::from(format!(\u0022(irm):{script_line}\u0022)),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c777081d521a4bb3d70b9332a3272cd69bc7551be721e1d5ea365cd2fe3bf844"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060monoruby::bytecode_compile_script(\u0026mut globals,parse_result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c06c5556e20c1512839d663561e9e8c77faeb66fdaf7044def53dcb332cd86b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rl.add_history_entry(code.as_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"16977b220b4d8e6e768897492ab9790a005cb8a5e8d83b1f06fe7c63ee50c9eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rl.add_history_entry(code.as_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fcd26f54ac366d547831ddde8cf01135318f3f022f9ffe2516b35c7f7256c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060binding.binding()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/bin/irm/main.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"947b020cce8541adc2eadc37fb54a3cd070e2a6fdf6dd8cf971aad24658dfc01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mrhs.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_mul_assign\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/ast/node.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f4f842843d953c1e602da2c0bb97a87cfcc9ed3260fd0606af22da029acd9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c07d294c6aaf788a2998ce01ae865b2bd5fb8123c14dc98bc38475ecc6b77a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43fe06905b12b6a8cb5d2e6a77cca00f13fcd84a58be9ff7f7a6e231b06baa6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(gen_include.join(\u0022libxml\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8929365b03e75d31f04a9cae5cd87fc8716d6e77e1f84e50e306ff4af035b223"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(vendor.join(\u0022include/libxml/xmlversion.h.in\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"163f55eb2731ea26a24a62a897f58f3b7a03ad010c97a72834623c0b9fff884b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(gen_include.join(\u0022libxml/xmlversion.h\u0022),version_h)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"499fe9f048c310b9d235881225af7e31c80fa36103f2baebc24b65420302c0bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::copy(manifest.join(\u0022config/config.h\u0022),gen_include.join(\u0022config.h\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcc1296bf4eeae1790f34c949e710c1bc254a31eb1963023b8b1bfacdeddec5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(\u0026gumbo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5384081740fe55304b87a439b5527f5db02c57c31bdff62783ae95df3ac457"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"466b134bbb9f466ae2a4ec72a4b144de3be2f5b89bca36c796ece1ddf5e30b48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(xslt_include.join(\u0022libxslt\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b46cde52c6b22acc2b876be09ae28cf757e33bfad482bc5f8638a7cc9f013d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(xslt_include.join(\u0022libexslt\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f6fb1a5df015e9bda62adf1be48f698b6a63aa29366547bdfa1a262faaf74d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(xslt.join(\u0022libxslt/xsltconfig.h.in\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6492ca81b6b94f8c05c8eb90ada9310a34f9c2402d880a6055607c45c7f290"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(xslt_include.join(\u0022libxslt/xsltconfig.h\u0022),xsltconfig_h)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c45cdde9271bee7ef4e9d1ac951526ee3e88ebfe036be2b0cdada6e11976f91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(xslt.join(\u0022libexslt/exsltconfig.h.in\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72d14277ff634ec9cc9a38107794d94f65083f1b0fdb9a8334557b544b91fbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(xslt_include.join(\u0022libexslt/exsltconfig.h\u0022),exsltconfig_h)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37dad7ee0d9321b488fa810ec470dc1a60649bcfb0db3b0e334b08f4f29b3e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::copy(manifest.join(\u0022config/xslt-config.h\u0022),xslt_include.join(\u0022config.h\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f589dd74071c8172d7968ec7596f6b2b8c259b3a2467867f7ab2ac4e40fe37a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(xslt.join(lib))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee0ab8bab8ce1a3eef9e2792607d205f05a73c03e83bc82dfe5303f42bb5446"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/build.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2575c257aa4fcb85c5913d27b10ceef579f266edfc1e7ac23a9daec9196eae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060free\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060xml_free\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libxml2-src/src/lib.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f54bfc5ddc3d8ec5e0978d296fe1d060047180d652b3992ce603b706986d590"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_vendored\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libsqlite3-src/build.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e26761a27933a640ebd234c85a2f3595433d53dec3f6295b729bce882035cba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060other.get(k1,\u0026mut(),\u0026mut())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eq\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ceabe95aecd0a89bfd50722bc4405d06c3acc49750caa4c35d1edb1f416ab64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(key,\u0026mut(),\u0026mut())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"538547a0c992e7f9bbeb54968b1a3e3ec4f79e5634f80225c2fc27781839c4e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(key,\u0026mut(),\u0026mut()).unwrap()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/map.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"337458c1385e0659e1e8c26b96ffbad7af9c2a09c7bd64fd261e00cae9a99ac3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_layout.calculate_layout_for(buckets)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_uninitialized\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33376ae23d90f90ab49604fe8e8f4dec5a5f6c113f0b62123084c9db4bef941"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(alloc::alloc::alloc(layout))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_uninitialized\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bac3c54fa81c89e4b02ad3c024be338b05e3f0755b6b5ce8181dc6debbb7ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060capacity_to_buckets(capacity,table_layout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060with_capacity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44049f46aa93539615f7b8dc861cee02e5d525d00e6e5e990f15954f5ad154c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bit\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_insert_slot_in_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashbrown/src/raw/mod.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6893acd7fbac9e1fd074ed1fd1ba553b8ab47a7f1c44bf1bfc2cafa5b87f30ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.borrow().as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sqlite3_module\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"122365fc6e00275c5d5f9f340e34b817eab5288ee97b45b03763ba325e5e5cee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u0022main\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060db_filename\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"05447605742284310486067d45825600d92a137a3764804cace65ea8f6f6f384"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u0026bytes[..upto])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060function_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/sqlite3/src/lib.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6286c0c625c6ac125aa87e18f40df73ad3710aa32cd5741b52b4530b3b4586"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u00221.0\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/document.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"28508152da19ca0c95b17e5b8e62acec772786fcf8df3a3f08299ef9591f1eef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u0022body\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fragment\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/html5.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"34352dc33de4b7f7ecca1e057475c44cebed39d6e1dc43cd8ab3cd8bdbe0340f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.borrow().as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b081df8fa411f1ce7d53c5de863162951de795de54210b8db03c8deffd4dca4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.const_get(Value::UNDEF,\u0022StandardError\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060nokogiri_init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"714fc3d3f0eae125302150514766a128896446caefa0274de7db1dfb115ee7fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.const_get(ctx.object_class(),\u0022StandardError\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060standard_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/lib.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a2a3e79fcc1a6c18bb419e8b21ef50c2a2af90ceef6f5586243d37abf2c8c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u0026bytes[..colon])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"7799e644e7ed603f577816ad0ed4a254703dbb44d1dac231fbe11be4a7567ebb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u0026bytes[colon\u002B1..])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6abff090e4033b29eb71b5f9871931c5e6b9794055620ca2f8a0cbc10fb80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(\u0026bytes[..prefix_len])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"13524a4bf86cd26bd4e06dab249daec1a5e67618b90e75a680c1cdc3434ff639"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXmlNodeSet\u003E(v)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_ptr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node_set.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5fdd7ea7f0c23f83251347b3e4ce854012e25af2dc6aa90711b704495e6a37"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXmlNodeSet\u003E(rb)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wrap_node_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/node_set.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad544db107203041dea33f756add89f8fb0d9028d768fe2d5b9e0767aafaebf9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(\u0022UTF-8\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/reader.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0fd90d2c9f9d52e0df4883717ed59d2596d48d308fbb7c81a44e3ca6ac5b24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXmlSaxHandler\u003E(v)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handler_ptr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9e8ffa6581428ad4c9fd74beca6bcc12885f95b7b2e8876d1ee963c28a51a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXmlSaxParserContext\u003E(self_val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89b8e82e173c1d4e6022c26cdb31d6b620911419e520506d288258a98cfd4c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXmlSaxPushParser\u003E(self_val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_push_ctxt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"040ecdcb3bb617a4c4ae700e14d8a7f9012253124c759002de641b46a8ab87e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXmlSaxPushParser\u003E(self_val)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060push_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/sax.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd28246629fdcff27188c4ca42437a501e0d8c31246f435d669bb8122e3e339a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.native::\u003CXPathContext\u003E(this)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/xpath.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d80f14582705639aeaf96ad73e170e2f850dbdf9f31d0c2360f2151d8c81c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.ivar_set(xslt,\u0022@modules\u0022,modules)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/nokogiri/src/xslt.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec7da49178ed4eddc9f096418f152aa88306b3373b031328d20ea4f210f631"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003CHmac\u003C$d\u003E\u003E::new_from_slice(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060hmac_digest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/digest/src/lib.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c596eec38561555fcd1817fa73bf3ba431f3ae0b13b439a9f84f2e20af738a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060parse_integer\u0060 answers \u00600\u0060 when \u0060ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/prism/translation/parser/lexer.rb"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c554bb3ab8a30db756f8836687d5f7f458341bfdb4fa17c8f68f403c2aada6ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060parse_float\u0060 answers \u00600.0\u0060 when \u0060ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/prism/translation/parser/lexer.rb"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a93030700a31831ee9cf24e4e521216a6774490d9c8eacb819ccd495995dd5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060parse_rational\u0060 answers \u00600r\u0060 when \u0060ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/gem/prism/translation/parser/lexer.rb"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2aad4f9d01d380de3cc04ffc6a7eb40c7387f0ed4e06da4513ee0cfaf6b098"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060elf_functions\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/prof.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"c047622688ce3223a0965b53069a8f849a8d5be32447f7d45104331b8d0d3c7a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060mac_held_len\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"monoruby/src/value/rvalue/string/transcode.rs"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b2be855d91153b7e4fd8bfbc66e453a462b9e560ff55102c91193a4f670964"}}],"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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-295","guid":"a706c4e2-1232-8859-ae2e-17aa2d41f8e2","name":"Improper Certificate Validation","shortDescription":{"text":"Improper Certificate Validation"},"helpUri":"https://cwe.mitre.org/data/definitions/295.html"},{"id":"CWE-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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":126,"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."]}]}