{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"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":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"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":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"Mir::rerun (cyclomatic 59): Mir::rerun 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":"rust/mir.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f677bdcf29aae55250122249900ad5e4db33ef6dd85cadfadc53406111ed16"}},{"ruleId":"D1","level":"warning","message":{"text":"Mir::exec_instruction (cyclomatic 41): Mir::exec_instruction 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":"rust/mir/interpreter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"53537ed781c06a1b224d482e1ef1cfd63e33d740c1f86b6182c413787dba4bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"GreedyAllocator::color (cyclomatic 34): GreedyAllocator::color has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/allocator.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b6f423f71e625b11ca523ac3d595d12f2cba327b5f0095327f8e3e7191af5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::create_binary (cyclomatic 34): Builder::create_binary has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"14906a1ff51e0bc73eaefc063ce6a6713964c8cfcbebba854fe1d5e13c8811fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Mir::fuse_fma3 (cyclomatic 32): Mir::fuse_fma3 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":"rust/mir/peephole.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44da2ace864dbba76c21424104ca474afaedfb88a25f8fc1977965b8aeb61b7"}},{"ruleId":"D1","level":"warning","message":{"text":"MirWriter::push (cyclomatic 28): MirWriter::push 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: MirIterator::other (cyclomatic 34) 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":"rust/serializer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc1a7b60ec718c67d88a120006dd498ade49f5d6aafb43c6b293e7b164472b9"}},{"ruleId":"D1","level":"warning","message":{"text":"RustyCompiler.__init__ (cyclomatic 26): RustyCompiler.__init__ has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/engine.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf28b4a92e7b9cde3226cec031e1871a5ff7503911be600678dc5ebe35ed2ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::fmt (cyclomatic 25): Config::fmt has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Config::set_option (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":"rust/config.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ab29f6a517975d35b00cd9611f212652eeeb750a11fcf78d962de025a05ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"GreedyAllocator::create (cyclomatic 23): GreedyAllocator::create 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":"rust/allocator.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c844b7d944863727c506ff165d72d9e281937a5133a6115fb1bdfe798b8d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Node::compile_binary (cyclomatic 23): Node::compile_binary 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. This is NOT this file\u0027s highest cyclomatic complexity: Node::compile_unary (cyclomatic 25) 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":"rust/node.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"150661723fc3591f6c2c99321da3b2aed32fae96ebdf8a2cd877c01210ee7843"}},{"ruleId":"D1","level":"warning","message":{"text":"IndirectTranslator::translate (cyclomatic 19): IndirectTranslator::translate 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":"rust/compiler.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f29f11cdd35a3e7f204689fefac8a9050adff5935086b902a0fc066fa080892"}},{"ruleId":"D1","level":"warning","message":{"text":"Mir::fuse_save3 (cyclomatic 19): Mir::fuse_save3 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":"rust/mir/peephole.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe3f94c48895519c5be0c7fb54a634bc8ae919d53abe6117b12d1e910cbd5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::add_binary (cyclomatic 18): Builder::add_binary 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":"rust/builder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"111bd2f24e6266496986a03aaa774e565de2d3831941fe0bcaaaddc9a1cf4349"}},{"ruleId":"D1","level":"warning","message":{"text":"Mir::fuse_fma (cyclomatic 18): Mir::fuse_fma 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":"rust/mir/peephole.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb7f8e034a589843568e02a9eedae54019c6c9fcb4ef2f6cb885b8ecbee18d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::symbolica_fun (cyclomatic 17): Config::symbolica_fun has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Config::set_option (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":"rust/config.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3224ada300bb4402c9f8c1aecc3d0449034599d32c6836e290befa17b62356af"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::rerun (cognitive 78): Mir::rerun has cognitive complexity 78 (threshold 15). Drivers by points: if/else 20 (51 pts), match/switch 11 (25 pts), boolean chains 1, loops 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab10c7cd4d357deae26908fc5ae0d58ed6e8c0a67fa364351f0ad12d80713bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_fma3 (cognitive 55): Mir::fuse_fma3 has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (43 pts), boolean chains 12 (nesting depth added 24). 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":"rust/mir/peephole.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13171cd277ba0ae8cdaa1de8cc2b62a270f05a3a3888dba716633727963cb23"}},{"ruleId":"D2","level":"warning","message":{"text":"GreedyAllocator::color (cognitive 49): GreedyAllocator::color has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/allocator.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6550f1c36d76df6d712e9403d7a3c5195fd19113e6a5926f62243b61164cb1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Compactor::collect_last (cognitive 40): Compactor::collect_last has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (34 pts), loops 2 (4 pts), match/switch 1 (2 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":"rust/compactor.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaaf22a74cfd725a889611cc35c226337c898e317c2216b683c3d6dfc641c54"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_save3 (cognitive 38): Mir::fuse_save3 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 22). 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":"rust/mir/peephole.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fef492d550c7b569e78fce428136dccef0ce7ce37c045e8535939cc92de76e"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_fma (cognitive 37): Mir::fuse_fma has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (37 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/peephole.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e47cd804c0a25423c58e4a9eb3720593b7ff7c16522aa8e624d4587ead72cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::can_compile (cognitive 36): Config::can_compile has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 25). 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":"rust/config.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5ea4924cb26aec56ce8627208dd9def45032849d4208b64f2b9240b29fc429"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::fmt (cognitive 24): Config::fmt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24. 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":"rust/config.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5936e75a2e4ddb8ba5a492259c7cf3ff9777e94592879f58504a79735f4981e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::exec_instruction (cognitive 24): Mir::exec_instruction has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 3 (7 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"44537b04ea82214cca8a31172a37b0973fbeedc2375d6e6bf861c0e34a10585a"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_recip3 (cognitive 24): Mir::fuse_recip3 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2 (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":"rust/mir/peephole.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b8ae195a372051878d3bc1525fa717bc6f28ff403e3469c69daa7cbfce4390"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::new (cognitive 24): Program::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/model.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"393d9aa4d640f1a2617974ad0292c5d78a2702d59823c5a45306b7e53e0d9826"}},{"ruleId":"D2","level":"warning","message":{"text":"RustyCompiler.__init__ (cognitive 24): RustyCompiler.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 17, if/else 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/engine.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"839b1c7a4811dae11229b3c70f69cbd6c7528ce0ed0fdf9c8dd58e9fa4649cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"GreedyAllocator::contract (cognitive 23): GreedyAllocator::contract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, 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":"rust/allocator.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e0a3f3da4397618c235a69d5f501167a9c27e71c30d8c3c29bbd3a90cfb009"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_times2_5 (cognitive 23): Mir::fuse_times2_5 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/peephole.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdb11891812b327b16bea91c8329f5af35c12342c611d7361bcece320675432"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement::compile (cognitive 23): Statement::compile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/statement.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c50c546ccd2226ca263ac5bd015f3313b976c4b3f68d8432a1ca0248ad0cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Applet::evaluate_matrix_without_threads_simd (cognitive 22): Applet::evaluate_matrix_without_threads_simd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (11 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":"rust/applet.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e749f2c7ccb00a88599c9f7dbfc8d8685c70dc0044212fb1662ef74c9d6d7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"MirWriter::push (cognitive 21): MirWriter::push has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (2 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":"rust/serializer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"165391a16fe6fa5ea39c90e983a6899a9150bdcc0e4a1e2199708a86b549fd81"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::add_binary (cognitive 20): Builder::add_binary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (6 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":"rust/builder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"77386f17a79974c7449f1f91ae6baf052f8568e0e54f87f3effc360c799918fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectTranslator::load (cognitive 20): DirectTranslator::load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), 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":"rust/composer.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5613b829c4ec419f14d800a63ccd042f50e127ffd214385ef3f18042631c90e1"}},{"ruleId":"D2","level":"warning","message":{"text":"IndirectTranslator::translate_external_fun (cognitive 19): IndirectTranslator::translate_external_fun has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"314c2bbb6e8ba344858b55279846f3673781733daec2a42e5506b065dc04c79e"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_load (cognitive 19): Mir::fuse_load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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":"rust/mir/peephole.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e91ee7be1e8639bcc92c0eb5541cccadf8a4df0cd07583fb20f3d083b4680c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Prefix::evex (cognitive 18): Prefix::evex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, 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":"rust/amd/f64x8.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c6c1ea7cbac26f4658b00c8da510d59614fd3da8ff6a4cf613569b5f9f4be5"}},{"ruleId":"D2","level":"warning","message":{"text":"Application::exec_vectorized_simple (cognitive 18): Application::exec_vectorized_simple has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (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":"rust/runnable.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fbae2805f0d127c5a29a5970bb72516c7c1c72b376a314c9afb4792b665ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"Defuns.__init__ (cognitive 18): Defuns.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), 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":"python/symjit/engine.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"280d75e21b3f1d918dcb174911d5750d03777658c397fc03543b507a7984c7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"GreedyAllocator::allocate_loc (cognitive 17): GreedyAllocator::allocate_loc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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":"rust/allocator.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"99acf9fb5d50f7c25ad7280306fdb69b7a5bc90a362461164a5a983bfaeb5674"}},{"ruleId":"D2","level":"warning","message":{"text":"Applet::evaluate_matrix_async_simd (cognitive 17): Applet::evaluate_matrix_async_simd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Applet::evaluate_matrix_with_threads_simd) 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":"rust/applet.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5176fd832e04d07c4a18e7322a25c590bf709ca25e5b7541c660bba6734f3e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Applet::evaluate_matrix_with_threads_simd (cognitive 17): Applet::evaluate_matrix_with_threads_simd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Applet::evaluate_matrix_async_simd) 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":"rust/applet.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e58f433d3bd7d91edc08f76051f49fd23fb88e8fd8af1f2209b079f71b27466"}},{"ruleId":"D2","level":"warning","message":{"text":"symjit::rust::lockstep::run_lockstep (cognitive 17): symjit::rust::lockstep::run_lockstep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 4 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/lockstep.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63b3014844bc13a57f190fd14f2de06b9b7c662fe65c6fe9f9606dbe53a7f36"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectTranslator::append_fun_generic (cognitive 16): DirectTranslator::append_fun_generic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, 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":"rust/composer.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b980fa84b93f6b2c126a9daf3e3199c18a9873978293d0cb1604d81ef3e7e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Mir::fuse_save (cognitive 16): Mir::fuse_save has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/peephole.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6f101e680a55bd40ecb5e05bf0f5546bf097ed4b1f145a669e584cdc39b11"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Amd: TooManyMethods \u2014 313 methods, declared across 3 files: amd/asm.rs (220), amd/fused.rs (51), amd/f64x8.rs (42). The bar is 30 methods; this is 283 over it, 10.43\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":"rust/amd/asm.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9482582d1273c9ef1355af04e9412d370e38aebf998a68790538ca21f9303576"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Mir: TooManyMethods \u2014 120 methods, declared across 3 files: rust/mir.rs (97), mir/peephole.rs (14), mir/interpreter.rs (9). The bar is 30 methods; this is 90 over it, 4.00\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":"rust/mir.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6700598ecae4b10f2fc563ac53fe32ff980d3a001ed0a6edfda19e9ffbcccd1f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/config.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"08497c8130e37b39bf4bbdad866d59b890a1a343c4632590a2716e037e3b74cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Composer: TooManyMethods \u2014 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/composer.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cfeb6aec16a30bbb4dd33f07753e603904b4f316bdd56d30f8741dc8fd4194"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 86 methods, declared across 2 files: rust/expr.rs (79), rust/model.rs (7). The bar is 30 methods; this is 56 over it, 2.87\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":"rust/expr.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69b8bb79dbcacdbbfae0a7fa3ae28ec190319682e2eacbc4d9dcd2bf5c07d62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirIterator.other: MethodTooLong \u2014 other runs 275 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/serializer.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2d6e67e55e477f65e965b5e7f8eeb2921b922f6fd2140af8347903152f8894"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Amd: ClassTooLong \u2014 1045 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 313 methods, 2 blocks, lines 11-1661. The bar is 400 significant lines; this is 645 over it, 2.61\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":"rust/amd/asm.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c07ffc897ab73b56df36802551815e8d9bc7b9159f4cf91fa88652cb8c15cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/mir.rs: FileTooLong \u2014 1180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Mir (6 blocks, 335-1639). The bar is 500 significant lines; this is 680 over it, 2.36\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":"rust/mir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d78acab05eb840abeae663fab2a4278479424ab94990013d827d623229eb8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VirtualTable: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.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":"rust/code.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c834c7f18334111afc5402f6e0efc6054b0a6517346c7b508385a21c14714cb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: amd/asm.rs: FileTooLong \u2014 1053 significant 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: Amd (2 blocks, 11-1661). The bar is 500 significant lines; this is 553 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3f4ee48cf6887f47866a841978e625630502dc4728a95db90ac109cdb1f7b0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Mir: ClassTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 120 methods, 6 blocks, lines 335-1639. The bar is 400 significant lines; this is 439 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":"rust/mir.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aed992d7c3e713f6d7b07259d05c8f94d3fc11e6a830e83fd561041d1be342"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Arm: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/pyengine/arm.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9932a309b8a16970bf32871889379fc42f8755d1e32a3a7dd673e0b711ab29"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Complexifier: ClassTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 4 blocks, lines 51-1175. The bar is 400 significant lines; this is 267 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":"rust/complexify.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c96be068534c5d9573b7746af311e9f3544dcdb8e45023e7106a34e6ff860b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/serializer.rs: FileTooLong \u2014 832 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: MirIterator (3 blocks, 434-1080). The bar is 500 significant lines; this is 332 over it, 1.66\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":"rust/serializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c99acaa9a07d473193044408c138df8f9908d53f75411fa37f6866b3fee90f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 99 methods, 6 blocks, lines 65-1258. The bar is 400 significant lines; this is 256 over it, 1.64\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":"rust/config.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dd010e3698932094b6782d6ff098755688b21a56e5e5aa972ba86b73378ad2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Amd: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/pyengine/amd.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c68ea08a704098286f7c3fc1ac29b194bdd749fabd19bb25d733171a36f8a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArmSimdGenerator: ClassTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 4 blocks, lines 14-1028. The bar is 400 significant lines; this is 241 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65613ce194b8ee12c1b4782c41d37e00812d31fd6801c5570e555b454cccf36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/compiler.rs: FileTooLong \u2014 799 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 299 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b6b4c56607698d95e1bdfd15ff6748c44d96bf2694a81bd63299a3f91b2e07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/config.rs: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Config (6 blocks, 65-1258). The bar is 500 significant lines; this is 294 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b41e4421d51588a4ab11dbaa042256090d1909230760461fb91c829f391aa2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GreedyAllocator.color: MethodTooLong \u2014 color 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":"rust/allocator.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f549af0594c8617712d50dec878ee2adcfb6752eb77f210c6bb47ce468b7159"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mir.rerun: MethodTooLong \u2014 rerun runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"161d063b31d2698ade858066298c95e14150031c7d7d07fd932966ff5d5c13fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mir.exec_instruction: MethodTooLong \u2014 exec_instruction runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"35616c76b6a76088cda9d4d9c680bff695f26017587ed8c6d4022b5c154f5b20"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AmdComplexGenerator: ClassTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 4 blocks, lines 44-1010. The bar is 400 significant lines; this is 207 over it, 1.52\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":"rust/amd/complex.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bf3d3376ecd499ba45d476e720fd86f0a8283fd558f274dfc0310ee31b61c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RiscV: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 5 blocks, lines 29-1093. The bar is 400 significant lines; this is 200 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":"rust/riscv64/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d632ac9a3842c1d5c6efee0d03b0c1f499ac02fd2d357d3ab8637f276cd28bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArmComplexGenerator: ClassTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 3 blocks, lines 20-948. The bar is 400 significant lines; this is 194 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd7a5b5e8f2582ae6b4d5bdffb00927f749e28ae8c57e1d4ef2b9c0ca97a82a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirWriter.push: MethodTooLong \u2014 push runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/serializer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fc46b5e04236eadc1b43b1cb6d577d8036c9508e8bbe390708406b4e4108d9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Node: 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":"rust/node.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"403717d998bde7a9a8745abde5410125663713dd1de588149041ed25b65efef1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Application: TooManyMethods \u2014 43 methods, declared across 2 files: rust/runnable.rs (35), rust/compiler.rs (8). The bar is 30 methods; this is 13 over it, 1.43\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":"rust/runnable.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe2c257e10b1e353475988ca758d5bc8b28a1c0b8e68825188b7cab27f3c5b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/complexify.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 95% of them inside a single declaration: Complexifier (4 blocks, 51-1175). 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":"rust/complexify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58d0c6b8a999dd638268a28ea8102a3383505f94e7fa751f4792b45a37a6a15"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Application: ClassTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 3 blocks, lines 48-945. The bar is 400 significant lines; this is 160 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":"rust/runnable.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fcedcc373c5a9e28ebe13dda6218f8f81b0cd5002cafb607f8839cb1c8b9f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: riscv64/mod.rs: FileTooLong \u2014 697 significant 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 86% of them inside a single declaration: RiscV (5 blocks, 29-1093). The bar is 500 significant lines; this is 197 over it, 1.39\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":"rust/riscv64/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c78108a3d3e79b91c328dcd215b9ea05f4264b5badda70c7747729ab9d8238"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AmdVectorF64x8Generator: ClassTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 62-970. The bar is 400 significant lines; this is 156 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector_f64x8.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a9aecf74fb95f134d0e58cff199531b3689ea17b91c32af9a1709ae245df45"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AmdVectorF64x4Generator: ClassTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 55-958. The bar is 400 significant lines; this is 154 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e7dd55e6835a03e37f4a671a88dd7b0b7133b52404fc20eba591e3cb7cf48a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/peephole.rs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: Mir (74-1014). The bar is 500 significant lines; this is 151 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/peephole.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"327cd0063960684bec02340a417060594caa6950887e0054b2ab947d61328f93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arm/vector.rs: FileTooLong \u2014 650 significant 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: ArmSimdGenerator (4 blocks, 14-1028). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cf5508e696a5d13451e5b54bd4d0b27f534544fb66a247d4a066f32c574dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Node: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 3 blocks, lines 17-753. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd463b2c9db0358de6a188b084bc1a741e73b417d8f6b95bd0c249fa272f569"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MirIterator: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 434-1080. The bar is 400 significant lines; this is 109 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":"rust/serializer.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ed1e64196b04bcdcde3cfe79624390099e0655d663ad0f7deae1442aa03e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: amd/complex.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: AmdComplexGenerator (4 blocks, 44-1010). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56acf3919ae7a3466771d021bea7351554581bf0094aa4caebe9b2b62b5d298"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/runnable.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: Application (3 blocks, 48-945). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/runnable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca660a70baac350bcd6040bbfa7277d703b38f9e5ce822ab5a99ff98f73603c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: symjit::rust::sympy: 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":"rust/sympy.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"684c0d46478d0cef8bc27ef55cf12a64485993a623cb790f577c364367e409d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arm/complex.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: ArmComplexGenerator (3 blocks, 20-948). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cee75838b911cdbff4742186171856c61e556949136691191cd87fbec03a103"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Block: 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":"rust/block.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73638bf9c6072dc84c0763893c4131c11807c0160b3e3065f542f7af77b6621"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: amd/vector_f64x8.rs: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: AmdVectorF64x8Generator (4 blocks, 62-970). The bar is 500 significant lines; this is 95 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector_f64x8.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1646720cd22955dceec90e36f62c6ccfdf6cb94abf6d1968518044d7bdc20ab1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: amd/vector.rs: FileTooLong \u2014 589 significant 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: AmdVectorF64x4Generator (4 blocks, 55-958). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"250fec7d955439db5cc7a2323e4d6821bd1f2765040cb1d1df4a0427101a9bf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GreedyAllocator.create: MethodTooLong \u2014 create 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":"rust/allocator.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7034e0459c10558edfee623d37f757ade3521e212df403601b5246ac9052c171"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AmdScalarGenerator: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 4 blocks, lines 54-793. The bar is 400 significant lines; this is 43 over it, 1.11\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":"rust/amd/scalar.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2849d84678a0127c9c4ffd873ea7eec41b7cd7e8e5fcf85dd958ac71f357f00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mir.fuse_fma3: MethodTooLong \u2014 fuse_fma3 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":"rust/mir/peephole.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4409eeb3eadb4671bde62b9698d0f74e0ffccd1145cb5b8ba2a9480a04d4761b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IndirectTranslator: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 3 blocks, lines 635-1271. The bar is 400 significant lines; this is 32 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9237b89836439deb2af517b1aa631d33a786ff098cd6e30993ea7b6577b17a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AmdIR: 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":"python/symjit/pyengine/amd.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946898e43283599bc5df94e3120f4405e5ee4515c079ff8742152fc1926e55d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArmIR: 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":"python/symjit/pyengine/arm.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"660d8f70a972c6db2529d6c2e9379600910b78c026791ddd8d138ba68443054e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GreedyAllocator: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 36-653. The bar is 400 significant lines; this is 21 over it, 1.05\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":"rust/allocator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"00732062e01b795467da91c665b3131d0897b73846f2bb641f5c9aede13281b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/node.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: Node (3 blocks, 17-753). The bar is 500 significant lines; this is 24 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":"rust/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea556bc497e4266d9eb00cbfc006944732075ffabd43ea2366ddfcdf0999a81"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: symjit::rust::arm: 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":"rust/arm/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cfdf2ab2224c1ab68e6c0b0289d8d0308833943c80b90c844f3e63cecc0e45"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AmdSSEGenerator: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 4 blocks, lines 54-753. The bar is 400 significant lines; this is 10 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":"rust/amd/sse.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"185dd456d6b6fc377ce3c009b699d7748bea79d6b1634966fa64b5af6e66c4b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mir.fuse_fma: MethodTooLong \u2014 fuse_fma 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":"rust/mir/peephole.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4024187a2a46e9e6333fb6d8d8b0be9735c580c999fb6843ff80f94d4057bd4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 19 shared lines): rust/amd/vector.rs:127-155 | rust/amd/vector.rs:157-192 | rust/amd/vector_f64x8.rs:134-162 | rust/amd/vector_f64x8.rs:164-199 \u2014 These 4 members are variants of one another: a block of 19 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":"rust/amd/vector.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b9d4a1798e390e1a4b1bcfbf1fc234fe870e5f20e8ea5c689f52373f85cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 14 shared lines): rust/arm/complex.rs:63-89 | rust/arm/scalar.rs:57-86 | rust/arm/vector.rs:47-106 \u2014 These 3 members are variants of one another: a block of 14 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":"rust/arm/complex.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cad2a65918e39ba5962a14a4accdd5328d9da66c9c7f32ff6f645e020dd836"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust/amd/complex.rs:78-103 | rust/amd/scalar.rs:85-113 \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":"rust/amd/complex.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2acacdf1e4012b0080de96cc8a826e29a2ebb1d5133f7a70a96d108355bdee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/arm/complex.rs:817-828 | rust/arm/scalar.rs:538-549 \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":"rust/arm/complex.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eee269f1cef51b51aaceac3a69b5b76e36b5cc8aed42e788bd639c5725a28d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): python/symjit/ode.py:38-60 | python/symjit/ode.py:106-129 \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":"python/symjit/ode.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b85eef7f092d1f979512dde14d0451d5922782101a30dea8f43ab2b66ac842f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust/amd/asm.rs:198-216 | rust/amd/asm.rs:218-236 | rust/amd/asm.rs:238-256 | rust/amd/asm.rs:258-276 | rust/amd/asm.rs:309-327 | rust/amd/asm.rs:329-347 \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":"rust/amd/asm.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbf7de4a2b9241c03ab8a7f8390f7b9face849930934a13a7928f340fe37ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust/amd/complex.rs:859-873 | rust/amd/complex.rs:876-902 | rust/amd/scalar.rs:645-658 | rust/amd/scalar.rs:661-687 | rust/amd/sse.rs:607-620 | rust/amd/sse.rs:623-649 \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":"rust/amd/complex.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"da21ab4c8ab823cfc30e806ebb408064215f47c411130e6bfd95bff3ec27af61"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust/amd/scalar.rs:450-465 | rust/amd/sse.rs:400-415 | rust/amd/vector.rs:596-611 | rust/amd/vector_f64x8.rs:604-619 | rust/arm/scalar.rs:374-388 | rust/riscv64/mod.rs:685-700 \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":"rust/amd/scalar.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9cd24265b38e6abd31fcf35369920b65eb8dfd9a6c26a7faf36be572eee3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust/amd/complex.rs:839-854 | rust/amd/scalar.rs:625-640 | rust/amd/sse.rs:587-602 | rust/amd/vector.rs:763-778 \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":"rust/amd/complex.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4959e03128d2f46cbc08158858b7460b510332a85b83c5d21bf47d2b456c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): rust/amd/vector.rs:194-251 | rust/amd/vector_f64x8.rs:201-258 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35604f46edd57fa9c6af46098580edc21caae9792d52ba636331ad127fe41a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 31\u002B corresponding lines): rust/arm/mod.rs:152-182 | rust/arm/mod.rs:184-214 | rust/arm/mod.rs:242-272 | rust/arm/mod.rs:274-304 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 31 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":"rust/arm/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a028ef95c66065e5e986490e9f1dcf930d5c8961545748e365ef062866ae210d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): rust/sympy.rs:52-130 | rust/sympy.rs:150-210 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"184833ca0bdbedcd73cca1822345d612c2e6d6110123be318490d3a092f90722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust/node.rs:452-485 | rust/node.rs:506-538 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1d79029c412961d1a3bd396d631a5ef3b1bbee3b727be2ecb7223675da16cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/arm/complex.rs:694-712 | rust/arm/complex.rs:716-735 \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":"rust/arm/complex.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"2914d8524d19aeacccfb08371afad3736b7609953aca60b357b99675ce210da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): rust/amd/mod.rs:350-390 | rust/arm/mod.rs:433-472 \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":"rust/amd/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44d1fa1c94567cc8077798cf016ace92f13697b57edf59c3a2b84a912df980f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust/applet.rs:453-482 | rust/runnable.rs:658-689 \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":"rust/applet.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4505b60407153e6e544cb07cc4e136af3529b5a51b7e6bd0e56389cd4608a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust/complexify.rs:242-263 | rust/complexify.rs:269-291 \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":"rust/complexify.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7eb4a82be84747ab7edd67ef8d9c29472651d74bd6982f5b0f7e8530a9409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/riscv64/mod.rs:359-377 | rust/riscv64/mod.rs:379-397 \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":"rust/riscv64/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bffb04fa246793fd0cd0eb078543ea28297b00061c5bc18347bac17ccbfc32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust/arm/complex.rs:832-849 | rust/arm/scalar.rs:553-570 \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":"rust/arm/complex.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad6627c4eaab6ec5d2394ccb56668f050d283d3672861639b251960b4bd8807"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): rust/arm/vector.rs:611-628 | rust/arm/vector.rs:632-647 | rust/arm/vector.rs:651-668 | rust/arm/vector.rs:672-687 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aec8265205997be9bc41791c807787ee3d2517776db76a6c559ea53799c4061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust/arm/complex.rs:880-900 | rust/arm/scalar.rs:595-615 | rust/arm/vector.rs:909-930 \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":"rust/arm/complex.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c6b8a690f0e0edf2301beecf49ddc7a37a2a6fc371274b4fae19f90d4e011f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): rust/applet.rs:167-218 | rust/applet.rs:281-328 \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":"rust/applet.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d44e65fca9f472ebc6d2b31a5642dd46bd9938f9d1d218974614bb7ebf7b402"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/arm/complex.rs:739-752 | rust/arm/complex.rs:756-771 \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":"rust/arm/complex.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"172d00f765dd90d969a33c302d24e68682510dc7580b0fa9e3a845ad720ff2cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust/arm/complex.rs:153-166 | rust/arm/complex.rs:482-494 \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":"rust/arm/complex.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"27888be1c30ad8e35767978a282b00997e7fd7a7304dfc31112a51d16df9c957"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust/builder.rs:531-564 | rust/model.rs:141-177 \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":"rust/builder.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"066a743ba3d5250d2a902015dfcc09ee98b56a05023fb3a691f13e6a2835c9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): rust/arm/mod.rs:126-137 | rust/arm/mod.rs:139-150 | rust/arm/mod.rs:216-227 | rust/arm/mod.rs:229-240 | rust/arm/mod.rs:406-419 \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":"rust/arm/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"087977eeabc752b063a3163d620e60211c608418f30de657eeccb31a76926941"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/complexify.rs:490-505 | rust/complexify.rs:609-624 \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":"rust/complexify.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61fa1dd99512c1c904e37a6bd69f8bcf89749c9a0474f53d0dd394a44a747f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust/riscv64/mod.rs:282-292 | rust/riscv64/mod.rs:294-304 \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":"rust/riscv64/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b5b18b99d43e2b2e99164dea3089e6fd9fbb6bc357cb9500bc559f3ae36004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/riscv64/mod.rs:1072-1081 | rust/riscv64/mod.rs:1083-1092 \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":"rust/riscv64/mod.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff46acf8db1cf27ea77d2b5e490e557a133bab01bce618b88de1509a9d37d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): rust/amd/complex.rs:961-980 | rust/amd/scalar.rs:744-763 | rust/amd/sse.rs:705-724 | rust/amd/vector.rs:862-884 | rust/amd/vector_f64x8.rs:873-896 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 20 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":"rust/amd/complex.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b963e78bcf0767a280a37b92b552d3c3187ea3b60df1a39af6d7d9ed73ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rust/complexify.rs:681-702 | rust/complexify.rs:704-725 | rust/complexify.rs:727-756 \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":"rust/complexify.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b95ecb4b3f36d519f9e3791f8346e13a119a9b04b6016465e04bb3000ddb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): python/symjit/__init__.py:205-292 | python/symjit/__init__.py:319-387 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/__init__.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b083f26cc6d51546cb3d7cf8049a72c108d8032cdf15af75e629a38d83a8a747"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust/arm/complex.rs:908-923 | rust/arm/scalar.rs:623-639 | rust/arm/vector.rs:932-950 \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":"rust/arm/complex.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9da42322f1129f1b306a9e0ace200b0c2a23855270f7c8b071292d5394e4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust/arm/vector.rs:372-394 | rust/arm/vector.rs:416-436 | rust/arm/vector.rs:438-458 \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":"rust/arm/vector.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ace248ed94309c055e66cd82ccaf2e3801e70e0ab87cd9a41b3e041429f96c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust/amd/complex.rs:982-998 | rust/amd/scalar.rs:765-781 \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":"rust/amd/complex.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040d60050a6e61a893f7d9d4ec65b2e83eb618cfdd51da3fe8ac2d0c0f36170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust/defuns.rs:59-79 | rust/defuns.rs:132-153 \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":"rust/defuns.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5977c6c8346d5bfdf5b020560a751cc658d4de96ec387f1a140f2c5108eb1b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/applet.rs:427-445 | rust/runnable.rs:632-650 \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":"rust/applet.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad621eedca6518ae6d804706181979e459a25306d077f6a2a4bd65fd824b7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): rust/complexify.rs:915-925 | rust/complexify.rs:927-937 | rust/complexify.rs:939-949 | rust/complexify.rs:951-961 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/complexify.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a45b58eeba97a6606bdc895d82bb517e190dfc4453f49247773dbf99c1e7f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/block.rs:293-307 | rust/block.rs:337-354 \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":"rust/block.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ea95f667edd7dd2510385a48babc19487b6adc5732d97db69465a938c171f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust/composer.rs:369-381 | rust/composer.rs:383-406 \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":"rust/composer.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6134884dcb8cad96dfdc31e46c92ad1e6eb3c8a5ddeb329858ac8d05b15ddde1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): rust/riscv64/mod.rs:763-768 | rust/riscv64/mod.rs:770-776 | rust/riscv64/mod.rs:778-783 | rust/riscv64/mod.rs:785-795 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 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":"rust/riscv64/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6156ea791b14bb0b128ccfeddf3986692d7875a03d1f414b98ce157e166f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust/amd/asm.rs:70-97 | rust/amd/asm.rs:140-166 \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":"rust/amd/asm.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934ab86c494ddce6fde023a995cdd183bd614c06bff019b546fa34fc9b14bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust/amd/vector.rs:461-478 | rust/amd/vector_f64x8.rs:469-486 \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":"rust/amd/vector.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cac77039b00496915894c344b91eca913fae34a94b891965385080eeac5338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): rust/amd/sse.rs:726-742 | rust/amd/vector.rs:886-902 | rust/amd/vector_f64x8.rs:898-914 \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":"rust/amd/sse.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b739e0c3b2b3e943cb885af9cd48a64318a08f79fa57d82c30d4f2796ca398c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/amd/vector.rs:441-459 | rust/amd/vector_f64x8.rs:449-467 \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":"rust/amd/vector.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a79422b5eaa7ebf52cc26f38ffd0812811385c7573e4fca9f92de4c57455af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust/amd/mod.rs:491-513 | rust/arm/mod.rs:517-537 \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":"rust/amd/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73ee285a30183c9e6ace83cd4d242a8c0e39d532e8e1f9787bff1353aeb2c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust/amd/mod.rs:168-189 | rust/amd/mod.rs:197-222 \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":"rust/amd/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cadc049ff635697aa119416be237912ff5c17b877cc9745bc5fe6a748a5311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/complexify.rs:520-531 | rust/complexify.rs:533-544 \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":"rust/complexify.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6fa37b698ddb1bfaa5ab59a72ca3bc603f09fe461e6db0b28106dadd777b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust/amd/complex.rs:806-829 | rust/amd/scalar.rs:593-615 | rust/amd/sse.rs:557-577 \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":"rust/amd/complex.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6184a27ab38ed3b7b37919edad30305a3d563aaf1f0f97b227652406173cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): rust/arm/complex.rs:293-297 | rust/arm/complex.rs:663-668 | rust/arm/scalar.rs:151-155 | rust/arm/vector.rs:221-225 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93e919aa0074ec114cc3f7ef1a6b7c90a749657e59e44839d0d774371a7b708"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust/amd/scalar.rs:363-383 | rust/amd/vector.rs:508-528 | rust/amd/vector_f64x8.rs:516-536 \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":"rust/amd/scalar.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7655eb7a3ead825773719ebe25a30010f15fa39cded809c701301dac3ad5d4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust/compiler.rs:180-199 | rust/compiler.rs:208-227 \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":"rust/compiler.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"357ff74d676e45a8cadbfc1a767ae4121d5b9e54d6286a13febc3739dafda347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/amd/vector.rs:303-317 | rust/amd/vector_f64x8.rs:310-325 \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":"rust/amd/vector.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"31152fff1658ceb0fe7e6609974a9b16215e120d9e1ecb8c324cf5b8f96fc490"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): rust/amd/complex.rs:562-569 | rust/amd/complex.rs:744-751 | rust/amd/complex.rs:753-760 | rust/amd/complex.rs:762-770 | rust/amd/complex.rs:772-780 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52acbbdf3ca0cf9ffd61e7678c3684452b29e8f01cd1ae40422ecb618f71115"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust/runnable.rs:293-313 | rust/runnable.rs:356-376 \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":"rust/runnable.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb647dcb11ba09e4240a17656fc3a3036b6a1a9ef40a745183aaeda3728e466"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust/arm/complex.rs:299-311 | rust/arm/scalar.rs:157-168 | rust/arm/vector.rs:227-240 \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":"rust/arm/complex.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c489eee8b631e03b8abfa2f264ecf80b105f5dfde0f10d24f8bee5e3d1182f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/builder.rs:440-455 | rust/builder.rs:464-480 \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":"rust/builder.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e699e031941b29ea416918cb6931213c73e9fd0c1df95187355c49583c573078"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/arm/scalar.rs:515-528 | rust/riscv64/mod.rs:868-881 \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":"rust/arm/scalar.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a484a92aa3abbcd12d146c9eb8c1b485964ed040be6c53f57845c60a7c0712f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/sympy.rs:512-523 | rust/sympy.rs:538-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":"rust/sympy.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8fa12a5d9432069707ecdb53b22ae81076e20ec766b8bce9bf453d1258c5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): rust/amd/vector.rs:86-103 | rust/amd/vector.rs:105-125 | rust/amd/vector_f64x8.rs:93-110 | rust/amd/vector_f64x8.rs:112-132 \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":"rust/amd/vector.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e2cadff719e4b866fb54cd33678b7836cfc14bd69c03738d8ccb7e99c11e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/complexify.rs:897-904 | rust/complexify.rs:906-913 \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":"rust/complexify.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdd794c605e8e334c9417505fefe82331ba158cb6113fa7f8364414d1c0b9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/riscv64/mod.rs:556-565 | rust/riscv64/mod.rs:573-582 \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":"rust/riscv64/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"471670f9083fef37916b01af77f8f4ebee14f6673fb1f178a8c8c4604f0e1ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust/riscv64/mod.rs:619-623 | rust/riscv64/mod.rs:625-629 \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":"rust/riscv64/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"578dc926cc6e7fd235b5f9c2c4db08777d3d250950ad50cb22b87f7089167a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/sympy.rs:606-617 | rust/sympy.rs:631-642 \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":"rust/sympy.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"1643c56af718e78e538e0dd26105951a0f3dde5e5416b16e5aadb6d7306b4108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/applet.rs:379-394 | rust/runnable.rs:536-563 \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":"rust/applet.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"377de698e1ea2eec25d9107266d0fa3c2d9084609fce2f025bee96008cfe3736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/arm/scalar.rs:650-661 | rust/arm/vector.rs:894-905 \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":"rust/arm/scalar.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e88297b895b384b02ef5adae82cd81e95c15b4d9c499259814d4866d55c8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 5\u002B corresponding lines): rust/riscv64/mod.rs:726-730 | rust/riscv64/mod.rs:732-736 | rust/riscv64/mod.rs:738-742 | rust/riscv64/mod.rs:744-748 | rust/riscv64/mod.rs:750-754 | rust/riscv64/mod.rs:756-761 | rust/riscv64/mod.rs:797-801 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/riscv64/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a345f7943d4c2258299f71f8064bf2b9b7a44bc62825bec03a6b4027e3a3d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/arm/scalar.rs:235-249 | rust/arm/vector.rs:317-331 \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":"rust/arm/scalar.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafbd7a60421ead629ff623075d7822ac5b56682715fac63db984c9a59ae5666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust/riscv64/mod.rs:399-411 | rust/riscv64/mod.rs:414-426 | rust/riscv64/mod.rs:492-506 \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":"rust/riscv64/mod.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"985c55fac6c7d1c7ebdf51250c90a8d047f890fb94287b8f1e0740c279a8d8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): rust/parser.rs:223-238 | rust/parser.rs:281-297 | rust/parser.rs:299-320 | rust/parser.rs:472-490 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/parser.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"83684e73795e8b2505dafec469443d29baf2fcd6cad5c8b074c75a5684346bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): rust/amd/mod.rs:392-398 | rust/amd/mod.rs:400-406 | rust/amd/mod.rs:408-414 | rust/amd/mod.rs:416-422 \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":"rust/amd/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19a5b59e355075d2a28f7ecf101c3a93dd067a12b819d25d46f2c6530cb08f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): rust/amd/mod.rs:424-430 | rust/amd/mod.rs:432-438 | rust/amd/mod.rs:440-446 | rust/amd/mod.rs:448-454 \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":"rust/amd/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf1b241564710d7e767706f8680367e49d73667aee6db2a87d780434a45f04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust/arm/complex.rs:397-401 | rust/arm/scalar.rs:289-293 \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":"rust/arm/complex.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d187d0da0c54ea789ad9dc1a4d30a80a76b2101cffc333251f12caaaf8706bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust/amd/sse.rs:233-242 | rust/amd/vector.rs:356-365 | rust/amd/vector_f64x8.rs:364-373 \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":"rust/amd/sse.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2627240eb5921ceb573c52969572b72fe19799f000e1ceb0a23026516271e236"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rust/amd/sse.rs:491-501 | rust/amd/sse.rs:503-513 | rust/amd/sse.rs:515-527 \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":"rust/amd/sse.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b767ac95b889c65596f3f6e1339c583942b6b1aa50192aa5fcf4258134e7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/complexify.rs:11-20 | rust/complexify.rs:22-31 \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":"rust/complexify.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8354b27c52871c5c6a2b18309994b99d4e9a863d255c7513ef0c6aaaffb518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): rust/parser.rs:322-330 | rust/parser.rs:332-340 | rust/parser.rs:362-372 | rust/parser.rs:374-384 | rust/parser.rs:416-425 | rust/parser.rs:459-470 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/parser.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"93538094254921e783c8b2f26b8f1281ef9a6a2bf243f8a38936ff7898ef69f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): python/symjit/pyengine/tree.py:388-406 | python/symjit/structure.py:106-124 \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":"python/symjit/pyengine/tree.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"38da70fb87787fc4c808154d38a012e452e92370ba6893e53471e5e2b70aa6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust/allocator.rs:48-60 | rust/mir.rs:343-356 \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":"rust/allocator.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0387aced978c696745bbaf265223de636273c33165f2fb998ebbd07b365b050"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust/amd/scalar.rs:269-284 | rust/amd/vector.rs:407-422 | rust/amd/vector_f64x8.rs:415-430 \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":"rust/amd/scalar.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec47a6b65280ae52ba1963728c702fa5303627eb8302095113cfb73b53b4c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust/applet.rs:536-541 | rust/applet.rs:546-551 \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":"rust/applet.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78ab4394828ebc6e46e38cbec2e676e38f71841644ca0e9cf04b75ecabbc266"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): rust/arm/complex.rs:682-688 | rust/arm/scalar.rs:451-457 | rust/arm/vector.rs:599-605 \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":"rust/arm/complex.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0d2c8149f268da2bead622004b005130af2c41e6e5339630ccf099119132bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust/arm/scalar.rs:218-233 | rust/arm/vector.rs:300-315 | rust/arm/vector.rs:333-348 \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":"rust/arm/scalar.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb669cdcf8413985d83842d8c2305ce042f8dfdea8a8b4c8054a9e3f2c1450e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): rust/riscv64/mod.rs:262-270 | rust/riscv64/mod.rs:272-280 | rust/riscv64/mod.rs:306-314 | rust/riscv64/mod.rs:334-341 \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":"rust/riscv64/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a556c4b2fece937650864e10254973b4d15e756ae8a7cc6aa3eace32c72f90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/applet.rs:508-515 | rust/applet.rs:523-530 \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":"rust/applet.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f76c9af8148117978aad583bbe0180dc47ea42e48d2b2230384fb3f01139f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/composer.rs:415-423 | rust/composer.rs:443-453 \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":"rust/composer.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d457291cdcf83cea2e2fc2d198c317d61e40a0d95f791703b3ca033433169ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): python/symjit/engine.py:546-552 | python/symjit/engine.py:555-561 \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":"python/symjit/engine.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a38b15b7ae9981d4e84fc4bf48a9bbb2a0b7ce6083b2a836ffca4da85f0653"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): python/symjit/pyengine/amd.py:462-472 | python/symjit/pyengine/amd.py:476-489 \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":"python/symjit/pyengine/amd.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a499719a1049eba8f7c2e93b76088c88ada28054649d7cbdc3658a765e5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust/amd/asm.rs:168-181 | rust/amd/asm.rs:183-196 | rust/amd/asm.rs:294-307 \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":"rust/amd/asm.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc1e1bd207b7b5bcc81404de7f3d58a723b535e0f088668f9cc0e1f8bf4ec94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/node.rs:169-183 | rust/node.rs:185-199 \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":"rust/node.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a8f04e1e7d0eabbe37addcc1a36acd2f4e5089bcf6570e2cde7fdce327a15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): rust/amd/complex.rs:318-322 | rust/amd/scalar.rs:193-197 | rust/amd/vector.rs:331-335 | rust/amd/vector_f64x8.rs:339-343 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc8ea97fd3da61b4c946066600a0bee9e49e924566c24530d6dd3665fcf94df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/amd/mod.rs:91-100 | rust/amd/mod.rs: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":"rust/amd/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"745e3345a711b1f3c7ffea0902900601cd5524fcff73a95b59db741406a8a52b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust/applet.rs:112-122 | rust/applet.rs:124-134 \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":"rust/applet.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"426b6a7cee7fe80c4ac83ac7989bb98f8aebbc54c09b66a024248a6e3ceb599c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/statement.rs:153-161 | rust/statement.rs:163-171 \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":"rust/statement.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369117da91d0bf89c857015b750ff32dae181767f232954b7ad2c0a65a380d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): rust/amd/scalar.rs:286-300 | rust/amd/vector.rs:424-439 | rust/amd/vector_f64x8.rs:432-447 \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":"rust/amd/scalar.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6561d4d694db542e2a229f624d388b258bed244e943fef958ade4cb50134c535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): rust/arm/complex.rs:476-480 | rust/arm/complex.rs:617-620 | rust/arm/complex.rs:622-625 \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":"rust/arm/complex.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac9128d211fa0c645c025cc3357ca6685e3fdb1ec4cf30e48266c0b9b0043c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/compiler.rs:756-769 | rust/composer.rs:550-569 \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":"rust/compiler.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aa13b670f6aba39d90f8788be72281c5a33faae5d713be39d35e31550195a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust/complexify.rs:383-393 | rust/complexify.rs:395-405 \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":"rust/complexify.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3471224d9724f26a435c6970ca1b5fa87f8e0d58cd045897e9d23139fd090736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): rust/riscv64/mod.rs:631-634 | rust/riscv64/mod.rs:636-639 | rust/riscv64/mod.rs:641-644 | rust/riscv64/mod.rs:646-649 \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":"rust/riscv64/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"00524262312ed74c3f114b83f33b2d1715ca4e9a87226dc2cb3134fa0b3b893a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/sympy.rs:740-749 | rust/sympy.rs:812-823 \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":"rust/sympy.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a0b682590a14d6816e9fc46d77ee6e0b168c6f6f55b2f9e1f58da06659199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/arm/mod.rs:314-320 | rust/arm/mod.rs:322-328 \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":"rust/arm/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9805ff0edbb784668b905b3220ccd219cdfb530cbd1f0de9c60d427081399a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/arm/mod.rs:338-344 | rust/arm/mod.rs:346-352 \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":"rust/arm/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d637c06b7f55d48b73406133aa05018d48a9b0691b81cf1889eff9a8330a898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): rust/arm/complex.rs:637-640 | rust/arm/complex.rs:642-645 | rust/arm/complex.rs:647-650 | rust/arm/complex.rs:652-655 | rust/arm/scalar.rs:434-437 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"829d758803c6f9d19124a59e510122048dcabe811fb00e38dd9344f6ece0e6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): rust/amd/asm.rs:469-479 | rust/amd/asm.rs:632-642 | rust/amd/asm.rs:842-852 | rust/amd/asm.rs:1157-1167 | rust/amd/f64x8.rs:321-331 \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":"rust/amd/asm.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bb2cd1e0f041b245b579e8669eacb1d0149c107379ef87fbb9442367c96833"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/arm/mod.rs:53-62 | rust/complexify.rs:33-42 \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":"rust/arm/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0689acb86cf075346067a87c641d2e012c034886ce79b568c4386b9c80b911ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): rust/compiler.rs:686-698 | rust/compiler.rs:700-708 | rust/compiler.rs:710-716 \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":"rust/compiler.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"68175c8d3ed381fa19467133d992a8b28226d874da10209c572b641c4e0d122d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): python/symjit/pyengine/tree.py:410-422 | python/symjit/structure.py:128-140 \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":"python/symjit/pyengine/tree.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"104ed7539b9e5f0d31c6ead0ef0196d06ef10583ffbe8dc92c0e450dba332ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): rust/amd/sse.rs:214-218 | rust/amd/vector.rs:337-341 | rust/amd/vector_f64x8.rs:345-349 \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":"rust/amd/sse.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80518c23b07effafc8a3c3d1d222c50762943c822ad4d2bb2edbfa8b6343432"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/amd/asm.rs:413-419 | rust/amd/f64x8.rs:228-235 \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":"rust/amd/asm.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4791a8926d92801af7b9fe1bab73a06ee8dca99ee8f8678bfd18c1198f1e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): rust/arm/complex.rs:670-672 | rust/arm/scalar.rs:439-441 | rust/arm/vector.rs:587-589 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"rust/arm/complex.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2a410204f8ad4bdab40ba116fb8fcd91fa6763b50c9e0526cda509b5566447"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): rust/arm/complex.rs:674-676 | rust/arm/scalar.rs:443-445 | rust/arm/vector.rs:591-593 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"rust/arm/complex.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc20988b3e1717cc979b4cc2b25bd73b001125858905d200643aba2bf3e5243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): rust/arm/complex.rs:678-680 | rust/arm/scalar.rs:447-449 | rust/arm/vector.rs:595-597 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"rust/arm/complex.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c804d4eed2672b27f73d8bc2054bfb44eb55e48288858e845b26112afa06288"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust/amd/complex.rs:910-917 | rust/amd/scalar.rs:695-700 \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":"rust/amd/complex.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"8860a245a06affe7091c86af041185ca385c5846e41938d0dea50ea3f6bad405"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): rust/arm/complex.rs:522-524 | rust/arm/vector.rs:481-483 \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":"rust/arm/complex.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455dc24bc3138174c642f1fffad28a43ad9f630757a366a60ea08f7db337006"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): rust/arm/complex.rs:526-528 | rust/arm/vector.rs:485-487 \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":"rust/arm/complex.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e364f6f42c06e3199cc79c58ad8a5125923e687a27f4b72a71b55473330f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rust/applet.rs:422-425 | rust/runnable.rs:609-612 \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":"rust/applet.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"282cdc29b8c89a59ab5ddb9cf5cd0618ee95b137157c263dff94702aff9c120e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): rust/arm/complex.rs:690-692 | rust/arm/scalar.rs:459-461 | rust/arm/vector.rs:607-609 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"rust/arm/complex.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac627e4347d30070a7a0a6303b45afe0dca5ac966bab9985300a8c939009082d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust/amd/asm.rs:1169-1174 | rust/amd/f64x8.rs:381-386 \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":"rust/amd/asm.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4845461f1685c738bf127f710fe0f42e4bf0faa5f38cb854bcc02364ecb966f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): rust/applet.rs:183-218 | rust/applet.rs:238-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/applet.rs:183\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":"rust/applet.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dcdeb07b08404344a07000c23217f74597b33139347a36aa2a353107779b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): rust/amd/vector.rs:905-938 | rust/amd/vector_f64x8.rs:917-950 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5f61ca6cc6f9b987df233c6669acf74571783d35f468d99eb31fe17a9a9931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): rust/amd/vector.rs:195-231 | rust/amd/vector_f64x8.rs:202-238 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:195\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1263e4f6a78fdb3bc1c7682626debe3acd762f15c708fe034fae1ffc709f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rust/sympy.rs:53-79 | rust/sympy.rs:151-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b9ce16feed62db9186f41c2bd424ee0fa04d575c0d66e88abb794ad9337232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): rust/applet.rs:397-419 | rust/runnable.rs:566-587 \u2014 before extracting anything, compare \u0060rust/applet.rs\u0060 and \u0060rust/runnable.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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 \u0060rust/runnable.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":"rust/applet.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac0b5077a84809133dea04329686d1b735a129b912f3c5900df99f94a1d463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201322 lines \u00D7 3): rust/amd/scalar.rs:427-448 | rust/amd/sse.rs:388-398 | rust/riscv64/mod.rs:673-683 \u2014 before extracting anything, compare \u0060rust/amd/scalar.rs\u0060 and \u0060rust/amd/sse.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/scalar.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9932b2744f75ade8228c8d4dc2421ccc383ff9beca16a8013b43df0e61413b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 3): rust/applet.rs:183-203 | rust/applet.rs:238-258 | rust/applet.rs:293-314 \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 \u0060rust/applet.rs:293\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/applet.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8624bfdc303127cf62a485456e1fad1e6aaa924d9bc3e4840cd613ee7a3ecf36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust/amd/vector.rs:573-594 | rust/amd/vector_f64x8.rs:581-602 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:573\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":"rust/amd/vector.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"277682df0537c2e314d54b19bb373ec9cae5422992239f21cb4e9812f515c988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): rust/amd/scalar.rs:366-383 | rust/amd/vector.rs:511-528 | rust/amd/vector_f64x8.rs:519-536 \u2014 before extracting anything, compare \u0060rust/amd/scalar.rs\u0060 and \u0060rust/amd/vector.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/scalar.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f1eb88bc27984c892289e791dc28c8488a4ac3f47d8e15123cf7388a4e5269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust/amd/vector.rs:941-957 | rust/amd/vector_f64x8.rs:953-969 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cd74f0494f0cc31956a093dd2fface15d08223234bbad75fe4655134da2ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rust/amd/vector.rs:863-877 | rust/amd/vector_f64x8.rs:874-889 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:863\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bea5a9f9c9944abbc29bb20051c0b56b07d67ec5fe1a81c0b022cdae0c75ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 6): rust/amd/scalar.rs:451-465 | rust/amd/sse.rs:401-415 | rust/amd/vector.rs:597-611 | rust/amd/vector_f64x8.rs:605-619 | rust/arm/scalar.rs:375-388 | rust/riscv64/mod.rs:686-700 \u2014 before extracting anything, compare \u0060rust/amd/scalar.rs\u0060 and \u0060rust/amd/sse.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/scalar.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"88040a83dcf3669ca223043631b660ad009793f19c4712f6464737933ef35fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): rust/amd/complex.rs:840-854 | rust/amd/scalar.rs:626-640 | rust/amd/sse.rs:588-602 | rust/amd/vector.rs:764-778 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e5a3e7d6365d5d3a77b287db1409f57b0ca3f7602868fdd8b598267bed6d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/amd/complex.rs:378-392 | rust/amd/scalar.rs:303-317 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65ee7068106f34644d261630415d1df6ba7896881d73a2ce5a25798260c2c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/amd/vector.rs:131-145 | rust/amd/vector_f64x8.rs:138-152 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.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":"rust/amd/vector.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33386ec6a034b49fc61f849cd42caf3e1bf177f32096e9454f255ce2d45fd20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/arm/complex.rs:352-366 | rust/arm/scalar.rs:252-266 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"da072932efed81742790bbfbfd156353f1b6c80ab47a5ac39d19e93b0e93cb8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): rust/serializer.rs:952-965 | rust/serializer.rs:970-983 | rust/serializer.rs:988-1001 | rust/serializer.rs:1006-1019 \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 \u0060rust/serializer.rs:952\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":"rust/serializer.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"6899639549a7a9f7cb6c77630677bd9c6705d08563cece8045e8ceabed8054a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/amd/complex.rs:395-408 | rust/amd/scalar.rs:320-333 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust/amd/complex.rs:410\u0060 calls \u0060load_args_complex\u0060, \u0060save_args_complex\u0060 and \u0060rust/amd/scalar.rs:335\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":"rust/amd/complex.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9106a2e127bb799193af28e0d8931244caa20759156bf1db7f665fea2098b214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust/amd/vector.rs:165-182 | rust/amd/vector_f64x8.rs:172-189 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4df543e7ebc55aba88439af3900d53a38d3a88435a8c5cc6606670144a299b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/amd/vector.rs:728-741 | rust/amd/vector_f64x8.rs:737-750 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d1ebab640acb9c52f229bb857293a42757942398f1c720baec05631d18cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): rust/amd/asm.rs:202-214 | rust/amd/asm.rs:222-234 | rust/amd/asm.rs:242-254 | rust/amd/asm.rs:262-274 | rust/amd/asm.rs:313-325 | rust/amd/asm.rs:333-345 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/asm.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b44b35dcdd35437a6e074e14fd6b7d6be603ec33bf6c600e34a0dc39ec4a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/amd/complex.rs:231-243 | rust/amd/complex.rs:491-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"03563dd6252fcbcf8692e0c6fe7bead9e0f6f62dfb6a8b8e1e3f4bf22faac7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/amd/vector.rs:305-317 | rust/amd/vector_f64x8.rs:313-325 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:305\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":"rust/amd/vector.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f123f3324f3ca87952e76dde60bc0ccba21c775ab7067931254b8bfcc97fac3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/amd/vector.rs:846-858 | rust/amd/vector_f64x8.rs:857-869 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e1a788a4f68c7f30dcbed85c1c6e84490dfbde07a7c2620831f51ccd232506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/arm/complex.rs:267-279 | rust/arm/scalar.rs:125-137 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e524edd9e72aa52a44ec881c4204b7e1ea12025954b7e219b5bafd6b04d6561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): rust/serializer.rs:807-818 | rust/serializer.rs:820-831 | rust/serializer.rs:833-844 | rust/serializer.rs:846-857 | rust/serializer.rs:858-868 \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 \u0060rust/serializer.rs:807\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust/serializer.rs:868\u0060 calls \u0060loc\u0060 and \u0060rust/serializer.rs:818\u0060 does not \u2014 after which the two agree again for 5 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":"rust/serializer.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8beb6d9581801fbd9e1501766798090a0192324826ed4f097a627a84959d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rust/amd/complex.rs:962-973 | rust/amd/scalar.rs:745-756 | rust/amd/sse.rs:706-717 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:962\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"700a49707caff2b425ddef339eb6210c538c9d3acc0b4e9760ea0a66dddd47c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/amd/asm.rs:83-94 | rust/amd/asm.rs:150-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/amd/asm.rs:83\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/asm.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a55e8938ce3318efa381ca59415afe5468cb4df8a977f83d69b7ac3eae2a0ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/amd/complex.rs:89-100 | rust/amd/scalar.rs:96-107 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust/amd/scalar.rs:108\u0060 calls \u0060is_complex\u0060, \u0060load_stack\u0060 and \u0060rust/amd/complex.rs:102\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":"rust/amd/complex.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb269c22dc79d114221b92dfe0b112e81e588bb77ba62a223005e5f9776ba2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/amd/scalar.rs:604-615 | rust/amd/sse.rs:566-577 \u2014 before extracting anything, compare \u0060rust/amd/scalar.rs\u0060 and \u0060rust/amd/sse.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 150 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 \u0060rust/amd/scalar.rs:604\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, \u0060rust/amd/scalar.rs:601\u0060 calls \u0060vzeroupper\u0060 and \u0060rust/amd/sse.rs:563\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":"rust/amd/scalar.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"47310b100ce81ff225c433e390818b6fad18869afded67ba475ff2e63c2b1ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust/arm/complex.rs:64-86 | rust/arm/scalar.rs:58-80 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:64\u0060 it does not close everything it opens, so those exact 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, \u0060rust/arm/scalar.rs:81\u0060 calls \u0060is_complex\u0060, \u0060load_stack\u0060 and \u0060rust/arm/complex.rs:88\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":"rust/arm/complex.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b96b66f462b55bf4f8a7ae4e41eccd768ee2bbe3d9eb879a387b245259c133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/sympy.rs:88-99 | rust/sympy.rs:177-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/sympy.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d127d4787c546754b889c69c7355b585abd70f7bf6c143db4de9c6a999ca6ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): rust/amd/vector.rs:139-151 | rust/amd/vector.rs:176-188 | rust/amd/vector_f64x8.rs:146-158 | rust/amd/vector_f64x8.rs:183-195 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:139\u0060 it begins part-way through the construct above it, so those exact 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, \u0060rust/amd/vector.rs:173\u0060 calls \u0060vmovsd_mem_xmm\u0060 and \u0060rust/amd/vector.rs:137\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":"rust/amd/vector.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b67b9fccdb990c8cf672d7800724a7405b26465c10c316de1385b5307373c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust/serializer.rs:904-914 | rust/serializer.rs:916-926 | rust/serializer.rs:928-938 | rust/serializer.rs:940-950 \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 \u0060rust/serializer.rs:904\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":"rust/serializer.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4d64d2ab27b78a651a1a60cb214042524c70811d41a10ad594290331e2e03b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/arm/scalar.rs:518-528 | rust/riscv64/mod.rs:871-881 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rust/arm/scalar.rs:518\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":"rust/arm/scalar.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc77e49e1a23477095b1a73eae65a914baa8493f5a62bf15fc2d1acc4c2f4c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/mir.rs:836-846 | rust/mir.rs:867-877 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/mir.rs:836\u0060 it does not close everything it opens, so those exact 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 \u0060power\u0060 to \u0060u32\u0060 in one and \u0060i32\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 after the matched lines, \u0060rust/mir.rs:878\u0060 calls \u0060fmod\u0060 and \u0060rust/mir.rs:847\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":"rust/mir.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"984df0debf7da4fbef03caa7335dbc65e2391b45b147d75ded2e16a3a3e7a31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/amd/asm.rs:187-196 | rust/amd/asm.rs:298-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/amd/asm.rs:187\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":"rust/amd/asm.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aab5fc0dca9a1b33dd759723fb85e9182e3ffab4aeb1c8ab122c37bf8b3d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/amd/complex.rs:986-998 | rust/amd/scalar.rs:769-781 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:986\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":"rust/amd/complex.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dda1665ad3248b2a4936bdebc760de766a5076258830cbf532970e4fe7e395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): rust/applet.rs:428-437 | rust/runnable.rs:633-640 \u2014 before extracting anything, compare \u0060rust/applet.rs\u0060 and \u0060rust/runnable.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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 \u0060rust/applet.rs:428\u0060 it does not close everything it opens, so those exact 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":"rust/applet.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"154c2f9ddb72f8abc32582119a4f352bfa84633e541b79efc1b160e173245640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/arm/complex.rs:302-311 | rust/arm/scalar.rs:159-168 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:302\u0060 it does not close everything it opens, so those exact 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, \u0060rust/arm/complex.rs:300\u0060 calls \u0060xor\u0060 and \u0060rust/arm/scalar.rs:157\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":"rust/arm/complex.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"231d587d294ce4fbe9b9db4e47f151a54b8f56f2790a25d8d92ca788bac39763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/arm/complex.rs:783-792 | rust/arm/scalar.rs:504-513 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94c1371441bc324851a84f094dc6e4c8941383421d90c380a9f6b3d3550919f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/arm/scalar.rs:652-661 | rust/arm/vector.rs:896-905 \u2014 before extracting anything, compare \u0060rust/arm/scalar.rs\u0060 and \u0060rust/arm/vector.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060rust/arm/scalar.rs:652\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":"rust/arm/scalar.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d8a4dbc9b4fc8711843d1dab6382ee7278b6adec703a448b197dc5b21ba5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust/amd/asm.rs:171-179 | rust/amd/asm.rs:186-194 | rust/amd/asm.rs:297-305 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/asm.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da93d0e8ad443635c1c0fcb3243d69afffe8914b8b29f6227c3eda8938e35de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust/amd/complex.rs:818-826 | rust/amd/scalar.rs:603-611 | rust/amd/sse.rs:565-573 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust/amd/scalar.rs:612\u0060 calls \u0060load_stack\u0060 and \u0060rust/amd/complex.rs:828\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":"rust/amd/complex.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab1fa3a93f308fc912ba9e512f8cfce0ec6e655fc9cc5263cc763fefdda7938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust/amd/vector.rs:572-580 | rust/amd/vector_f64x8.rs:580-588 | rust/arm/vector.rs:498-506 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4985a341306d3178fdd8a92ec2ae5550741e1ff0ca59b460103f47d7cb185eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/amd/asm.rs:634-642 | rust/amd/asm.rs:844-852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/amd/asm.rs:634\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":"rust/amd/asm.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c68b2f906c8b5cf9c345515223b903c910b31eefcabedc050391387636fd092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/amd/vector.rs:92-100 | rust/amd/vector_f64x8.rs:99-107 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c92209e8c22647c9a36a4dd013920dca261b5e191735c6fd37a6c2f45831ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/applet.rs:227-235 | rust/applet.rs:282-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/applet.rs:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/applet.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3312329133be37cca2cb4d747f84a823d470412f5bc578adb447ed8a442e9c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/arm/complex.rs:833-844 | rust/arm/scalar.rs:554-565 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.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":"rust/arm/complex.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b6d68ae8b7674c0c6f5bd5c739cf50e9d6ade78163caf61c07e2c69f0d609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust/arm/complex.rs:883-900 | rust/arm/scalar.rs:598-615 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:883\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3cc2c2fbd8acaa6de49a76230dcbe8f80224c781a1556696f043e3fb2e96b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/riscv64/mod.rs:360-368 | rust/riscv64/mod.rs:380-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/riscv64/mod.rs:360\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/riscv64/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"1591c76653f07d2c55ad05be90bc718eeafaeea422028ece51ac6b94e9a59a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/sympy.rs:122-130 | rust/sympy.rs:202-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 \u0060rust/sympy.rs:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59de27a0535d0173412fd49d5eaaf11383cb820a5e3c774e5e15e37f4115e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): rust/amd/complex.rs:860-867 | rust/amd/complex.rs:877-884 | rust/amd/scalar.rs:646-653 | rust/amd/scalar.rs:662-669 | rust/amd/sse.rs:608-615 | rust/amd/sse.rs:624-631 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"41211e9782c539a535df80ffb8cd6737ccb07d16919b8ea3a7786ebddcf2333e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/amd/vector.rs:128-135 | rust/amd/vector.rs:160-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/amd/vector.rs:128\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"91da20b9d2e10b60880cf1c18762eef4016eb64ddc3738230b51343d8a28a70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/amd/vector_f64x8.rs:135-142 | rust/amd/vector_f64x8.rs:167-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/amd/vector_f64x8.rs:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector_f64x8.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe419a9a925e645e85e5f6f8e29f92d91c07c0fc702fad3d916a30544ab68ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/arm/complex.rs:369-383 | rust/arm/scalar.rs:269-283 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:369\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd799be9692c5ff350c558c3508397c76da0160cde81e4eec70067d68b15108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rust/amd/complex.rs:79-95 | rust/amd/scalar.rs:86-102 | rust/amd/sse.rs:102-118 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:79\u0060 it does not close everything it opens, so those exact 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, \u0060rust/amd/complex.rs:96\u0060 calls \u0060vzeroupper\u0060 and \u0060rust/amd/sse.rs:119\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":"rust/amd/complex.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"efee62755018429f90eece7437ad2051e8602aa56d61ba47cac841707531ec14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust/amd/complex.rs:983-989 | rust/amd/scalar.rs:766-772 | rust/amd/sse.rs:727-733 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:983\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daa27fa054fc04cce47b67083afe60b21ecb182c8427a6776c707202adbb5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust/arm/complex.rs:67-80 | rust/arm/scalar.rs:61-74 | rust/arm/vector.rs:52-65 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee6d3d1133cb1f4a48254bc40cd24d323de32dd3a8cccbb6cffc1f696809ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust/arm/complex.rs:936-942 | rust/arm/scalar.rs:651-657 | rust/arm/vector.rs:895-901 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd360d26d68233c07484e874033a38677f0494e64d051b814439f96c89cb8162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust/parser.rs:343-349 | rust/parser.rs:375-381 | rust/parser.rs:460-466 \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":"rust/parser.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"136420e950dd9db2a44f6be4b8b7b5997ef5a6eef42baf748c744d0600f0dc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/amd/vector.rs:116-122 | rust/amd/vector_f64x8.rs:123-129 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868709b14dc1bd586296006b32139a97385ff81bffacde1c1c2a3b72c18f809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/amd/vector.rs:887-893 | rust/amd/vector_f64x8.rs:899-905 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.rs:887\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18a4912057d20b99c336de64aa86c45b1abb9fc892564f5acffcee852107aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/arm/complex.rs:909-921 | rust/arm/scalar.rs:624-636 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:909\u0060 it does not close everything it opens, so those exact 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, \u0060rust/arm/scalar.rs:637\u0060 calls \u0060emit\u0060, \u0060x\u0060 and \u0060rust/arm/complex.rs:922\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":"rust/arm/complex.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba7b624864ff18563c48ffb9aef1f66cafd1f39f4c10abd2ae204343b73526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/arm/vector.rs:633-639 | rust/arm/vector.rs:673-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/arm/vector.rs:633\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"de36d724b0b28bef5dc0b9617fb91f551c46f4ff0ecb7a386e3bd6f13fa0c52a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/arm/vector.rs:732-738 | rust/arm/vector.rs:808-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad6e5f2367aac2c5b9c852b1b9d9ba0969ec4de5a8af0a99bad356f29e03daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust/amd/vector.rs:131-136 | rust/amd/vector.rs:163-168 | rust/amd/vector_f64x8.rs:138-143 | rust/amd/vector_f64x8.rs:170-175 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 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 \u0060rust/amd/vector.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":"rust/amd/vector.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9603be40b3fd88e40e36fce11c3aff46b5ac85b23a9106f50cc9d35538355add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust/arm/complex.rs:302-307 | rust/arm/scalar.rs:159-164 | rust/arm/vector.rs:229-234 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:302\u0060 it does not close everything it opens, so those exact 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, \u0060rust/arm/complex.rs:300\u0060 calls \u0060xor\u0060 and \u0060rust/arm/scalar.rs:157\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":"rust/arm/complex.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"196109a28226375b71a9e7a46785549f0bcf6ec69c0435a8043e4faedce3df95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/applet.rs:454-459 | rust/runnable.rs:659-664 \u2014 before extracting anything, compare \u0060rust/applet.rs\u0060 and \u0060rust/runnable.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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 \u0060rust/applet.rs:454\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/applet.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a7f9f490ea57ec39c930784395bdc08c2bd3ab73de1c42b2ce6339f91d4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/applet.rs:510-515 | rust/applet.rs:525-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/applet.rs:510\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":"rust/applet.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1198be59d9d60954f02e7bc96573d4224fe9aa4ebe602d776be15b7e909b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/arm/vector.rs:614-620 | rust/arm/vector.rs:654-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/arm/vector.rs:614\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"908d298c8c04820330d381c0d3ec84bd2e8c9a4228f8cdd7bfd6884ecd39ee1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/mir.rs:1472-1479 | rust/mir.rs:1489-1496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/mir.rs:1472\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e439bf715c8b48d68ebb612c2df4416d126623c10719d91a809d79bab66df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/parser.rs:323-328 | rust/parser.rs:333-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/parser.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"42685da76d2b3779dfb734e8b670bb386eefbaf19c66ba862809241d36d781a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/amd/complex.rs:621-626 | rust/amd/complex.rs:628-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bb94d7dd54ac2bc09f1b592e7960f86a99acaf3d2cf9c852e8497acb5f172f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/complexify.rs:249-255 | rust/complexify.rs:277-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/complexify.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c827541c9c44e57123436250264774764ac848f6ce1e9c9ea56e7d86ae487aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/node.rs:457-463 | rust/node.rs:473-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/node.rs:457\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f825c3533250b04fd1e2a637b8cc24242dde49261458f9e57c6f685855aee61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/node.rs:510-516 | rust/node.rs:526-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/node.rs:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ba0b985f6bc23fc8e5877b411784efa34aa1ceb1075c54c7e1a203b2ac228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/arm/complex.rs:857-866 | rust/arm/scalar.rs:578-587 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:857\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"10550b0ad53b2b0b79e7e2d64b435bff224cdf519209a515ea940b9913be27e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/amd/complex.rs:33-42 | rust/amd/mod.rs:236-245 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd6f2c58fd8a798e26e2b924e73b735ff0db8330e97bb5fcbfbc0f9e5ea0c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): rust/amd/complex.rs:273-280 | rust/amd/scalar.rs:147-154 | rust/amd/sse.rs:162-169 | rust/amd/vector.rs:285-292 | rust/amd/vector_f64x8.rs:292-299 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2c1ee788758735c6abf2aae9e28217749f414d90e2771735851e51fbe0ea0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/amd/complex.rs:293-305 | rust/amd/scalar.rs:167-179 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f5bbdcebc23ca0348163af1d15780b41ce3d15f4671523c075d7d069c6ea1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/amd/complex.rs:324-329 | rust/amd/scalar.rs:199-203 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ecccd376019111ee929a96c5cc6724e57513483ac221c2295c9162a37728de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): rust/amd/complex.rs:782-788 | rust/amd/scalar.rs:569-575 | rust/amd/sse.rs:534-540 | rust/amd/vector.rs:715-721 | rust/amd/vector_f64x8.rs:724-730 | rust/riscv64/mod.rs:825-831 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdae5a96695e418f51ad2c1430bfccc4417415f037aaeca6cc8a9301baf059e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/amd/complex.rs:794-804 | rust/amd/scalar.rs:581-591 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698314cecba5917542cf6bafe16601fd42e0405c7c637540ebbd51c97077e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): rust/amd/complex.rs:925-933 | rust/amd/scalar.rs:708-716 | rust/amd/sse.rs:669-677 | rust/amd/vector.rs:808-816 | rust/amd/vector_f64x8.rs:819-827 | rust/arm/vector.rs:859-867 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:925\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"481bcc97d1ed45f65780f6418b2247ef27f880afe7c97dd75557998aee84969c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): rust/amd/complex.rs:941-949 | rust/amd/scalar.rs:724-732 | rust/amd/sse.rs:685-693 | rust/amd/vector.rs:824-832 | rust/amd/vector_f64x8.rs:835-843 | rust/arm/vector.rs:875-883 \u2014 before extracting anything, compare \u0060rust/amd/complex.rs\u0060 and \u0060rust/amd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 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 \u0060rust/amd/complex.rs:941\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/complex.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4428420460b50d1bf8685c3454460d988ce44edbb0d1dcf9f64ae5e0fbced131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/amd/vector.rs:743-753 | rust/amd/vector_f64x8.rs:752-762 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa7bd81af8ef3af728b0e819c18384e0edbf5a6e35582206dab33bfa9c9f888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/amd/vector.rs:834-843 | rust/amd/vector_f64x8.rs:845-854 \u2014 before extracting anything, compare \u0060rust/amd/vector.rs\u0060 and \u0060rust/amd/vector_f64x8.rs\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 337 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/vector.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c7e7e0a07891453a2dda76646241020f1cc14d7ce9a4a4e7b075e5190275f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/arm/complex.rs:285-291 | rust/arm/vector.rs:212-219 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/vector.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1796fb3d57a6703a7ceaf0f4fc1647376d1daab6003b024fabc88c521ae33067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/arm/scalar.rs:641-648 | rust/arm/vector.rs:885-892 \u2014 before extracting anything, compare \u0060rust/arm/scalar.rs\u0060 and \u0060rust/arm/vector.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/scalar.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53b87857b217614acca90d7fe8ac3a9f59fe48e567b00c465d8a77982fd453c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/lib.rs:89-97 | rust/utils.rs:65-73 \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":"rust/lib.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b8c47a80e6233046d50910072604162488843de33e24f8119829721a268205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust/config.rs:1214-1222 | rust/machine.rs:99-107 | rust/runnable.rs:810-818 | rust/serializer.rs:384-392 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/config.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"787aa61adaa8966ceb5e5e4d4da6123c532ff9ba95725bc8f58eb020a12621c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/composer.rs:160-166 | rust/composer.rs:168-174 \u2014 both copies are in the same file, so extract the block 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":"rust/composer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed631be1579793b7167f3f505d26db0b0f7a640c231b9897b340f8beaf3bc80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/arm/vector.rs:426-431 | rust/arm/vector.rs:448-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/arm/vector.rs:426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/vector.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"451033e4d9bb9200c46b9c609948868cdfbc63d77fa7a4d44d099b103f7e52c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/amd/complex.rs:766-770 | rust/amd/complex.rs:776-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/amd/complex.rs:766\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":"rust/amd/complex.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"31461eeb46a21c538f707f8e6d5611402febd280a6658e4693af543b0bf9a805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust/arm/complex.rs:818-824 | rust/arm/scalar.rs:539-545 | rust/arm/vector.rs:825-831 \u2014 before extracting anything, compare \u0060rust/arm/complex.rs\u0060 and \u0060rust/arm/scalar.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 173 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 \u0060rust/arm/complex.rs:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/complex.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4b51eec1595544999e1a3acfb9829f54740f27814e2ab4a3cb2ce949057b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/arm/vector.rs:709-714 | rust/arm/vector.rs:722-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/arm/vector.rs:709\u0060 it does not close everything it opens, so those exact 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, \u0060rust/arm/vector.rs:728\u0060 calls \u0060emit\u0060, \u0060d\u0060, \u0060x\u0060 and \u0060rust/arm/vector.rs:715\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":"rust/arm/vector.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218a1641765f548b618a6430a9caf31bb363ac182c80e73aeab2aee359e5375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): python/symjit/__init__.py:550-574 | python/symjit/__init__.py:577-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060python/symjit/__init__.py:550\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/__init__.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db7b664bb06e43d0a196bf60e83982ed63d6554f63f9d5f3edcdd7d386bbe22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 3): python/symjit/__init__.py:134-155 | python/symjit/__init__.py:263-283 | python/symjit/__init__.py:358-378 \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":"python/symjit/__init__.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc94b9654c901f0f49646b74291ca891553f186ae559505efdc05ad9405e608f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): python/symjit/ode.py:38-55 | python/symjit/ode.py:106-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/ode.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb002ab08f36ce1aea51a52939dce20ef97a6fe5399e979d6d695096204715b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): python/symjit/pyengine/tree.py:388-404 | python/symjit/structure.py:106-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"python/symjit/pyengine/tree.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98ae813a8362ec8b78841c33771180a5a395746f2b249f964002b4225610708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): python/symjit/pyengine/tree.py:455-461 | python/symjit/pyengine/tree.py:521-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060python/symjit/pyengine/tree.py:455\u0060 it begins part-way through the construct above it, so those exact 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":"python/symjit/pyengine/tree.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0337be96456d44c123bab33f588552307f2fbca0966d8c06178f6a5f3dee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): examples/claude/planets.py:67-108 | examples/claude/planets.py:112-147 \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":"examples/claude/planets.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d85e6415509964ef1005303f24e8f9f9862139396c4e71b58955b9538726a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): examples/symbolica/benchmarks.py:30-75 | examples/symbolica/benchmarks_real.py:30-74 \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":"examples/symbolica/benchmarks.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ce0dd2bb0b5cd27ce853cefe2cb9fe6a6f83929a4507908b95ca91d749cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): examples/claude/pyhpc/isoneutral.py:34-88 | examples/claude/pyhpc/tke.py:30-83 \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":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3a5e4023596b5ea91ac7e96cd83052e04c76be5c2a637600bea733465d2dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 77\u002B corresponding lines): examples/claude/domino/util.py:11-87 | examples/claude/util.py:11-87 | examples/util.py:11-94 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 77 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":"examples/claude/domino/util.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c6d2387675efbae03523ec19654e7ae22d300b2c221e14f70517b0d8149075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): examples/composer/large.py:109-138 | examples/composer/large_real.py:106-135 \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":"examples/composer/large.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7898db33a5ce9a98e2d5c742fd143ae24cf590f61dcf9ad1acc9392a58fc0e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): examples/claude/composer_numerics.py:66-84 | examples/claude/composer_numerics.py:168-187 \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":"examples/claude/composer_numerics.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"481372d0a59b1e5c2b714b09217754352bfb0eec95b797b1bb04d413586578f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): examples/stable_math.py:12-22 | examples/stable_math.py:26-35 \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":"examples/stable_math.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c852418999de1ebee162efc1d681b656370ca8f4012f643ddb9c83ca5df1d108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): examples/pendulum2.py:627-638 | examples/pendulum2.py:686-700 \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":"examples/pendulum2.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"150faeb13232beac1a62384ee2d28480ab089baad26d31e4f06128c41a8ff091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): examples/composer/simple.py:5-13 | examples/composer/simple.py:17-25 | examples/composer/simple.py:50-59 \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":"examples/composer/simple.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd49b11d8bf654619c38ec3f3cbc1a4cbec91871ddb22a9b15b26f7c479acef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): examples/lemniscate.py:17-25 | examples/viete.py:18-26 \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":"examples/lemniscate.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6ea8c0bbbccac2f86872a014e2b52acda150a4247d15776e396f0209723a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 3): examples/claude/domino/util.py:11-57 | examples/claude/util.py:11-57 | examples/util.py:11-57 \u2014 before extracting anything, compare \u0060examples/claude/domino/util.py\u0060 and \u0060examples/claude/util.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060examples/claude/domino/util.py:11\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/domino/util.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e163edf2d2cb6c19e7929559e58569fbb14584cfeca12b6d7b169708ca389994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201337 lines \u00D7 2): examples/composer/large.py:66-102 | examples/composer/large_real.py:66-99 \u2014 before extracting anything, compare \u0060examples/composer/large.py\u0060 and \u0060examples/composer/large_real.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/composer/large.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d99425e4dc8dfb58e396ca208e8c1c436d9b7787508ade24870cc68bcb98f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): examples/claude/domino/util.py:55-87 | examples/claude/util.py:55-87 | examples/util.py:62-94 \u2014 before extracting anything, compare \u0060examples/claude/domino/util.py\u0060 and \u0060examples/claude/util.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060examples/claude/domino/util.py:55\u0060 it begins part-way through the construct above it, so those exact 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":"examples/claude/domino/util.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1fc2992f7b03fad92ecd14cd93d521de6441503c21a4f686eff7b99ce7e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): examples/claude/integration/run.py:35-62 | examples/claude/run.py:35-62 \u2014 before extracting anything, compare \u0060examples/claude/integration/run.py\u0060 and \u0060examples/claude/run.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 107 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":"examples/claude/integration/run.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99fc7245912dc5768ddcc65619fae65f891d86041df4e186e1c07c0c4c5b28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): examples/claude/integration/run.py:107-155 | examples/claude/run.py:107-155 \u2014 before extracting anything, compare \u0060examples/claude/integration/run.py\u0060 and \u0060examples/claude/run.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 107 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":"examples/claude/integration/run.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd958e715b82175feda21c2f259d704fd0ca62d7c0aa44db74c65b8c0aa4d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:446-466 | examples/claude/pyhpc/isoneutral.py:474-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/claude/pyhpc/isoneutral.py:446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6711138d0ca7ef54cb92b414856c1530bdadda5039a5d4041aec12e5d0574a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): examples/claude/integration/run.py:88-103 | examples/claude/run.py:88-103 \u2014 before extracting anything, compare \u0060examples/claude/integration/run.py\u0060 and \u0060examples/claude/run.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 107 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. 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":"examples/claude/integration/run.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3515d6b3f621200e181a60254e1ad8c2ee173ce772b7df30e12531882cd2d68d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): examples/composer/large.py:110-123 | examples/composer/large_real.py:106-120 \u2014 before extracting anything, compare \u0060examples/composer/large.py\u0060 and \u0060examples/composer/large_real.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/composer/large.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ec56bf2a0dac58cead4626985a46a1409c85235536660e8566fc53f15ce61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/symbolica/benchmarks.py:61-75 | examples/symbolica/benchmarks_real.py:60-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/symbolica/benchmarks.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"72301aadd5898fcafa000358aa6c355f3728077a813b0509d85132153eb5ff2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/claude/integration/run.py:71-84 | examples/claude/run.py:71-84 \u2014 before extracting anything, compare \u0060examples/claude/integration/run.py\u0060 and \u0060examples/claude/run.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 107 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. 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":"examples/claude/integration/run.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbc5e03ceff988d4a158269d5a09b345261b3e67f20b4f0d71c2b4a8713fa60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/composer/large.py:125-138 | examples/composer/large_real.py:122-135 \u2014 before extracting anything, compare \u0060examples/composer/large.py\u0060 and \u0060examples/composer/large_real.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/composer/large.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48a6cc58971d001f1ef5862dde5a8f4e9b3da7f656bcfb221a16ceddd79e335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/composer/large.py:29-40 | examples/composer/large_real.py:29-40 \u2014 before extracting anything, compare \u0060examples/composer/large.py\u0060 and \u0060examples/composer/large_real.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/composer/large.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3737b681668627ac0a5d42b738052360d53c023a983d633acb8929ff8dd1e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): examples/symbolica/benchmarks.py:17-26 | examples/symbolica/benchmarks_real.py:17-26 | examples/symbolica/generate_benchmarks.py:13-22 \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 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/symbolica/benchmarks_real.py:13\u0060 calls \u0060join\u0060, \u0060dirname\u0060 and \u0060examples/symbolica/generate_benchmarks.py:10\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":"examples/symbolica/benchmarks.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d43d6e0a95c6f56cbaefafb0f450bec75f9d87dba4b4dc092917fcfd1d1584c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/pendulum2.py:627-636 | examples/pendulum2.py:686-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pendulum2.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d31b0fe636b8f0fc6d12315eba2e8dc0c3362054c49e25505d4238f025ac7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:34-42 | examples/claude/pyhpc/tke.py:30-38 \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":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e40ae00b40810a79fc459f6deda93f8e215c2db3d0d78116c5b1462178d7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:46-51 | examples/claude/pyhpc/tke.py:41-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/claude/pyhpc/isoneutral.py:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"737a04b542d15d7da362ac530ebf6c00d9bd0856bc3f5138a7d9cf6dd6e58379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/claude/composer_numerics.py:136-141 | examples/claude/composer_numerics.py:212-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":"examples/claude/composer_numerics.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"07342d66c3a853ff59e175f4da5f3841cbc59f43b1443fb205cdfed310886c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:375-381 | examples/claude/pyhpc/isoneutral.py:387-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/claude/pyhpc/isoneutral.py:375\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29fbaee0c5c8f42c0e245d624d09d114713670f9b71ac053f664f6aea8ff369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/claude/nbody.py:207-211 | examples/claude/pde.py:268-272 \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":"examples/claude/nbody.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737e1d02cf1fe6c32176403650c527ecd12ae1b984c5a59663fc7edd01d2363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:215-227 | examples/claude/pyhpc/isoneutral.py:251-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/claude/pyhpc/isoneutral.py:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dc2854603b2530b0666b634657372af9889bd9465b74243654a2e17a660a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:236-249 | examples/claude/pyhpc/isoneutral.py:272-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/claude/pyhpc/isoneutral.py:236\u0060 it begins part-way through the construct above it, so those exact 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":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"467c1b016bdcd7c72e09824b050b8be46f4413031c8e88d54dea34892a62b818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:307-312 | examples/claude/pyhpc/isoneutral.py:327-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/claude/pyhpc/isoneutral.py:307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69a2574dd19dfded0e841115da51e9f8bee37b178ff6bc398063b72db9fc42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/pi2.py:18-38 | examples/pi_save.py:18-38 \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 after the matched lines, \u0060examples/pi_save.py:42\u0060 calls \u0060save\u0060 and \u0060examples/pi2.py:46\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":"examples/pi2.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e30d12b892b272f68747eca388e9d16e71d0af28208d7ab08ed3dca65d5d184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): examples/symbolica/generate_pi_newton.py:13-28 | examples/symbolica/pi_newton.py:13-28 \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 \u0060examples/symbolica/generate_pi_newton.py:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/symbolica/generate_pi_newton.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f66f5df987d9e7a271a977643f2de8a7e5efb74244ba7372e6ae8c7d04d878b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/composer/large.py:10-17 | examples/composer/large_real.py:10-17 \u2014 before extracting anything, compare \u0060examples/composer/large.py\u0060 and \u0060examples/composer/large_real.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/composer/large.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ee8a69645a2ead7bb5ee798ea4cd2b1b702b99f199cea4a7b0750b6619f2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:166-170 | examples/claude/pyhpc/isoneutral.py:171-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b25055c662c08ac092414a81381a436458c1212915fa1f6efa3fd8e40d13e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:180-184 | examples/claude/pyhpc/isoneutral.py:185-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"38726456c5f32425ae0ac6eb7cc2e0cf3c486fc0301558f17ab0928a9ac7ae07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/claude/pyhpc/isoneutral.py:194-198 | examples/claude/pyhpc/isoneutral.py:199-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/pyhpc/isoneutral.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd54c3cb2b8133143a2fda180b7993c139603e542ebc2d5fbc6c0eb7532d5d8d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AmdComplexGenerator (LCOM4 7): AmdComplexGenerator\u0027s methods fall into 7 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 7 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":"rust/amd/complex.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba4cdee85fa7d132923f1f1a72acbef202cf4a062245c4316d44ae456463a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/mir.rs: rust/mir.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Mir::rerun at line 1312. 9 of those changes were fix/bug commits, and the other 18 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/mir.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":"rust/mir.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e268730bbaf1924559e04c717cbefd985a5797c447dc5eca86f1d0098be66e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/config.rs: rust/config.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Config::fmt at line 127. 3 of those changes were fix/bug commits, and the other 37 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/config.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"388bea0130c62302b4356486f7766bfb1455474188a7d9ac167580aab8e60897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/builder.rs: rust/builder.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Builder::create_binary at line 275. 4 of those changes were fix/bug commits, and the other 19 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c79c9607f7b97bb62b521e4bfe29f8b18d61a50b8da2a9b271c48f8255c7584"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/serializer.rs: rust/serializer.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in MirWriter::push at line 129. 1 of those changes was a fix/bug commit, and the other 13 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/serializer.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":"rust/serializer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b809067a5a6fe40cc3683e012bce4e3857f93acee60514325ba78674ab90b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/compiler.rs: rust/compiler.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in IndirectTranslator::translate at line 917. 4 of those changes were fix/bug commits, and the other 15 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/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":"rust/compiler.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"d686c489a1769669f6042befcc1f692fd8b3032d58afd9d07d2f7188c4b7573e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: python/symjit/engine.py: python/symjit/engine.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in RustyCompiler.__init__ at line 344. 2 of those changes were fix/bug commits, and the other 8 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- python/symjit/engine.py\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":"python/symjit/engine.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4400d15eecc9a2bbc3eca1ff496e739689821fb95c4eddaf7343fcd8d193e96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/allocator.rs: rust/allocator.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in GreedyAllocator::color at line 391. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/allocator.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":"rust/allocator.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64499eab230a054d3c9e5ee17a27ccb5a86ea803e53ff0ad4fd02a7c939c0af"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/amd/f64x8.rs: rust/amd/f64x8.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Prefix::evex at line 136), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cadditional bug fixes, especially Reg::Temp use in terminal codegen\u201D; \u201Cfixed vmovqd_zmm_indexed_mem\u201D; \u201Cvarious bug fixes found by Claude and adding asm tests\u201D; \u201Cfixing the root bug\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 16:53:17 -05:00\u0027 --until=\u00272026-11-09 16:53:17 -05:00\u0027 --full-history --no-merges -- rust/amd/f64x8.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":"rust/amd/f64x8.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d1c7cc7013cf861652816aa6d24b40abba9f9a4ee7de45fe53f21639233ef7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // except for powi_mod which needs to be modified (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":"rust/complexify.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"29477436250bb6d842f95149ce9bc1f45b4c10e80c661bd9a207286d7529a7c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a \u0060Drop\u0060 impl for \u0060cfg(target_os = \u0022windows\u0022)\u0060 \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":"rust/memory.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"23803311b7dfb8941a9497c241195f9052f681836cd9c33d49753c96f1ba4723"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ensure overflow is not possible. \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":"rust/memory.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b11f67b32927d408f0d8877a572ebcb927f8d7f5da1a71a977541da5b5cbe20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allocate more at a time. \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":"rust/memory.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd99f4dee4b41aeffc0f189c829ccfccedb3eb5db11d023b322a0ecb2bd501"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: may save idx (RDX) as double in RBP \u002B 8/32 * count_states \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":"rust/riscv64/mod.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35534c05622cf04a2c7b4fe0dd2cab991b2dcaaeb50b5e01d3b253a6d7a047d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix the FMA bug for complex noted on \u0060runtests complex\u0060 \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":"rust/mir/peephole.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa8f00e3f44ff25f94f681a75692298f7b81786a70e5dbc4ae1df7c746c0cd9"}},{"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 \u0060Cargo.toml\u0060 makes this repository a deployable product (line 56)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"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":"46ffca01863ede305a5a69284ebab646309c4e95b138fe414db3bc4445bdd88a"},"taxa":[{"id":"CWE-95","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":"e113cf14d298e54ea6a2ce487f68c838a750d1020e019d6de3a0d90420628825"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: structure.py \u2194 builder.rs: \u0060python/symjit/structure.py\u0060 (context python) and \u0060rust/builder.rs\u0060 (context rust) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060b0d86d96\u0060 Support \u0060sign\u0060, n-ary And/Or/Xor, and Piecewise without a final True; \u00607ef24391\u0060 Symbolica coverage added to Sympy; \u006064590838\u0060 Sum/Product working! \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/symjit/structure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"666dafe37e02891d999db7f343f275596f31c4c6ea09234c268c99ce0b45c2b6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 generator.rs: \u0060rust/amd/mod.rs\u0060 and \u0060rust/generator.rs\u0060 change together 95% of the time (21 of the 22 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 21 shared commits counted here, the most recent 3 are \u006098064aed\u0060 complex sqrt; \u00600d4b0b29\u0060 fma complex div; \u0060b3c7c9f2\u0060 simd load/save \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95a566440d0969753a5d11d14ae69fbb771d2343f23d1be3b752a37224986bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 generator.rs: \u0060rust/arm/mod.rs\u0060 and \u0060rust/generator.rs\u0060 change together 82% of the time (18 of the 22 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 18 shared commits counted here, the most recent 3 are \u006098064aed\u0060 complex sqrt; \u00600d4b0b29\u0060 fma complex div; \u0060b3c7c9f2\u0060 simd load/save \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/arm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb634e510bff4fdd6d4a1a071064fc2bb972aacdbf37a73d3b6c66b97858c4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: scalar.rs \u2194 sse.rs: \u0060rust/amd/scalar.rs\u0060 and \u0060rust/amd/sse.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060cf1d86cc\u0060 adding phi to save/load voltatile; \u00607762fc23\u0060 save/load_user_registers moved to mod; fast fixed; \u0060b9724175\u0060 adding volatile_area_size \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a765f0099c0b46ab0635a1da3d0957a2283568b894fb17901062bfb35cbaa280"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060load_args\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ba90a20837fe7e12be4cfa15878904086ac83922cc0d06281297d062e3e799"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060save_args\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e336d018df1398904b27fc1bc64838dfa2af4bc6ab21b5154ebc997e16bf5cd"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060load_args_complex\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e124784422b437e1546b985093c70d3f6efe448645dba56bbbe7f0ed8def8242"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060save_args_complex\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffea2b0b0273688fea148ad7ea053201347cae96e1d417d7f269920c87e0ac02"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060fxchg\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/riscv64/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd961d85966a764c6a822fcdf1b07bfa42a08c0905eaf0c017f54106114f429f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060load_args\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ff41bed787ef85d0a8ac1ba3e1d2b9676e173ae7fbdee1e1cedfb064a69b33"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060save_args\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52c9ee2ac57c74f902d2c029f2c545983135815d40351a7a3f6206edac71509"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060load_args_complex\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aadd1bb366d872293d06084343cd683b3b9df78f0dea14ae8599003f3b3de30"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060save_args_complex\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/sse.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7c0ee0aea56a74ee9f2e2a8d22d4512b6758d987375bd4f05aab24441a2ac3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060arg\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":"rust/code.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8203ebc962cdcca7aff20c905e5fbfbbe868315213f8412e27872e278d618958"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060get\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":"rust/mir/interpreter.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"77edb4df8fcb2e5c27dfbcb64b9f6b9985783df948188523897794837c6130d3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060set\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":"rust/mir/interpreter.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb713b6ec7e4b75815fde6bcc8ba8f1da3f2e2f656a7cdbb5f911e6c443c8ad7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060exec_instruction\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":"rust/mir/interpreter.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe1011cb560fadd543c1d7e42c77907b803bb25864679cb8e771c071aa58fd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060exec_instruction\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":"rust/mir/interpreter.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4c22e34753c4ddcd67764b9080760676ba0eead999462879eca6e132801b71"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060exec_instruction\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":"rust/mir/interpreter.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0d94ba7f5cc0c2a6974a900dd1c0e68638b1dd3d4b41696a8bafda9092feb8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060fxchg\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/riscv64/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b74175280511af37d2787d54aafa57833ec0ae3fc66f5548a42c369172c799c"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"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 SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Cargo.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":"Cargo.toml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f1258ac0739cd1e0a2e83a9aae67bcefcf633d7f90f15ee6eb51c19cdb530"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u03D5($dst) == \u03D5($a) || (\u03D5($dst) != \u03D5($b) \u0026\u0026 \u03D5($dst) != \u03D5($c))\u0060 appears character-identically in 3 files \u2014 rust/amd/scalar.rs, rust/amd/vector.rs, rust/amd/vector_f64x8.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":"rust/amd/scalar.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5fd18e1d218876ef05516fc2cf36743dcf227ae15da27754878bde44b9b208"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060mem_size\u0060 is read from the bytes being parsed at line 120 (\u0060usize::from_le_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 121 \u2014 and nowhere in its scope is \u0060mem_size\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060mem_size\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/machine.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"17765b05f0acc9a16252d69749b5a92786cc379967e81fed22f17af31e0c1d02"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060size\u0060 is read from the bytes being parsed at line 124 (\u0060usize::from_le_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 125 \u2014 and nowhere in its scope is \u0060size\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060size\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/machine.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"688674c26af67b687102db1a43d8d72ade46d2e84a17d1c05e8d7ec204508736"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060num_bytes\u0060 is read from the bytes being parsed at line 393 (\u0060usize::from_le_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 395 \u2014 and nowhere in its scope is \u0060num_bytes\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060num_bytes\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/serializer.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"629caeffad3cb164db472c813da6043b86033c56db93ee28b180894ee553fb64"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060break_call_binary\u0060 is public and takes \u0060left: Node\u0060 from its caller, and it recurses at line 346 through \u0060trim_binary\u0060, \u0060trim_unary\u0060, \u0060trim\u0060, \u0060process\u0060 and back with a piece of the document (and at line 257, line 271, line 279, line 284, line 317, line 318, line 321, line 347) \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 \u0060break_call_binary\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/block.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"56802876bc7fe4f0565844a22f1352946ddd5d1404e2bde53233b7c245e71a47"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060create_binary\u0060 is public and takes \u0060left: Node\u0060 from its caller, and it calls itself at line 292 with a piece of the document (and at line 295, line 321, line 324, line 327, line 336, line 341, line 353, line 356) \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 \u0060create_binary\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e97e41d24afa29f96aeaf8369edb6678471e073850167d6dd308e803fbf663"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Defuns\u0060 as its receiver from its caller, and it calls itself at line 266 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 \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/defuns.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7a05998a0326702cb1052e619b63d4e78132db6a8f9994a086a8f49cc78af4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060transform\u0060 is public and takes a \u0060Expr\u0060 as its receiver from its caller, and it recurses at line 306 through \u0060transform_loop\u0060, \u0060transform_poly\u0060, \u0060transform_ternary\u0060, \u0060transform_binary\u0060, \u0060transform_unary\u0060 and back with a piece of the document (and at line 227, line 232, line 233, line 240, line 243, line 244, line 245, line 254, line 265, line 268, line 269, line 273, line 274, line 291, line 294, line 295, line 307, line 308, 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 \u0060transform\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/model.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fdb6e5d3358ecaaf250c826a034698e465ff0ebf974e6754dad4cafd11a175"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060topology\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 229 with a piece of the document (and at line 231, line 242, line 243) \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 \u0060topology\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"df48963e9d46fdbab3a122a2ed64a07dbecbebb48c2b3e97de7c027c56867706"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060locations\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 652 with a piece of the document (and at line 656, line 657) \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 \u0060locations\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c6ce7dae4db9fed84f79c0725b83291bf56bde526f991c123e0d5f95a68c2b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060subroutine\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 682 with a piece of the document (and at line 698, line 699) \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 \u0060subroutine\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5ac9d41b4641d92610dbee0fec7979dfcc74e8362afc57967b881d79345a71"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060caller\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 728 with a piece of the document (and at line 730, line 731) \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 \u0060caller\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1621e6f343cb2b3e1f27ed486e2386cfbd3f2bb2be0e42aaa5b48e615d14c9"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060msg.into_raw()\u0060 (line 711) gives up ownership in exchange for a raw handle \u2014 the value\u0027s \u0060Drop\u0060 will no longer run \u2014 and nothing in the crate\u0027s code ever reclaims a \u0060CString\u0060 from a raw pointer (\u0060CString::from_raw\u0060). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a \u0060free\u0060 function that rebuilds the owner with \u0060from_raw\u0060 and drops it), or keep the owning value."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"570772625f9b7e660c6bc6d2f92b8efb2407e5ff9ecd4135fc862fc0ec25e9e5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CellModel.iv\u0060 is offered as a configuration-file 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":"rust/model.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d8e5a56d5dcfc519a8681851d3b7bc9c32432fa1fe399765b292062051e0fd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CellModel.algs\u0060 is offered as a configuration-file 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":"rust/model.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c172d23d21d6de2316e6d904a2acc2619f8051339edbedad9a13dc2bf164233"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060q\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 \u0060allocate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/allocator.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c11b50052d9ac5c7d80be00f279b04f601cff3141fc95a29123d71b4015bf9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060q\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 \u0060allocate_loc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/allocator.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"146b1ba606d52888b82452897623eb9f4e0d7e339ecb56d78b1b6f984fb3e2b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sym_table.find_sym(\u0026name)\u0060 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":"rust/block.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb38c64799007d6e6cf9c31090c51420186f5ba207e179b1a17cd121942c80f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sym_table.find_sym(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 \u0060create_tmp_named\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/block.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff18be364483cf63b427442c493e985d32667556fb077940de9b8ce5688a92cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb427160a001bc8299883d6776a3264276eec96a96b55fb2dd4d7ba6cf72bb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a9ccafd5618efdadec25e2a09d50dd4e13cdb34bec1257009647c4ff467ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.hashof_arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e060f8288c7ace26c43e63d5a5cf9b0ff3c9ed9fb56950abc7600eca38504ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.hashof_arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d1af199aff2eb8b9873aaedb085637db8049d96cec851b7d6a7c6068cd64e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc89b70693eb12418f2bb470034476f23bd572f90123eb696fdd4754c2c1092"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbe12eb11d84b0dde91207f58d138d751ec0b7bb39c850f0c154472c4ca0db9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.arg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b9f83fc39bbb4a0c9e6f43268dcc57e66c110542f13df96f507c60b26accac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.arg_power()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bcbc548d524825f8b50639c79377d2dd51f9817b0322c8241182a5a778fd8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mir.find_op(op)\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 \u0060append_vt_section\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/builder.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0601172812944e0a45f6d268baeaf436c7831a34e0d53fff4fb2b21d61121e66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.live.get(\u0026loc)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compactor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dc45bb6321275812dfbc5239b0435364a0adc2ca2e4df2e60982fb20ea5f6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH)\u0060 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":"rust/compiler.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be080563f33df2e5ee5d9cce15238b4b1692c25ff9754cafdde64ebcf17f668"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::create(format!(\u0022instructions_{}.txt\u0022,self.salt))\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8ab33df76bc923d08af34bcb3f672871223107617490cbf40d9e5d8465ae81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.counts.get_mut(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 \u0060consume\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d4059ab02d498061bd5dde54ca091d8abdec6cbdedb1a14871e9cfd75a5da2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.create_const(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 \u0060const_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":"rust/compiler.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f324534728d7f3a6c60b43b038958277333c9b666f4e52c23f3733c7d4d838"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.create_var(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 \u0060var_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":"rust/compiler.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0777d3e211d12889feb4facac38209a59086105656a26ebf5ff4018d6364cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.add_assign(out,eq)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060translate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"021a565039e41b6f970a069ee00d9bc4f50c281bef4a4b14486394866e5c90a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.binary_node(\u0022complex\u0022,re,im)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"130706fab2cf50790d95e8cd231b61c6b9c872fd926ecfd5fe2b6ee08376e309"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::mem::take(\u0026mut self.cache[*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 \u0060expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b8e53c441b8e6373eab58d8b5fedce37e4aed9e9847171a295123500405f0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.binop(op,left,right)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060binary_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c88e035b1ac79b74637e4dadd5e06d39a7d5f4aa10b71505ec3ec898528142"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.create_ifelse(if_clause,f,t)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060translate_join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/compiler.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"727fc43f81f79a07e957a002bf406278efb32bbecafbe0ddd90c37be4d2245d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.mir.call(label,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 \u0060call_funclet\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/complexify.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac72606da8b72048e2b2350ca2047dc1f2f4304592e340450db24ee0bb885d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Program::new(\u0026ml,config)\u0060 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":"rust/composer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d53d64a99a6879f63f2524280137981510bda64ae4fbbffbe0e0e8a81be08b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.as_loc(\u0026Slot::Arg(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 \u0060append_join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/composer.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4861b4aad6d966669efea76e631c73e58dfcc519f36311204012d681ea447e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060toml::to_string(\u0026c)\u0060 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_toml\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/config.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06e96b19956f39fec5538555f3435062c81a64c29ee75c0e27189d2bda1954d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Config::new(CompilerType::Native,self.opt)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060native_compiler_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":"rust/config.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc738697c14bbc11d7a9f8341e5acf341e8cebe4ea9ab3ac2f02c75e1fb4d81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Config::new(CompilerType::Native,USE_SIMD|CSE|SYMBOLICA|COMPACT|FASTMATH|FAST_COMPLEX|PARALLEL_MUL|(2\u003C\u003COPT_LEVEL_SHIFT)|DIRECT_ARENA_IDENTITY_OUTPUT,)\u0060 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":"rust/config.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"862a6b65ac33ffcd06ccdcfcc736d0ab854ffb615f5f2824a8d42b15139461d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rational64::from_f64(z.re)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rationalize_complex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/instruction.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"916455587af61b528ca75a89e5818652f34c670bb729ec92fb8f29b9bd584a2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rational64::from_f64(z.im)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rationalize_complex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/instruction.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d5cac184e3e929d4cbaa85d82a8788e550b8c5fc23e1ad83dbc734c749a0ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rational64::from_f64(z.re)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rationalize_complex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/instruction.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"09809ba2114b787e8ad2ab584ac1a4d27ffbac0c55de70fd6d50ee62071a635e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rational64::from_f64(z.im)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rationalize_complex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/instruction.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9042bdfaf5b7baebbaa853c3e2c3aa0912366239a8514b2161ebb6cde1c7c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DefaultStack::new(size)\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 \u0060take_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":"rust/lockstep.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2afba6def2fc72afaf47b5f3c289e97f355ead40725fc6248225da6c72a60ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060code.allocate(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 \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":"rust/machine.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99e2ec0472633b4f5430881ac34e69bbed3e68439c94efc9186bf1887fc7b32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060code.set_readable_and_executable()\u0060 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":"rust/machine.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"01809043dfa66eebb2e57130ea8e9b6f95e97bf80132ee0e08a4fe7f4a5d8ffc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::create(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 \u0060dump\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/machine.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e350b906c01115a21b7c012bf4c405626a2943fe56734af824d9df33113f1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060alloc::Layout::from_size_align(alloc_size,page_size)\u0060 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_size\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/memory.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ccf2b4fdb4078395f46a2cdfcad60db0440935bc5c716ab9372123984f21b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060alloc::Layout::from_size_align(alloc_size,page_size)\u0060 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_size\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/memory.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"be73fac19a7baca1bcc4bf64664dd2a86c3c51b00c24abe58fe5cd8714d0b263"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060alloc::Layout::from_size_align(self.len,page_size)\u0060 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":"rust/memory.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3c7f20da57742eefffd568a164c68d85a177d532b3d3268c1107451e6c375b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060region::protect(self.ptr,self.len,region::Protection::READ_WRITE)\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 \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":"rust/memory.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc479a2bc454f196d996741342e10cddd994620376e626dabdaf505d70a49ae0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060usize::try_from(align)\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 \u0060allocate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/memory.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"df24347d2dd11208c6b5f1ff9d7261a0cb76f32030107fb8dff2d594d0e23550"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060icache_coherence::clear_cache(ptr as*const c_void,len)\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 \u0060set_readable_and_executable\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/memory.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d16abbfeaffd6e3e27853a0af7e51cacd3b4eada779c55b605eb5bb78aaf68b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060icache_coherence::pipeline_flush_mt()\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 \u0060set_readable_and_executable\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/memory.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1564658f11c5f5c49425b79e2e243314f0cb465abced5d2f9b887b09a60a61d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.find_op(label)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rerun\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ce4a49dd4673d172b83a8fd0b51615e46750ac312b2f1108a3e57e977b3d9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::create(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 \u0060print_stats\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0ec620d186cd0a0c09c5704208deb41a02079d0e67393ed132750d303c0e4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::create(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 \u0060dump\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac393421a3ddc3d4bd8f3842dd80907ccf357545e24970747c6f0904e6fac956"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args[1].normal_var()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060transform_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":"rust/model.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7068a58d5ffbdf0a91bd7b64bde3a3ed63f2ec694db0ebcc89b85a132d1b052"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Expr::var(\u0022$_\u0022).to_variable()\u0060 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":"rust/model.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb88c6c14664d435a803a19cd8bcb165445507291b4e0162e35ed1576659f10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cond\u0060 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_binary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0320a41d40e7665daac88e51cad7af995ae1325e02df95a639eb7a40e71d6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.compile_leaf_var()\u0060 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_math\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f90fb27f41bf78eb080fc817d3cd5a8f02dc3b02f61ba85035a6563f7559aa6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.compile_leaf_var()\u0060 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_math\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbc47a794ad9a38678cd8f376cb58635c6334bdc8168690ca2eb1fab91c4911"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.compile_leaf_const()\u0060 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_const_math\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c9328ec92e915bf7e82d23df697d34203ea267b19079ad283b185a9df70845"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.compile_leaf_const()\u0060 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_const_math\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"966bcebea197f28d742026349a9ffc6969a84c844378bd26048b543a1e39803d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060right.as_int_const()\u0060 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_external\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/node.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cd5c37ab045252eb5d82b05e02123ef28fd8c01614cd159d706df2f073aca8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.buf[self.pos..].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 \u0060char\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/parser.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fe7687e94a74d33d0a528f40dc0d1e9aa8b56a5a0f0c29ac59eee44685d7e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.head().to_digit(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_num\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/parser.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c3a0aa4c8d1ddaec601f355399ac2431f77a5e03d4d45aa01a37ceef9da753"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.head().to_digit(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_num\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/parser.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2817dac48f06973b172df7ca3919746bdbd6bc4d5646d8fcedddefca8e0234"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f.as_machine()\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/runnable.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6fb86a64cb07445a8ae0172670cd0b862117c680695cf8d5264b49d921c013"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060super::strings::write(\u0026mut self.buf,s)\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 \u0060string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/serializer.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa203d24f479e8c08a068f970e825ea1b8db1de61a0b1e15a38d2d48c9fa9ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.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 \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":"rust/serializer.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a29147771361038d2fb858d65e98f4d8a0120f4b46ab24824278480537ff94c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.loc()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060other\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/serializer.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd2d08dc86b895c8484ab271638d277f4390401c14da4fe99dc9605553de789"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::from_str(\u0026s)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060error_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3624bce7721feeb1eadcb98ef6e8fe17078773dc84c18c40c2ef71c0ae84a6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::from_str(\u0022Success\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 \u0060compile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8785e217a4c6fef1ef91ad6fc396b8aae4b341ea964ffc765eb61584e8f2a5ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::from_str(\u0022Success\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 \u0060translate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"db93dd5df7b1c7e7c4bdc19026432c493df29c0fd8c9b29476aaa630ee9ee44f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::from_str(\u0022Success\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 \u0060load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66dbfa232e7f268fffa2aefeb60fb67d6910e435531128711c57b937ca0f22d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Config::from_defuns(df)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65991b454ecc2d9798ee435bb175b2a89327ef773baad7641ba1acf023ef142"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CStr::from_ptr(name).to_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 \u0060dump\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"336174b7c975af18738bf10dcb18c10d48332db5b1ccef094290b78a95f3d8de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CStr::from_ptr(what).to_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 \u0060dump\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e3bdff25f34620e35454af387e83f6619d0b87bfc4b0eb678e5cf83112fd09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CStr::from_ptr(what).to_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 \u0060measure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"2940c9b7311b35eab2e533e68e271deb29fe4b3a98b2fd404a016915262211d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(env!(\u0022CARGO_PKG_VERSION\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 \u0060info\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/sympy.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"f111c17f8c465203099b8d052b4dbbbe6e94f2d848833ab8a7c41263c89e532c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CStr::from_ptr(name).to_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 \u0060add_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":"rust/sympy.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"b929c7297e29f5cbd49e9aca5b214774079cf986259cfcf05cb08878545be2c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CStr::from_ptr(name).to_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 \u0060add_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":"rust/sympy.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c6358f3d84da5831a6c89b74e05c896014ff2bf6235f341bbcaffcf46a1fd6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subs.get_mut(topo)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/topology.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9fdbd0914e8e3f3bb1aa4ed210dbcc8afcfcfb573b5b88548e6b98b1a07724"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.labels.get(label)\u0060 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_instruction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c860741fda6524b64d5c17176832459d3dd5f9c35bb5888c3b6cd929ef98c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.find_op(label)\u0060 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_instruction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a3c1291305c3a11d55b2cf88a75fd71e56c836931b8dcfcf3fbf4dfdab55ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060returns.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 \u0060exec_instruction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1fbfbc8f8863a2dadbc608d65b217499be6640afba2b74c66e3c12ab20cf60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.labels.get(label)\u0060 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_instruction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa973ef3adfc1da881394fceb15cd6e3375138eeacd804368603ad4bdb94aa9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.labels.get(label)\u0060 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_instruction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/interpreter.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"44de17db4e2f107bacf18009a91d60c370cc727ab3dc33652c25c01b6f4b59fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060q0.label()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fuse_goto\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/peephole.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e0e914faec5ad550725f4cd730337f4a8a7d5cc8d20c0e3e87236763ec345"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060q1.label()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fuse_goto\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/mir/peephole.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"578d4af0f0fc2ce30dd11455e2fa61fc7226b22d1239d6c95abfcce30307807b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060amd.a.buf.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 \u0060fuse_load_math\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/amd/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0bc39a799d8f577331920be7524e95c430fadb0a361d7b9ec6e6fcff4a57c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060classify\u0060 swallows every exception into \u0060return \u0027special\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/integration/corpus.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae90565f3d5aac0d3f4eebb4b6e81060651413ce0772f1cfed5ede9d6c6f8112"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060check\u0060 returns \u0060\u0027wrong\u0027\u0060 when \u0060(TypeError, ValueError, ZeroDivisionError)\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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/integration/run.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac3cd0a5cace8c3f12b2da2cf8b5389dd28050884cdc897bf4aaf1d615a9cec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060check\u0060 returns \u0060\u0027wrong\u0027\u0060 when \u0060(TypeError, ValueError, ZeroDivisionError)\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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/claude/run.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"db63301d798c5ff228296aee2f18304a7a8667ffaef2ecfdff18cc3c52a2e3de"}}],"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-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]}],"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":2,"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."]}]}