{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"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":"rhai::func::builtin::get_builtin_binary_op_fn (cyclomatic 321): rhai::func::builtin::get_builtin_binary_op_fn has cyclomatic complexity 321 (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":"src/func/builtin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af3ba51a6b248a155c7d44b2b031b84bd0ebd24ef28d63a958651e51ffbf60"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::tokenizer::get_next_token_inner (cyclomatic 152): rhai::tokenizer::get_next_token_inner has cyclomatic complexity 152 (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":"src/tokenizer.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"084fe2a202dfa41a1d7ed832379b6111b1ea48492ba7ab29b2468b2b31f7aa40"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::run_frame (cyclomatic 118): Vm::run_frame has cyclomatic complexity 118 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":3442}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f71c653f5c014dfc429c81670af7d11482c32d405e79bc6773fe22942219e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::optimizer::optimize_expr (cyclomatic 115): rhai::optimizer::optimize_expr has cyclomatic complexity 115 (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":"src/optimizer.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6993ee6da284e6c25af6d2d93839c47af85d619839ebb5e59140e817b9e589c"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::eval_stmt (cyclomatic 111): Engine::eval_stmt has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/stmt.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc2ce4e7b098b341f232fb663f4b5ad4437382044027eeda26524b45c9ba12d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::func::builtin::get_builtin_op_assignment_fn (cyclomatic 111): rhai::func::builtin::get_builtin_op_assignment_fn has cyclomatic complexity 111 (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":"src/func/builtin.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"714630aed398fbecdb13abf7a49244e0f6db5283446c77cdbba83348cc2b51bb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::optimizer::optimize_stmt (cyclomatic 80): rhai::optimizer::optimize_stmt has cyclomatic complexity 80 (threshold 15). Of this number, 77 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"611c5d2b9ea8d6d7fa7094b1c656e39b76be9d62cfc2111635a0da78e1e0f60a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::grain::bytecode::code::assemble (cyclomatic 78): rhai::grain::bytecode::code::assemble has cyclomatic complexity 78 (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":"src/grain/bytecode/code.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe764bff957eaec6257d884381e92e3bd774e853713cbb238a62dc13ccecb4b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::bin::rhai-dbg::debug_callback (cyclomatic 68): rhai::bin::rhai-dbg::debug_callback has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-dbg.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51cfd87fb19347c2c22b367b84777e042a45d5d0ee3e95732952a010fe84228"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering::lower_statement (cyclomatic 62): Lowering::lower_statement has cyclomatic complexity 62 (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":"src/grain/compile/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"821595b2a130cd3cd188cb686af77d6d7dc43b8c8d6407042584065b57b02146"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_primary (cyclomatic 60): Engine::parse_primary has cyclomatic complexity 60 (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":"src/parser.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba69634642f12a6bf5cad23359eea81c7734d9235b0ed92dc580fdde42ac6040"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalAltResult::display (cyclomatic 60): EvalAltResult::display has cyclomatic complexity 60 (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":"src/types/error.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9df5ad26beec2b56faad64dc60689ec6edb05e9a9d7b6bde0b2a97bdda0178"}},{"ruleId":"D1","level":"warning","message":{"text":"Stmt::walk (cyclomatic 50): Stmt::walk has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/stmt.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f891f0e10c2b714489d4bf26e3e7b493ee7844f7f308624b243748d6df3afad6"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::eval_dot_index_chain_raw (cyclomatic 48): Engine::eval_dot_index_chain_raw has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/chaining.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"31235ed99191e151f296967709faa96fbb883a7a7b0bd902786d9d2ae671311e"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::get_indexed_mut (cyclomatic 47): Engine::get_indexed_mut has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/indexing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"521a68311ecf62382f37caa867fa5ddb070767d7c1781206e2a841e74ba71bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::api::formatting::map_std_type_name (cyclomatic 46): rhai::api::formatting::map_std_type_name has cyclomatic complexity 46 (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":"src/api/formatting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21ec12dc4d13d7f858038d9544a8e7d5217b933ec1724c450fca983bc23805e"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::fmt (cyclomatic 45): Dynamic::fmt has cyclomatic complexity 45 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 11 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9c7752d555cbce136267b51dd863ebf834b2ab4ecf8b83e1abde6b3ed7bb98"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::optimizer::optimize_stmt_block (cyclomatic 44): rhai::optimizer::optimize_stmt_block has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"124ca55c4716cf4bfd425bcd4aa31525118f865cd865ae840a38421971ec2e79"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::tokenizer::parse_string_literal (cyclomatic 44): rhai::tokenizer::parse_string_literal has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a6943c26bc915f1f4c3dc2cf6a9199d351276c5b34c459f236d78f28e4861b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::bin::rhai-repl::main (cyclomatic 44): rhai::bin::rhai-repl::main has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-repl.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3125e1c5cf622fdb007000afdd990897906df7af2141537c4c4fc7de98766b"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_stmt (cyclomatic 43): Engine::parse_stmt has cyclomatic complexity 43 (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":"src/parser.rs"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7865e92fc9baec50833a827d691ef3322f7ec1bd86a0da84e9a4be1082d734"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_custom_syntax (cyclomatic 42): Engine::parse_custom_syntax has cyclomatic complexity 42 (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":"src/parser.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76f5332f3eee5a9ec63b26214dccd121007cb3e2609208751794a0ccf61a51d"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenIterator::next (cyclomatic 41): TokenIterator::next has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b92115191f164e20104107f9357974627dc3c1a4541b1e668aab57249a8188"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::fmt (cyclomatic 41): Dynamic::fmt has cyclomatic complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"891f56e7cd2c1ae4251969635ceb0eff0be8e03ff70c4977c7695500fa0c6d26"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering::expression (cyclomatic 36): Lowering::expression has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d3452450efa7bcfcada29c31c62efa8f3ac5782f4962dbc923286a19ac9d09"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::fmt (cyclomatic 33): Expr::fmt has cyclomatic complexity 33 (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":"src/ast/expr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f55b860a670fb0d66c64d2f0f9b411ea8ec6f33e7ba2b018eb280b845fb80fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::exec_native_fn_call (cyclomatic 33): Engine::exec_native_fn_call has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/func_call.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc6107b4086b1c868586a3071f4184e38b4d96588fbc209d8f3c2572805925"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::make_function_call (cyclomatic 32): Engine::make_function_call has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3856cd2e5df516bfe60f02ee3db84a7e6faf5ad23b6cc25b3f831e3d733346d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_switch (cyclomatic 32): Engine::parse_switch 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":"src/parser.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72ee882ec3fe6790e68a80b6008253bc806198ff3d0c6a15c1a506f6caeca8"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_binary_op (cyclomatic 32): Engine::parse_binary_op 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":"src/parser.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e7d9b48c594702e7ed4c3d3059120057d62d9a09bd4df613628a087785cd0a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai_codegen::custom_type::scan_fields (cyclomatic 31): rhai_codegen::custom_type::scan_fields has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/custom_type.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e42eba1fa85717132e2d381bb4ade3fdb1ef5fa936b0be6e9703cc030fd60c"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::eval_expr (cyclomatic 30): Engine::eval_expr has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/expr.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c143211cd0ee5930545d6703494b2b69e6809fb1f64cd203e35134ecfc0569"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::make_method_call (cyclomatic 29): Engine::make_method_call has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"067917c8da2bcb656299fc3c10a298f4448610a32ef41250ca7095f4910a850f"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::hash (cyclomatic 29): Dynamic::hash has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"360d8439bdadfdbe63e158b8ef6d61c3bdb11f2669464b589a1df0f3a9629a14"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::try_cast_result (cyclomatic 29): Dynamic::try_cast_result has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eec899d029cde9948acac2eaf97a41c96516350150647c04dfa2f6ceb6e761"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::grain::bytecode::verify::verify_chunk (cyclomatic 29): rhai::grain::bytecode::verify::verify_chunk has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/verify.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0e170bb9cbdc6c72a82ed7100af448aefe5171c6a70b255d24e3ac85f73ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_postfix (cyclomatic 28): Engine::parse_postfix has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d926c1ca2d851a2f96d199dc71c5344fca8d0d61f69523fa58e1051d4d147ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::downcast_ref (cyclomatic 28): Dynamic::downcast_ref 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 shape REPEATS in the file: one other method here (Dynamic::downcast_mut) 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":"src/types/dynamic.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8632f0bf17940ed8f6c20b5be5f281d62d054ec5cafbbc4d4b9b3a46c4f7d1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::downcast_mut (cyclomatic 28): Dynamic::downcast_mut 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 shape REPEATS in the file: one other method here (Dynamic::downcast_ref) 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":"src/types/dynamic.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5cfc3f491f5c4cf9e39ef9e889355242e0ffc2a6c45e770ea9c20297bba51"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportedFnParams::from_info (cyclomatic 27): ExportedFnParams::from_info has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/function.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"15daadc3aba1eb3315d36317f9386ac0e01a6b9ddae30acda3a086e0f9f214da"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::get_literal_value (cyclomatic 26): Expr::get_literal_value has cyclomatic complexity 26 (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":"src/ast/expr.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a4f5c535e956964b481095ac84847a7f154e0836c33503d9c079ef6ab0d32"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_fn (cyclomatic 25): Engine::parse_fn has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddd370666e4f7960241b61e1bcd8623e08b4e038905985f1f96f108b9a0b1bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::register_custom_syntax (cyclomatic 24): Engine::register_custom_syntax has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api/custom_syntax.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8fef6ae20bf6a734da28827110f0670ae95d2370a9fd2815016afb8353051a"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::make_qualified_function_call (cyclomatic 24): Engine::make_qualified_function_call has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"25373a16a7098f662d47374b6da3eded6dd9f2d19f8f11ef2aa05072cbc636f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering::switch (cyclomatic 24): Lowering::switch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec25bcd4a2971acb543e8770ca9700d3a87236ad34f7a0cfb87de91b266ad1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic::is_hashable (cyclomatic 24): Dynamic::is_hashable has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"src/types/dynamic.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcf5418b189a6f996401ad5610366886f1c08eff6ca638b26f7189004cab4ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::walk (cyclomatic 23): Expr::walk has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/expr.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eae697692c1c57fc1fdf180c147989ac235e98ad884efa734a819d24dc24ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::call_script_fn (cyclomatic 23): Engine::call_script_fn has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/script.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a67d5881e59eb4e4e16580d761806436f075dc60abb86c1fbc066f82ecb3b47"}},{"ruleId":"D1","level":"warning","message":{"text":"Stmt::is_pure (cyclomatic 22): Stmt::is_pure has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/stmt.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"62638d807dac3456db6b8b6c096de7a22a7144d74dd2830946441ae3bf463fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::packages::array_basic::array_functions::sort_with_builtin_desc (cyclomatic 22): rhai::packages::array_basic::array_functions::sort_with_builtin_desc has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddda1acebd1a2c4ab71b316b66854a0a4d97c0f97894c76ac1252a444f13353"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_fn_call (cyclomatic 21): Engine::parse_fn_call has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa37f298065d8fdd26ea40e338d6b9f0744e2ed84faa8311b8ee11690fc536cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_index_chain (cyclomatic 21): Engine::parse_index_chain has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (check_argument_types). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b2ffcf51ab2222d916f5c5127197758fe072b1e859c74a2a0c7381a4cbcd72"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::make_dot_expr (cyclomatic 21): Engine::make_dot_expr has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2840196f722160e473f98fbfb929dceaacf34383520a24d6bb028e7e9f2515e"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering::chain (cyclomatic 21): Lowering::chain has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4af76928811d2add8229d0ae01e03ad3f2ab51f93ff9b38ec3fb7e37b403bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::grain::format::read::get_constant (cyclomatic 21): rhai::grain::format::read::get_constant has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/format/read.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af5b745d9afd5ad9cd8042877924635766c915eaedf1e224c944f236eef9400"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_map_literal (cyclomatic 20): Engine::parse_map_literal has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"934f1c2a543297bba5c2d4f025590041914b9cad76503fa3e7b5981c7ee894e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::make_assignment_stmt (cyclomatic 20): Engine::make_assignment_stmt has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"src/parser.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f408569327550a5fce80d7021c58c6645438941d1d4291beadf4f8a821d82f0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::grain::format::write::put_constant (cyclomatic 20): rhai::grain::format::write::put_constant has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/format/write.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b76c2e0a7fd31d31c77d3ca504f805e2607461a85535cffb6ef9b2d505cac"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai_codegen::rhai_module::generate_body (cyclomatic 19): rhai_codegen::rhai_module::generate_body 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":"codegen/src/rhai_module.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebe6da071171fd1cc033949f3c55fa8ff119d787a6a2d270e11483d53e11a36"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::exec_fn_call (cyclomatic 19): Engine::exec_fn_call 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":"src/func/func_call.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8fb375d7d2076ab23f8f2cf0421e36593a6d8574fadd1436c167c3da2fbea9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::api::formatting::format_param_type_for_display (cyclomatic 19): rhai::api::formatting::format_param_type_for_display 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":"src/api/formatting.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abbbe9da7b28ebe352bcc191366efcf9b0facf4615a245ef72be993d54a0cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai_codegen::custom_type::derive_custom_type_impl (cyclomatic 18): rhai_codegen::custom_type::derive_custom_type_impl has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/custom_type.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c65f1a1f9d9c3ea05de70891b43e1087652b08b2f07f5f5e94f3ab3b349f13"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportedFn::parse (cyclomatic 17): ExportedFn::parse has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/function.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d587989f7c00ec7d320caf255a3ccce303a7dcb49f0f66a70702e53ae73365"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::resolve_fn (cyclomatic 17): Engine::resolve_fn has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/func_call.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"367ad59b99822f1e389ba35bbdae1621ac88fe55ef73e8be5e58e2a6eb4c99d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger::is_break_point (cyclomatic 17): Debugger::is_break_point has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/debugger.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddc13ed69cac41b07c194695acc367e7b56c33a897d120485e856994eabb599"}},{"ruleId":"D1","level":"warning","message":{"text":"Op::disassemble (cyclomatic 17): Op::disassemble has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/op.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b923a27ce0a90641e24d251d948848475c7cf20e1c7ec1ad83318a266e015"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportedModParams::from_info (cyclomatic 16): ExportedModParams::from_info has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/module.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8309fe40b66409b3135d0ab1b35cc7ba0a32ed26470b601ebeb75d69c5c06"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::eval_fn_call_expr (cyclomatic 16): Engine::eval_fn_call_expr has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e48c98c1813690ce76866e404c49fad55a16422b42ce542eee7aba5e035b71"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_let (cyclomatic 16): Engine::parse_let has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"33505b3ccc7b161515e6ba80ec2b5e8554a1c55180564c1cb26c2f3b244a4ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_block (cyclomatic 16): Engine::parse_block has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f198a3d38449f65d498bbada062d537bbbb33369c0351678a46f2ca7a678c37"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::parse_anon_fn (cyclomatic 16): Engine::parse_anon_fn has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"32210cb6f27d6749f67e25539395481be07750548665eeebedb26f72af073397"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::grain::bytecode::verify::required_caps (cyclomatic 16): rhai::grain::bytecode::verify::required_caps has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rhai::grain::bytecode::verify::effect (cyclomatic 29) 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":"src/grain/bytecode/verify.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb8ec006cb1f9606d2f342a74b0e5e7a11c1e168c10004e1e8efbca95437b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhai::tokenizer::parse_raw_string_literal (cyclomatic 16): rhai::tokenizer::parse_raw_string_literal has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9003efba79b73d8294eb857b8456afde0366f5f247adff242438134155e713"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::func::builtin::get_builtin_binary_op_fn (cognitive 231): rhai::func::builtin::get_builtin_binary_op_fn has cognitive complexity 231 (threshold 15). Drivers by points: if/else 82 (174 pts), match/switch 34 (50 pts), boolean chains 7 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/builtin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"702f000ddcb04ea4ae4310aacfd2e6725dd40c1809f6d08756a4bb1d59143b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::run_frame (cognitive 211): Vm::run_frame has cognitive complexity 211 (threshold 15). Drivers by points: if/else 62 (184 pts), match/switch 5 (15 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 136). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":3442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59c308dd8306eb0dc7d92cd2b7d703776a826d4a193eb66c1fad806bad8f71f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::eval_stmt (cognitive 206): Engine::eval_stmt has cognitive complexity 206 (threshold 15). Drivers by points: if/else 50 (118 pts), match/switch 20 (55 pts), loops 9 (25 pts), boolean chains 8 (nesting depth added 119). 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":"src/eval/stmt.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7de947f8588297bad8898ab272d6dfa67436b5e6eac9444768b3060c438b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::tokenizer::get_next_token_inner (cognitive 168): rhai::tokenizer::get_next_token_inner has cognitive complexity 168 (threshold 15). Drivers by points: if/else 37 (106 pts), match/switch 15 (50 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"745829a7a2f3f19bc82876b3f105c5408d46cc2c433b96a78612e6b276d97e10"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::optimizer::optimize_stmt (cognitive 119): rhai::optimizer::optimize_stmt has cognitive complexity 119 (threshold 15). Drivers by points: if/else 32 (74 pts), match/switch 14 (27 pts), loops 3 (10 pts), boolean chains 8 (nesting depth added 62). Of this number, 117 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/optimizer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af9a5098ce50ca6a5969a162311ddfdbbf0fe003e000e40b589a834f6441566"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::optimizer::optimize_expr (cognitive 118): rhai::optimizer::optimize_expr has cognitive complexity 118 (threshold 15). Drivers by points: if/else 26 (62 pts), match/switch 12 (28 pts), boolean chains 20, loops 4 (8 pts) (nesting depth added 56). 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":"src/optimizer.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"24732c522d7c6e82f25f780b32f2fdd5828eb574f81fad7c02f8dd9b95737b22"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::eval_dot_index_chain_raw (cognitive 99): Engine::eval_dot_index_chain_raw has cognitive complexity 99 (threshold 15). Drivers by points: if/else 21 (52 pts), match/switch 18 (45 pts), boolean chains 2 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/chaining.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f43bf300d5d0ecc5509df7a7f1285ce4edcd59105e4e17885932900390f1d55"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::bin::rhai-dbg::debug_callback (cognitive 98): rhai::bin::rhai-dbg::debug_callback has cognitive complexity 98 (threshold 15). Drivers by points: if/else 23 (62 pts), match/switch 8 (25 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-dbg.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3368445009568a515d496b50638a953339c9ebc03f5ff48e9070e0a81d81a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Stmt::walk (cognitive 91): Stmt::walk has cognitive complexity 91 (threshold 15). Drivers by points: if/else 26 (67 pts), loops 11 (23 pts), match/switch 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/stmt.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbabb63055accf10e4e304549c3e9475a2a99b5cfbd5ad5e7361aa48b121db9"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::get_indexed_mut (cognitive 91): Engine::get_indexed_mut has cognitive complexity 91 (threshold 15). Drivers by points: if/else 38 (77 pts), boolean chains 9, match/switch 3 (5 pts) (nesting depth added 41). 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":"src/eval/indexing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e5cea5c18f2a73509529a74b434edcd5536f10519c70841080e7a2270cde4f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::bin::rhai-repl::main (cognitive 86): rhai::bin::rhai-repl::main has cognitive complexity 86 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 7 (21 pts), loops 6 (18 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-repl.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d7320b778c98b4544bdb50c582422fbc22c41b16a445e838eda9ac0e105ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::api::formatting::map_std_type_name (cognitive 76): rhai::api::formatting::map_std_type_name has cognitive complexity 76 (threshold 15). Drivers by points: if/else 50 (66 pts), boolean chains 9, match/switch 1 (nesting depth added 16). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"src/api/formatting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cafc5495b270a8687696a27b34cc1b783d8f0c77c262bd7d06f2541cd59ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering::lower_statement (cognitive 74): Lowering::lower_statement has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (43 pts), match/switch 11 (21 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 34). 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":"src/grain/compile/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"e591daed943e9b6d6445a05bbbaf8fbe154cc2b2a4796fec482f3798519e6f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::optimizer::optimize_stmt_block (cognitive 70): rhai::optimizer::optimize_stmt_block has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 5 (15 pts), boolean chains 11, loops 5 (10 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1db347f80ac10005b18846d6e6f1b0f4b2147eb61097cc0b89db58657c6e648"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai_codegen::custom_type::scan_fields (cognitive 69): rhai_codegen::custom_type::scan_fields has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (42 pts), match/switch 7 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/custom_type.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3328a9250f764f52bffd198d639b09ddbe6972ad107a46552d7f291f2c5384"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_primary (cognitive 61): Engine::parse_primary has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 14 (32 pts), if/else 9 (22 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 32). 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":"src/parser.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefed1435f050aaaf96a89c37cf11169ea6016aae153a4523a5bebe17ce0085a"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_switch (cognitive 60): Engine::parse_switch has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 6 (16 pts), loops 3 (7 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b10ea7b1f6fe1e0d2de0d6a27c579f0c41f572cf5589af9f9783218dcc8c366"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::grain::bytecode::code::assemble (cognitive 60): rhai::grain::bytecode::code::assemble has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (47 pts), match/switch 4 (11 pts), loops 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/code.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b21e24c905cecebd2d51d67d1efa6cbb4c9d46928b0298ebf736489d588ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::make_method_call (cognitive 59): Engine::make_method_call has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (44 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 36). 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":"src/func/call.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c874dfe1b8a145e48e586ba3fe21f25bdbff9aa714f3d29018320dcbc6bcb6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_binary_op (cognitive 58): Engine::parse_binary_op has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (45 pts), match/switch 4 (8 pts), boolean chains 4, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815fa6938d11191be41027aff6f4007f84d0a5c305665400ebb0ea6e4ce8291"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::exec_native_fn_call (cognitive 55): Engine::exec_native_fn_call has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (35 pts), match/switch 6 (16 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/func_call.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2325bcf5c5aebbed329edd1c5f00de1684b906eb8f9b8979cfdc1c615f8b29b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::tokenizer::parse_string_literal (cognitive 55): rhai::tokenizer::parse_string_literal has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 4 (10 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a6adb1a402ddbb48c1918dc4171f2f57b8ee71ee75b3e773b47af1aa592b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenIterator::next (cognitive 52): TokenIterator::next has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (38 pts), boolean chains 7, match/switch 4 (7 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"d000f2c3ec42a5028fd023b53c78308610e364ad8a93dccf7ef9181e7f396c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_custom_syntax (cognitive 50): Engine::parse_custom_syntax has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 13 (37 pts), if/else 4 (8 pts), boolean chains 4, loops 1 (nesting depth added 28). 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":"src/parser.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a5c69db0f59d75c0502508671846a09b63b9ab677065b24f5662714ada591e"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_stmt (cognitive 49): Engine::parse_stmt has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f9eaf2b05ae7ed9e48057915af41cacbd251f1d3f21416c00f4df743919c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::exec_fn_call (cognitive 45): Engine::exec_fn_call has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 4 (13 pts), boolean chains 2 (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":"src/func/func_call.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cc98b477ec23f5aefc5e7420fb77b9875a6d4c19c6065241e7cb589a14e44d"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::make_function_call (cognitive 43): Engine::make_function_call has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 7 (16 pts), match/switch 4 (6 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de5b2596741ddcbb590f3c6ceff46a1325e86ec26b4d9387f2846ac2607cae4"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::resolve_fn (cognitive 42): Engine::resolve_fn has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 24). 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":"src/func/func_call.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c57332d618e7eb8b0ab415b1abf8c350d16f9dd7d276160d41722408917b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::grain::bytecode::verify::verify_chunk (cognitive 41): rhai::grain::bytecode::verify::verify_chunk has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (8 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/verify.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15076c15b51fcd5932029d7a12426737f99209004a069e5464d25ce01d728f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::func::builtin::get_builtin_op_assignment_fn (cognitive 41): rhai::func::builtin::get_builtin_op_assignment_fn has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 16 (21 pts), if/else 9 (19 pts), boolean chains 1 (nesting depth added 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. 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":"src/func/builtin.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"0783fd190f6b306353696cf088e1afdaff123b9df25bd9227fdaa5321fa205f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::try_cast_result (cognitive 40): Dynamic::try_cast_result has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 14 (26 pts), if/else 14 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"9753f3260e602775ef692eb8dbad511e3ea93e7ed0bedc78e5c2e6a3cbecba35"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::downcast_ref (cognitive 38): Dynamic::downcast_ref has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 13 (25 pts), if/else 13 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Dynamic::downcast_mut) 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":"src/types/dynamic.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7ebba5ea61bfed47a32b80696518412d947018380a25e1f3620d3580a6bf2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::downcast_mut (cognitive 38): Dynamic::downcast_mut has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 13 (25 pts), if/else 13 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Dynamic::downcast_ref) 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":"src/types/dynamic.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"679552099437d789c66db923dd0784aef5e5bcb2cef147814c6693d523452b96"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::walk (cognitive 36): Expr::walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (12 pts), match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/expr.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d373ed5342ce62ad03748d3438e90a1ed1163e57a5bc7defaf6bdd0501bdbf78"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::eval_expr (cognitive 36): Engine::eval_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 6 (12 pts), match/switch 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/expr.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bec568e4287bc6b3afe10316f3dfc65c0f51761b740bd482c09e1c6d733531"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai_codegen::rhai_module::generate_body (cognitive 35): rhai_codegen::rhai_module::generate_body has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (9 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/rhai_module.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f179fb095b4997fdc03aab6e9547427d411c37683248290ea306087885059283"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_fn_call (cognitive 34): Engine::parse_fn_call has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ae8f4fa9ee9464c550e3aef83f4891f9feb598d2e4900e8733fdd151da8724"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering::switch (cognitive 34): Lowering::switch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 8 (11 pts), match/switch 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f938bf08940caf32dd8ad7cb83b892a67f45b3ffc2cf7d971d0dd5f1ba44494"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::fmt (cognitive 33): Dynamic::fmt has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (42 pts), loops 3 (9 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Dynamic::fmt::checked_debug_fmt) 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":"src/types/dynamic.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f42a68c0251d58b43d21ee20c29030e6ad5c6302beed970b2d0e8bd0f38636"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_postfix (cognitive 32): Engine::parse_postfix has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 5 (9 pts), boolean chains 2, loops 1 (nesting depth added 16). 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":"src/parser.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"703252c61f7d8c61a1ffef4efdf544c2156010904c955af175afae7b0ab0835d"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::make_qualified_function_call (cognitive 31): Engine::make_qualified_function_call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (8 pts), boolean chains 4, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba7d8f67e182148e6e0a02529ff4030b3e39414c140f66293311bd2dc76cd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::call_script_fn (cognitive 31): Engine::call_script_fn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 6 (12 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/script.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f08eee0da7522768314d1464c431838dba3de99782a608f633dc2109e5b295"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::eval_fn_call_expr (cognitive 30): Engine::eval_fn_call_expr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 3 (nesting depth added 14). 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":"src/func/call.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eaeb6e84a35bf4b610007fce81ee35400bf3f3f641e1fa8817504fda015790"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::fmt (cognitive 30): Dynamic::fmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22 (40 pts), match/switch 4 (8 pts), loops 2 (6 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Dynamic::fmt::display_fmt_print) 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":"src/types/dynamic.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e1137aee4072ffc834ac90fc8f55ebf91130fe0e0b027a526b602471c40246"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportedFn::generate_impl (cognitive 29): ExportedFn::generate_impl has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 10 (13 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/function.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6fb60c62338f1afa65acf1d0a8bff09b05ed67fdd1e0eb5dd36a2e42933bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai_codegen::custom_type::derive_custom_type_impl (cognitive 28): rhai_codegen::custom_type::derive_custom_type_impl has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 5 (9 pts), loops 3 (5 pts) (nesting depth added 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. 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":"codegen/src/custom_type.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d750fbaaf2f9ab3c03ccbad12a01d23415245a576dd82fbf9feb169c1988e358"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::eval_ast_as_new_raw (cognitive 28): Module::eval_ast_as_new_raw has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/module/mod.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0445d8930f44d35c30ad37796cbe69f80ad420a9bcc1e99ed1ece6e825191c"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::call_syntactic (cognitive 27): Vm::call_syntactic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f09369e33f97d3d673a89b6407f15ad3f449b4372d57d9efbeae254a0dfcc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering::chain (cognitive 26): Lowering::chain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (8 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f340d829dd4e0429074c224f39573541bf68f79691af398d6a8d9e36c8c5445"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::fmt (cognitive 24): Expr::fmt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/expr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9bef7034f63446dd0f3cfbd8fb2cd73d0dca87328e2fd704a7a263e70e5fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering::expression (cognitive 24): Lowering::expression has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c663db663889632379da3538bdad63e36e12a125402a5db8badcb4f98b133b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::grain::format::write::put_constant (cognitive 24): rhai::grain::format::write::put_constant has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/format/write.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a482a102e83d363baf0c9f8b5a95fa7044bd3f154668d2db9bf9059b262648"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::parse (cognitive 23): Module::parse has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (8 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/module.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae6d84588f62547c2b51acc0248b10c2390e417e7ff46b7082047a7d07422d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai_codegen::rhai_module::check_rename_collisions (cognitive 22): rhai_codegen::rhai_module::check_rename_collisions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/rhai_module.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3f5c405781084ff1afd79bd6e2df6476bbaae8f9d6ece7433984b52584ca6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::register_custom_syntax (cognitive 22): Engine::register_custom_syntax has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (9 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api/custom_syntax.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ac696dfb4d5048cf20b5ffe5a3d3b675a29678bab33e2c43dd5bd30cfb037d"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::build_index::index_module (cognitive 22): Module::build_index::index_module has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4, match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/module/mod.rs"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"74233d54197cc5aaf31f4101d011e62d9de77a9fec7e7f0c66c1598eb5724ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::make_dot_expr (cognitive 21): Engine::make_dot_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a0b8309d9efba9c9d807495194d5d69fe38f2ad54bf2d09c469e08cdc9af42"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_let (cognitive 21): Engine::parse_let has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, match/switch 4 (8 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e2dbaede99f42a64c5c237c0bbe022de4344658e3855e52936299fbfe9e2ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::hash (cognitive 21): Dynamic::hash has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (nesting depth added 5). 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":"src/types/dynamic.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f678712b9d5d0214ebd8c29ef5c292009de045c5fb8075a166c0a1c2da18598"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::tokenizer::scan_block_comment (cognitive 21): rhai::tokenizer::scan_block_comment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf09fb4d20934f36a4483d13154bb0369f5969aea020f76bfd1a062050216f22"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_fn (cognitive 20): Engine::parse_fn has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 2 (5 pts), loops 1 (2 pts) (nesting depth added 9). 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":"src/parser.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d95dbf7374a845225d66dedcf77b651cbd3bd5f78fc13d89434da75e361b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportedFn::parse (cognitive 19): ExportedFn::parse has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 3 (4 pts), loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/function.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8086c5c7ab4da7eec739e19b0ab94c9ba8fcda9a45c47ec9e36923018db5b7da"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::search_namespace (cognitive 19): Engine::search_namespace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/expr.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7520514229d1244cbaeb4f356dffb0c6b00a2d3ea193a22ee409158ee43fbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Target::propagate_changed_value (cognitive 19): Target::propagate_changed_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"src/eval/target.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e209da737fa6629defc1bee354d3e7cd257e28df0efe866df127e70855f6c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::walk_chain (cognitive 19): Vm::walk_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (6 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b928220c977fc4134feae03342d2e104439d555f9e6542d7ff2bf246ae15ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::fmt::checked_debug_fmt (cognitive 19): Dynamic::fmt::checked_debug_fmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Dynamic::fmt) 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":"src/types/dynamic.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66c6c3bb62f1255cb9ee4d2f10d9f254a33e9a4c5f5a1f644b36bf0b8ad708d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnPtr::_call_raw (cognitive 19): FnPtr::_call_raw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/fn_ptr.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e54764b960376f127055bb12d6c6d31c462de308a20c85746f69b37ce4de37"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::tokenizer::parse_raw_string_literal (cognitive 19): rhai::tokenizer::parse_raw_string_literal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e8e7550113a37a102c360317ccf8cd01b52195bd0ee6238aca04b8e0eeda1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai_codegen::attrs::doc_attributes (cognitive 18): rhai_codegen::attrs::doc_attributes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/attrs.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"974477b5516f7bda0ba1835f5e494282168afe19e9bc974353bcbc731ece23fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::parse_anon_fn (cognitive 18): Engine::parse_anon_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e3010f875c57a4ed8f3c0007d853a01a7dd2ce805ec1b659e987db86bbf758"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::bin::rhai-dbg::print_source (cognitive 18): rhai::bin::rhai-dbg::print_source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-dbg.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b35b2bc5a15b07a95e4dc71ead55dcbb231570c7c9859d77e5d100d071b3a79"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::packages::array_basic::array_functions::sort_with_builtin_desc (cognitive 18): rhai::packages::array_basic::array_functions::sort_with_builtin_desc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 6 (9 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0375ba9779d35789ce9105abd38a7611974705823480b75e8f569696bd2b909b"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::make_assignment_stmt (cognitive 17): Engine::make_assignment_stmt has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (6 pts) (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, 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":"src/parser.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb8185591d958c51eb3aa9f010c2004b986c1c36b2f664f8f6bef24034e0621"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger::is_break_point (cognitive 17): Debugger::is_break_point has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (13 pts), boolean chains 4 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/debugger.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2693ea9babfef4daf2bd8ef28339ab05fee6cc7fa1b18b1caf62e1728cb80a"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic::fmt::display_fmt_print (cognitive 17): Dynamic::fmt::display_fmt_print has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Dynamic::fmt) 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":"src/types/dynamic.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"2287492451ea51e78ab73211662c58f5cce55d69b5a48457554ff6703efb567b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::packages::string_more::string_functions::sub_string (cognitive 17): rhai::packages::string_more::string_functions::sub_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/string_more.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"931d562e10338aa677a59d276317addc04a1ce7d5fc59bb3e0ec72acdd8fd950"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::packages::string_more::string_functions::crop (cognitive 17): rhai::packages::string_more::string_functions::crop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/string_more.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af492ae243c03b0400f06dec18b9127f220261a7e8a6ba15e6226408f0d816c"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::walk_property (cognitive 16): Vm::walk_property has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf37ac7be923d33ed09b0f364de0e3713c274b3d4de36ee4d3ecd15929b019c"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::write_definition (cognitive 16): Module::write_definition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api/definitions/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9046a26d4ad657afdd8b2b0122d75e144e7e61cbb221689c517deec5960363"}},{"ruleId":"D2","level":"warning","message":{"text":"FnPtr::_call_with_extra_args (cognitive 16): FnPtr::_call_with_extra_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2, boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/fn_ptr.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23dd9a98c9f825b8f7f39d3275c08d9edbe2437db7ecd57dc03269aa9271d35"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::bin::rhai-dbg::load_script (cognitive 16): rhai::bin::rhai-dbg::load_script has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-dbg.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dba52dbb8f1c627da24adfdcfc72b057911a87cead6308be9b5ca071226adb0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhai::grain::format::read::read (cognitive 16): rhai::grain::format::read::read has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (8 pts), if/else 6, match/switch 1 (2 pts) (nesting depth added 2). 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":"src/grain/format/read.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"83812342bf576b4eb4cdf99dc0a744d00702df28ac21fae615467baa5036dd90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Engine: TooManyMethods \u2014 224 methods, declared across 32 files: src/parser.rs (32), api/limits.rs (20), api/options.rs (20), api/register.rs (19), \u002B28 more file(s). The bar is 30 methods; this is 194 over it, 7.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dda41d303975dd33998a659f1892be7dcc56160ff13e662c7a6bd15bd3f325"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Vm.run_frame: MethodTooLong \u2014 run_frame runs 629 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 529 over it, 6.29\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":"src/grain/vm/mod.rs"},"region":{"startLine":3442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8485c6bf25e3ff130e85c3fa7d019e69e9bc690f154599620f872be282016eaa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Vm: ClassTooLong \u2014 2368 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), 59 methods, 2 blocks, lines 309-4468. The bar is 400 significant lines; this is 1968 over it, 5.92\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":"src/grain/vm/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b3936ef2ef18dd951507c3972efc097e22731fd94fe0378cf8b33685f62ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 2580 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 2080 over it, 5.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0420f380acc1c74b7a74ed69a8a754d21db29a67e3fc8266ce8b7544a9f1485"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vm/mod.rs: FileTooLong \u2014 2523 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: Vm (2 blocks, 309-4468). The bar is 500 significant lines; this is 2023 over it, 5.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":"src/grain/vm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a010a786dc38d65e126b15e07e628dc478b9f0b95b8210120e90de85a20b7fd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.eval_stmt: MethodTooLong \u2014 eval_stmt runs 465 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 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/stmt.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e509354c27128b2f9ebbc7dad8c921743a74249e104b521486521f58a74c3df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::func::builtin::get_builtin_binary_op_fn: FunctionTooLong \u2014 rhai::func::builtin::get_builtin_binary_op_fn runs 454 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 354 over it, 4.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":"src/func/builtin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2422bf1d006cfa67342715e3f556689422c2005d2cf0a09f297a1d85098249a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.eval_dot_index_chain_raw: MethodTooLong \u2014 eval_dot_index_chain_raw runs 387 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 287 over it, 3.87\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":"src/eval/chaining.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f703bc7871495be5b3c8c72e7533dc3621832bb9880986d1045348a0ae518141"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Dynamic: ClassTooLong \u2014 1487 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), 69 methods, 28 blocks, lines 184-3068. The bar is 400 significant lines; this is 1087 over it, 3.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a347127ff8c55a6868785b78b3abe5f7bd10682a824423e10460502c034b4a19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/dynamic.rs: FileTooLong \u2014 1606 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: Dynamic (28 blocks, 184-3068). The bar is 500 significant lines; this is 1106 over it, 3.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":"src/types/dynamic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f4f00d80b0182a40debfa4df1760dd3894c33d8da08e95cbdb9f1587f6449b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::optimizer::optimize_stmt: FunctionTooLong \u2014 rhai::optimizer::optimize_stmt runs 321 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 221 over it, 3.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"678bbc3550b3e4d87640281d075c9c5314c3ddd6340f2f747f9cdd42daf454b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::func::builtin::get_builtin_op_assignment_fn: FunctionTooLong \u2014 rhai::func::builtin::get_builtin_op_assignment_fn runs 319 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 219 over it, 3.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/builtin.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592fa5d53cbb778233929e5b4be49a80a881df1aefc311ab5c6ca47170011d9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Module: TooManyMethods \u2014 91 methods, declared across 3 files: module/mod.rs (83), api/deprecated.rs (6), definitions/mod.rs (2). The bar is 30 methods; this is 61 over it, 3.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/module/mod.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bd6ed2832c52a10eb113cdb60dd561bca55ceba55aaa0ce1e1db3c6868e6e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowering.lower_statement: MethodTooLong \u2014 lower_statement runs 303 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 203 over it, 3.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"821e5b0d164aa58942070789a0c63adbea7a9fa370092a6d6ec9f7d4cf0d036e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::optimizer::optimize_expr: FunctionTooLong \u2014 rhai::optimizer::optimize_expr runs 289 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 189 over it, 2.89\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":"src/optimizer.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0596dc731f4771f61ca4edf33a23b8a248547a7748a2fbcab6aebb3388d26d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::bin::rhai-dbg::debug_callback: FunctionTooLong \u2014 rhai::bin::rhai-dbg::debug_callback runs 284 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 184 over it, 2.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-dbg.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6270d2ee8007cae2b638bc7772610ed1e503e8d303511261aab7930c45adec49"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lowering: ClassTooLong \u2014 1079 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), 49 methods, 2 blocks, lines 288-2421. The bar is 400 significant lines; this is 679 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4f375ac4070b14bf5efb79783862e6ba92e9f48425ed7afd374f27441177cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module/mod.rs: FileTooLong \u2014 1342 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 75% of them inside a single declaration: Module (9 blocks, 635-2731). The bar is 500 significant lines; this is 842 over it, 2.68\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":"src/module/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"495c258cab84d34ce3b74c7e269465851e82c1ee01144978c9ce8f0e5c87e64b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/mod.rs: FileTooLong \u2014 1317 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 82% of them inside a single declaration: Lowering (2 blocks, 288-2421). The bar is 500 significant lines; this is 817 over it, 2.63\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":"src/grain/compile/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd2d84e351f0c4b6088ebde0f6e61307055902e5d00f5c099185a4c6c66c21b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::grain::bytecode::code::assemble: FunctionTooLong \u2014 rhai::grain::bytecode::code::assemble runs 258 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 158 over it, 2.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":"src/grain/bytecode/code.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"124978031ff41afde5a4bb965e993b52adeeae42618f61ed0e43d183f02464fe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Module: ClassTooLong \u2014 1012 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), 91 methods, 9 blocks, lines 635-2731. The bar is 400 significant lines; this is 612 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/module/mod.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"191edcc5dc2c97e3547d5e6bc5e29d729e67f51c3447054a179210d7b36ae47a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.get_indexed_mut: MethodTooLong \u2014 get_indexed_mut runs 243 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 143 over it, 2.43\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":"src/eval/indexing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99a0d31ad1139686eacbd43b2561bad8240468791d72dbde8f1cae74cd45f36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokenizer.rs: FileTooLong \u2014 1157 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 657 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e6ce6a3be770c87e290c60c6ca6e6c5c1ce31419e503387c84e0190703d8e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dynamic: TooManyMethods \u2014 69 methods, declared across 2 files: types/dynamic.rs (67), api/deprecated.rs (2). The bar is 30 methods; this is 39 over it, 2.30\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":"src/types/dynamic.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1aba340c541d32a289ca65d2df81b0400e65c5bc32a902e9f6dcc6cbd042d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.make_method_call: MethodTooLong \u2014 make_method_call runs 224 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 124 over it, 2.24\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":"src/func/call.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"725c4529403463223b67932b6dfc57b0c6cc8f0e78e451638ac477979cd8ebd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.make_function_call: MethodTooLong \u2014 make_function_call runs 214 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 114 over it, 2.14\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":"src/func/call.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c277c8b5bbed6ce144f284e20a23e09b36fa7a24d82a736491f4a92cb2807cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::bin::rhai-repl::main: FunctionTooLong \u2014 rhai::bin::rhai-repl::main runs 209 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 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-repl.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65b4611fbf12ae2ce9690a64d9681212e5eb80843d19703510e87953b0a5b82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vm: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"722db65e09b1826e9f6fc9e2e945fefb8d7cb7c9bc034cdb6575b481d9158a21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/optimizer.rs: FileTooLong \u2014 965 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 465 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1fb24960ccaf1fa2ffe6d67fd7c9699eecfba3be6631fd2fe85a0c813bf401"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.call_script_fn: MethodTooLong \u2014 call_script_fn runs 166 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 66 over it, 1.66\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":"src/func/script.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f62bd2ca91a0712c1fec7a7e8e6df0ffaab132d0380aa49bf8c9d7a78e6a45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: func/builtin.rs: FileTooLong \u2014 829 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 329 over it, 1.66\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":"src/func/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8d59d87a431b4af9a56e3ad5cc4d20eff1f422c035ee2424bbc072127ca61b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lowering: 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":"src/grain/compile/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15db0b656e37afa40f6f950d29bada2557ff745dda58246ff0bff1b7d8a4067"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.exec_native_fn_call: MethodTooLong \u2014 exec_native_fn_call runs 160 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 60 over it, 1.60\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":"src/func/func_call.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7a3b7b98f373b33779914309648d59489bcccfbaee8ca7df84a83ea8fb577b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::grain::bytecode::code::decode: FunctionTooLong \u2014 rhai::grain::bytecode::code::decode 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":"src/grain/bytecode/code.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f303b03a1c5c363945e9dce7d56f8ad6d03282f27212cd0018e5e313e57f73b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Program: TooManyMethods \u2014 46 methods, declared across 2 files: grain/program.rs (42), format/mod.rs (4). The bar is 30 methods; this is 16 over it, 1.53\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":"src/grain/program.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddeb2ce470d2156dcd69b41cb8a214267b7922e85bce4e49896c8f5542fe084"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/token.rs: FileTooLong \u2014 746 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 246 over it, 1.49\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":"src/types/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851c981a17776f5a74508f085e8ccf53771a8dda031f713f55dbf3d4b3f462de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Vm.walk_chain: MethodTooLong \u2014 walk_chain runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0501db59fa20ee33d760fdd0abe1782a395fa54b344eac64c8722303a3f4b37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packages/array_basic.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 61 free functions. The bar is 500 significant lines; this is 225 over it, 1.45\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":"src/packages/array_basic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7048f48f4de0f252658e7001f8991d1d17c6746d4145a48c33518072bf2e59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.eval_expr: MethodTooLong \u2014 eval_expr runs 143 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 43 over it, 1.43\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":"src/eval/expr.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"941da616e1dffc7db77e3880a3830e3d747b8f5519c0c1d5b737922177473f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: func/call.rs: FileTooLong \u2014 710 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: Engine (24-1135). The bar is 500 significant lines; this is 210 over it, 1.42\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":"src/func/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb44b9a5c0df4dcfed6149cb344607cf7861dbfb29150a00a7fa5e4f546b8d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bytecode/code.rs: FileTooLong \u2014 708 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 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac864e8b694a178ab07e9e46a8a384e85fcc502dd960f4b29182482bed2eda95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packages/string_more.rs: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/string_more.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d87a5b94946192d943185650e1c88c26ce409af9bfa7182b08cc17b53566eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::optimizer::optimize_stmt_block: FunctionTooLong \u2014 rhai::optimizer::optimize_stmt_block runs 139 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 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b44650a88b2ff23eee2633bfd41cc4c5d751362993c9417dfa6a0a4f17e16b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhai::grain::bytecode::verify::verify_chunk: FunctionTooLong \u2014 rhai::grain::bytecode::verify::verify_chunk runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/verify.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f42142e311cd470775dbc7b7f578dcca0618695ef39f83afc9d4f36d1a7288b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dynamic.fmt: MethodTooLong \u2014 fmt runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a982551b3524a0daad1ebe4af319ac579f539ee964c126d617a4a43d20a0c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.make_qualified_function_call: MethodTooLong \u2014 make_qualified_function_call runs 128 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 28 over it, 1.28\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":"src/func/call.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bb52696c8b32e24e45734b017026eaa3c640d3346da548205a5c7af38348b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowering.switch: MethodTooLong \u2014 switch runs 128 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 28 over it, 1.28\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":"src/grain/compile/mod.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f5e62f9f36c8c132235c4b6dbeacc19b8866d187876e510a565001652967b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rhai::packages::blob_basic::blob_functions: 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":"src/packages/blob_basic.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38c96f42aad8fe8302f632894bd710d85f126d346250524e87afd6aca0297af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scope: TooManyMethods \u2014 36 methods, declared across 2 files: types/scope.rs (35), definitions/mod.rs (1). The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/scope.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"266085ac72793422f5e8b7276dd46f7876cf44d84858a089527bccfd8154b52d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/stmt.rs: FileTooLong \u2014 586 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: Engine (13-983). The bar is 500 significant lines; this is 86 over it, 1.17\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":"src/eval/stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1badf2b37cd21a9686ca5aa8aee1717bec92de8186327b4354b98d89d28689a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packages/logic.rs: FileTooLong \u2014 575 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd4660c4b8aa03c03cbaca4f868283ddc5e15d85c8f342456c2cc4d586d93b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dynamic.fmt: MethodTooLong \u2014 fmt runs 115 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 15 over it, 1.15\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":"src/types/dynamic.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3772bf4668efffacf4703d8c249ebaba0cc15f0e1a49017edbb753492df1fa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/stmt.rs: FileTooLong \u2014 573 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 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a4c1cf133207b7cebf30d76a7cd994e57bfecb24d5988d050d4ce53a25ac44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AST: TooManyMethods \u2014 33 methods, declared across 2 files: ast/ast.rs (31), api/deprecated.rs (2). The bar is 30 methods; this is 3 over it, 1.10\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":"src/ast/ast.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"201a93f232e451180a155b8a6b0af3c5131f39672447c3ec0255a2652d7a3852"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.resolve_fn: MethodTooLong \u2014 resolve_fn runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/func_call.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaf275e0f235e7c80ffb2127072ccdaf417a08f2f6da3843f911dff9061eaf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: func/func_call.rs: FileTooLong \u2014 538 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 79% of them inside a single declaration: Engine (242-926). The bar is 500 significant lines; this is 38 over it, 1.08\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":"src/func/func_call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4f51e404a8cc9998500aec595f1f2f1b2f1b99ff64f95042955ca143b02927"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/chaining.rs: FileTooLong \u2014 534 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: Engine (35-817). The bar is 500 significant lines; this is 34 over it, 1.07\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":"src/eval/chaining.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2109b279eed7a8ffa6396d789111cb41c542034d44f5430aa15ef5cc8ed76fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalAltResult.display: MethodTooLong \u2014 display runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/error.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4178a69c46a91c8b12d5a3ae4dabf303158c206fae4b20a5283e3b1d9b281e70"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DynamicSerializer: ClassTooLong \u2014 422 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), 1 methods, 8 blocks, lines 16-681. The bar is 400 significant lines; this is 22 over it, 1.06\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":"src/serde/ser.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"95428668a49d0436ff9af0dd517d92547025295d66d8e521f75c667122f11ef0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/deprecated.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api/deprecated.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c6bc928448fcd740bf6e0cf9a4ce4e44e5535b74a1bad18402213ec338f92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lowering.expression: MethodTooLong \u2014 expression runs 104 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 4 over it, 1.04\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":"src/grain/compile/mod.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a0c1ee655e6492580209b63e7765fc9c004236c16d6bacc33df1ffe4d172d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/expr.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d93c92ae41740a9e9f29c95f9ced6240ab1edb0c1ab1e4d905047708ffff7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: func/native.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/native.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fba1478eec2f5cde07669200409f2c4e91b06f0824be6449e684df1d340baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (66 shared lines): src/packages/array_basic.rs:1633-1707 | src/packages/array_basic.rs:1732-1830 \u2014 These two members are variants of one another: 66 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46da67d80925520e392cb29ca85251210a4435369c03a15cc5a5b7d8294f9f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): src/types/dynamic.rs:484-634 | src/types/dynamic.rs:640-813 \u2014 These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f14c9f0f11d8b7a6e9cbc0d3d060a82a7e7ae3f806723798502c255ad128e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): src/packages/logic.rs:234-251 | src/packages/logic.rs:253-270 | src/packages/logic.rs:272-289 | src/packages/logic.rs:291-308 | src/packages/logic.rs:310-327 | src/packages/logic.rs:329-346 | src/packages/logic.rs:348-365 | src/packages/logic.rs:367-384 | src/packages/logic.rs:386-403 | src/packages/logic.rs:405-422 | src/packages/logic.rs:424-441 | src/packages/logic.rs:443-460 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"923d515ab1333849b432c7b1d464769038fa1c16228f0753663b40b968497d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): src/packages/logic.rs:510-527 | src/packages/logic.rs:529-546 | src/packages/logic.rs:548-565 | src/packages/logic.rs:567-584 | src/packages/logic.rs:586-603 | src/packages/logic.rs:605-622 | src/packages/logic.rs:624-641 | src/packages/logic.rs:643-660 | src/packages/logic.rs:662-679 | src/packages/logic.rs:681-698 | src/packages/logic.rs:700-717 | src/packages/logic.rs:719-736 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb00110655bc4a5e9a2dd5f69b7a69646fa9194f679d72651e2732c698fea3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/func/native.rs:314-336 | src/func/native.rs:348-371 | src/func/native.rs:382-404 | src/func/native.rs:420-443 \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":"src/func/native.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8004c61f86f3f170fd59c9074fff23047f56008f7d71a7db7542f6057ca670c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/module/mod.rs:1993-2018 | src/module/mod.rs:2024-2051 | src/module/mod.rs:2056-2098 | src/module/mod.rs:2111-2153 \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":"src/module/mod.rs"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d037bfce6a3d05ce8df9df846706c1c495bc06306123462a3f7dd10a480d870"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/serde/deserialize.rs:115-130 | src/serde/deserialize.rs:132-147 | src/serde/ser.rs:208-223 | src/serde/ser.rs:226-241 \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":"src/serde/deserialize.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5e07cd9117ca0bdf7a4e6243697e8d52c6776e5deec85c325ee5670dc91387"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/packages/math_basic.rs:463-476 | src/packages/math_basic.rs:480-493 | src/packages/math_basic.rs:497-510 | src/packages/math_basic.rs:514-527 \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":"src/packages/math_basic.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f74d7bfac8431705b86c69e77ce0650f6293cb8195da074b423c1600903defe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201360 lines \u00D7 2): src/tokenizer.rs:74-133 | src/tokenizer.rs:194-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"445742fd5a1dd0f4a785cb1222a20e1f232bd49170e574f7cc70e14437bd41c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/types/error.rs:487-519 | src/types/error.rs:549-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/error.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7b056bef3b49484eb58a729f47ad552ee18979e88ddc942eb3e69dc0e21a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/packages/string_more.rs:646-672 | src/packages/string_more.rs:726-752 \u2014 both copies are in the same file, so extract the block 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":"src/packages/string_more.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49813c792d3056ca7db1bc275dc555c727d78f0e7888ce54c99219a540a8abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/packages/string_more.rs:1282-1304 | src/packages/string_more.rs:1353-1374 \u2014 both copies are in the same file, so extract the block 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":"src/packages/string_more.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bf21ffb9b88a2ba9836e650449cc58181ac98896c68813ad5e97a48028bf3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): codegen/src/lib.rs:349-370 | codegen/src/lib.rs:380-401 | codegen/src/lib.rs:411-432 \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":"codegen/src/lib.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d67e6090707ab6b5f0f493f8b37c6ef2441b474eb7db3d0863de8501d21436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/serde/deserialize.rs:43-63 | src/serde/ser.rs:134-154 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca02bd3dde741d8514bd577a3014d65d178c09493c233fa3f44daab5d20c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/packages/map_basic.rs:428-448 | src/packages/map_basic.rs:492-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/map_basic.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9f380c07f409d34494c4e3d90617c5d609c59d33e40b228df6b46b839a2007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/func/script.rs:115-134 | src/func/script.rs:194-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/script.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f193227a21d1b5881889764671d12ab4ff3fa09a18e2e499942ccc3bb79cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/types/dynamic.rs:549-568 | src/types/dynamic.rs:717-736 \u2014 both copies are in the same file, so extract the block 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":"src/types/dynamic.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930bf7c916471db7f7e0cd9b36e8fe21622ee8d7b80c2395e99151d64ff15ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/parser.rs:650-668 | src/parser.rs:718-736 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf42219d428c036122272415ab07c5479aa54d149b93a6155d62d3a187dd6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/packages/array_basic.rs:1634-1651 | src/packages/array_basic.rs:1733-1750 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"780808aba47c24cd7a157bb89a49c2b6c05ee9d7e122f1257a02e0468418e7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/grain/vm/mod.rs:2749-2769 | src/grain/vm/mod.rs:2825-2841 \u2014 both copies are in the same file, so extract the block 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":"src/grain/vm/mod.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c837f5c8e51f40a155bbabab02f0bf99e318ffe0f4bf0016c0d68e6aa69ae24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/parser.rs:3338-3354 | src/parser.rs:3785-3801 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"243f113390023efe60c3341d57cb58eb50357cda2ffdc91574f5a986ccecbc3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/serde/deserialize.rs:66-82 | src/serde/ser.rs:158-174 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"837b8892f9f0bae2744e4f399c0b6a596c12282d2437885ae850f9194290b38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/eval/data_check.rs:35-51 | src/eval/data_check.rs:77-93 \u2014 both copies are in the same file, so extract the block 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":"src/eval/data_check.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a03efc6fc72ff59b59248f5a2e50404bea3c82efabc47370cd65e8412e8dc16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/func/hashing.rs:100-115 | src/func/hashing.rs:138-152 \u2014 both copies are in the same file, so extract the block 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":"src/func/hashing.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0816c23db371d0664e4285bd36b6dd3b7e2ce70d2b77bef98e1856dc29a350e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/module/mod.rs:1996-2011 | src/module/mod.rs:2029-2044 \u2014 both copies are in the same file, so extract the block 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":"src/module/mod.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ae1148588e94e1fcb2456736c618c4ea8f75e334631a31128a9fbfb817bf1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/optimizer.rs:1158-1173 | src/optimizer.rs:1194-1209 \u2014 both copies are in the same file, so extract the block 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":"src/optimizer.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b95d806a0fc319baf25f620ccee56b90d07744be2fb19ba049768e239d4c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): src/parser.rs:2243-2254 | src/parser.rs:2297-2312 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd40ed74d0056c8be04e4e57d178291213bf077b84980020c8106e95c8c6bee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/types/dynamic.rs:592-607 | src/types/dynamic.rs:759-774 \u2014 both copies are in the same file, so extract the block 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":"src/types/dynamic.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7855b5a51d0f126efa2e82ed5204cb747dea9c190e669c75f4b3b2eda38992a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bin/rhai-dbg.rs:185-200 | src/bin/rhai-repl.rs:142-157 \u2014 before extracting anything, compare \u0060src/bin/rhai-dbg.rs\u0060 and \u0060src/bin/rhai-repl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"src/bin/rhai-dbg.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67edb8de9e89612f6d5c4ffd1007333c2abf0106e0b8918da57ed6ef37df926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/packages/string_more.rs:957-972 | src/packages/string_more.rs:1110-1125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/string_more.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c03d18797632e30736548dee365e8763b2eb14c92b3582bfa6b9865cdc071c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): src/eval/chaining.rs:446-459 | src/eval/chaining.rs:656-670 | src/eval/chaining.rs:780-794 \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":"src/eval/chaining.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6629259191ec4d55053134cefb1f08c6d9861fda8f4ef4e907809890382450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser.rs:624-638 | src/parser.rs:1829-1843 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d230d3dbba35cae57c930f8f1ae5d3aea422688f20e2cf109980513eda64ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/serde/deserialize.rs:152-166 | src/serde/ser.rs:245-259 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e704038f94c58742f187c431124d1f438b9524926552115308af42c088c007b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/serde/deserialize.rs:170-184 | src/serde/ser.rs:263-277 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe12ddca845747c9f611d75a6b829d174303af25c0fbe4de94e820d60f3f9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/bin/rhai-dbg.rs:88-102 | src/bin/rhai-repl.rs:15-29 \u2014 before extracting anything, compare \u0060src/bin/rhai-dbg.rs\u0060 and \u0060src/bin/rhai-repl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"src/bin/rhai-dbg.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"734cd95736f1e42140fd1b823a47a080fe2a3ae0f25e92d11c6a9f67df3c3ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/packages/bit_field.rs:134-148 | src/packages/bit_field.rs:230-244 \u2014 both copies are in the same file, so extract the block 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":"src/packages/bit_field.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"076e9cbe20330f8bae6102987872c981f94e25719230de1da2c6a3e243be0612"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/packages/map_basic.rs:412-426 | src/packages/map_basic.rs:476-490 \u2014 both copies are in the same file, so extract the block 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":"src/packages/map_basic.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89d4e6bb205ea7497a06762ad030c1bc820b3c94606933f3c6d8ec7eccc208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/module/mod.rs:2005-2018 | src/module/mod.rs:2038-2051 | src/module/mod.rs:2085-2098 | src/module/mod.rs:2140-2153 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/module/mod.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c182b40a51fa67bf6ea8fa95f5e6309b033be4c6a1e5f3ac0d74aae9df465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegen/src/lib.rs:251-264 | codegen/src/lib.rs:285-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c94ea35a3e2bbcf08902db3a3d9b7df36d0169cd6ea595c120e671e490bebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/func/native.rs:654-667 | src/func/native.rs:696-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/native.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93396659b73740c000d16eb805add0bdae5156814d7f60fbdb36606bbddaa35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/grain/vm/mod.rs:442-453 | src/grain/vm/mod.rs:490-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":"src/grain/vm/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d06e1ed46129b494364c8e7fa7b99ecd1cbb8af091dbe6add37cc1d2d6e87b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/parser.rs:3185-3197 | src/parser.rs:4046-4059 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":3185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8237f7b0b5ef48b399aff73ab34b6d71aad0b8767f51d86274f683483d1013a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serde/deserialize.rs:101-113 | src/serde/ser.rs:193-205 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f273644f39100e62d8f5a392f6c4992de588c949794d867938cf98fb9b6f921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serde/deserialize.rs:116-128 | src/serde/ser.rs:209-221 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41f92215339bf094d7ecc8d344fe141671a2e8c143e31e27d07cf719ba0b89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serde/deserialize.rs:133-145 | src/serde/ser.rs:227-239 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"43347de0cdc028b895f97c76cd4c3ff31ead0aa6132bfbf8238c932a97acd02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serde/ser.rs:616-628 | src/serde/ser.rs:655-667 \u2014 both copies are in the same file, so extract the block 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":"src/serde/ser.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"812b7a639bd7ab14925b84151f6ab892d9d9e69cae8a89d0461797e23e525c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/func/builtin.rs:59-71 | src/types/dynamic.rs:1232-1244 \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":"src/func/builtin.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d405ae0728ec479334e183d22d5af628275b524ab810e53bfe323b5f17799b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/packages/array_basic.rs:221-233 | src/packages/blob_basic.rs:329-341 \u2014 before extracting anything, compare \u0060src/packages/array_basic.rs\u0060 and \u0060src/packages/blob_basic.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"10490985f2fae45544b5f2c8fee2f21a0277666be1cfab873564a1c1bd05bc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/api/deprecated.rs:972-984 | src/api/deprecated.rs:1043-1055 \u2014 both copies are in the same file, so extract the block 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":"src/api/deprecated.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d09ff2bbfd856d3968f95325869acc390702043f9020a6662803d791487c995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/packages/array_basic.rs:1695-1707 | src/packages/array_basic.rs:1818-1830 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc33fc58d28870badfcb98b2ab75541d00a3a97ad1d6e894a732160854d0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/func/builtin.rs:275-287 | src/func/builtin.rs:799-811 \u2014 both copies are in the same file, so extract the block 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":"src/func/builtin.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ebec3aedb64eb79eac600ac36a30780d70809711aea93f7594ad640394b39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/func/native.rs:325-336 | src/func/native.rs:360-371 | src/func/native.rs:393-404 | src/func/native.rs:432-443 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/native.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e53bca416dca92bc8be23fa754eea2c94ddc04c899867fb1c15d987d93a1b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/packages/logic.rs:316-327 | src/packages/logic.rs:335-346 | src/packages/logic.rs:392-403 | src/packages/logic.rs:411-422 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"369c9ffe68a8f0ae85fc5b77e86ae77bac5d381f3cac92872bf3ead1c2f6f855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/packages/logic.rs:354-365 | src/packages/logic.rs:373-384 | src/packages/logic.rs:430-441 | src/packages/logic.rs:449-460 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7071c883185b6797387c29681517a2b6bd94dc3b5bd1ce750a3f9b33fe780a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/packages/logic.rs:592-603 | src/packages/logic.rs:611-622 | src/packages/logic.rs:668-679 | src/packages/logic.rs:687-698 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e074175e96b70a8986b5ff48b6f45ab51e3004ea2301408069838317849483b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/packages/logic.rs:630-641 | src/packages/logic.rs:649-660 | src/packages/logic.rs:706-717 | src/packages/logic.rs:725-736 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"316259d12c29071bb2379a35bbae0bda7636208d549ab35b1b2a108fe5754d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/parser.rs:632-643 | src/parser.rs:700-711 | src/parser.rs:1837-1848 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c66ee83a035c7db27b1843c110d276d85ab511e853bf98f7ecd9d447deb4f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/api/eval.rs:209-220 | src/api/eval.rs:322-333 | src/api/eval.rs:356-367 \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":"src/api/eval.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72d06fbeca9ff09543133ffe974da9c11e05d77dc31ecbd87901fa4d4e971ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/packages/array_basic.rs:811-822 | src/packages/array_basic.rs:903-914 | src/packages/array_basic.rs:2267-2278 \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":"src/packages/array_basic.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a3476cded7f50ed1fc533e9929e18d11acc057cfe404ce0e75435aefc04d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/parser.rs:2129-2139 | src/parser.rs:2184-2195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2599ad2fcc716fde9bda7a6f28525e6a23abb646a4fab709218401c046a455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/serde/ser.rs:500-511 | src/serde/ser.rs:535-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serde/ser.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8790226750d0a2134d2caacec38b3b0ab2e9299494ce2bda79e546a39ce30880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/packages/logic.rs:240-251 | src/packages/logic.rs:259-270 \u2014 both copies are in the same file, so extract the block 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":"src/packages/logic.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"485cdf880b6d10aa74a40508e48ee2a4c8086d028e2b3f2de007222529812aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/packages/logic.rs:278-289 | src/packages/logic.rs:297-308 \u2014 both copies are in the same file, so extract the block 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":"src/packages/logic.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"665bf966ab785baf9c459e07c069c691be28ad43e4bd6a56b89aed650ac30a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/packages/logic.rs:516-527 | src/packages/logic.rs:535-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/logic.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"84553bca21e9470118a4fa50fa8e4ac22e2bda477e22f8e5ac9eafccb6d81f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/packages/logic.rs:554-565 | src/packages/logic.rs:573-584 \u2014 both copies are in the same file, so extract the block 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":"src/packages/logic.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f63c1fb1aa493ed411d19003cdeebfa4e828e98c0aae87faea29583ae4b05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhai-dbg.rs:409-420 | src/bin/rhai-dbg.rs:432-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhai-dbg.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e9cb867c6bd506c0afe37eda4fa55c23f3af52ef48ed27d96916671285d772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/packages/logic.rs:238-248 | src/packages/logic.rs:257-267 | src/packages/logic.rs:352-362 | src/packages/logic.rs:371-381 | src/packages/logic.rs:428-438 | src/packages/logic.rs:447-457 \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":"src/packages/logic.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf6731bf85d0ac5c7ac8ff9a79bbd6edd83c8abf4e3aabeb94b71c63a1d7fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/packages/logic.rs:276-286 | src/packages/logic.rs:295-305 | src/packages/logic.rs:314-324 | src/packages/logic.rs:333-343 | src/packages/logic.rs:390-400 | src/packages/logic.rs:409-419 \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":"src/packages/logic.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44516605f818d6101d9d8b6affa91f65497ca2598ec813eed5418ec13e1d677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/packages/logic.rs:514-524 | src/packages/logic.rs:533-543 | src/packages/logic.rs:628-638 | src/packages/logic.rs:647-657 | src/packages/logic.rs:704-714 | src/packages/logic.rs:723-733 \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":"src/packages/logic.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bd90e9e1075597ac851c55cc5ec42b5b7ade0bf30b6f9e6348d5a3fce208f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/packages/logic.rs:552-562 | src/packages/logic.rs:571-581 | src/packages/logic.rs:590-600 | src/packages/logic.rs:609-619 | src/packages/logic.rs:666-676 | src/packages/logic.rs:685-695 \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":"src/packages/logic.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76261791b3ce5e1f7bcfd1a5740403cfaede3b0db23a42349c079eb3d186602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): src/eval/chaining.rs:276-286 | src/eval/chaining.rs:332-342 | src/eval/chaining.rs:400-410 | src/eval/chaining.rs:470-480 | src/eval/chaining.rs:498-508 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/chaining.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e0ca942bb3b6cd080a0bad71fd71ddc6382083ff8519a057a2a33f32eacbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/bin/rhai-dbg.rs:408-418 | src/bin/rhai-dbg.rs:431-441 | src/bin/rhai-dbg.rs:454-464 \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":"src/bin/rhai-dbg.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"540a120f5486e0b73d7557834d38993607979a209144be8d8098f028530d9ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/ast/stmt.rs:575-585 | src/ast/stmt.rs:605-615 \u2014 both copies are in the same file, so extract the block 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":"src/ast/stmt.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7429b389c6185005c99958d0c84bdf1fc7280131ff205e6b5e080c9147fff2ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/eval/target.rs:228-238 | src/eval/target.rs:266-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/target.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80969c19b8f90a46706ab2f137c0fc4afe8cbb229a40fbdcd7fcd8a63c25ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/module/resolvers/collection.rs:160-170 | src/module/resolvers/collection.rs:182-192 \u2014 both copies are in the same file, so extract the block 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":"src/module/resolvers/collection.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55f0c0cf5d068270a85b16d0327b2b0884a4c93a5461da38580a9dfa5035d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/parser.rs:992-1002 | src/parser.rs:1125-1134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f633ab10057282eef30043f1e8a1e1d8e396b96c56260c2452d7d21a65440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser.rs:2170-2180 | src/parser.rs:2205-2215 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6dcaaaa67b47eed306340408487a33969ae06160922a6dc64d92e92a531401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tokenizer.rs:1239-1249 | src/tokenizer.rs:1296-1306 \u2014 both copies are in the same file, so extract the block 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":"src/tokenizer.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"706df78cf6ed917a5a8fe7ef7fe224575e7d36dc76527fcfd16bf7a7daf92827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/types/dynamic.rs:610-620 | src/types/dynamic.rs:777-787 \u2014 both copies are in the same file, so extract the block 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":"src/types/dynamic.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd650ff6ad8a1220610ebb8fa9bc7e3ba2d9e46e91e55a2f44878c635d80bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/packages/string_more.rs:941-951 | src/packages/string_more.rs:1092-1102 \u2014 both copies are in the same file, so extract the block 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":"src/packages/string_more.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2755a62a731544b3f95967bc3a7a43147fee95ea4e04f1384f5c08f93f63384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/packages/math_basic.rs:464-473 | src/packages/math_basic.rs:481-490 | src/packages/math_basic.rs:498-507 | src/packages/math_basic.rs:515-524 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/math_basic.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"113494ea1abe3772bc2dcd574e7a533bcfeba920bfc6002271e5f3cead869516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/serde/ser.rs:461-470 | src/serde/ser.rs:497-506 | src/serde/ser.rs:532-541 \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":"src/serde/ser.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e14e7766c5b08d273b4ca832a047ad31c3e02ef747374b0bbc5e0c087dec652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/eval/chaining.rs:146-155 | src/eval/chaining.rs:176-184 \u2014 both copies are in the same file, so extract the block 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":"src/eval/chaining.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4593f62206191ff046e741bee726e4c16a3546bbb0715906a1b3c89a785a5115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/func/func_call.rs:293-302 | src/func/func_call.rs:315-324 \u2014 both copies are in the same file, so extract the block 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":"src/func/func_call.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"11431daaec5fed8522124603d82fb615563af1c87948778f517f68e896e9408e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/grain/bytecode/op.rs:863-872 | src/grain/bytecode/op.rs:875-884 \u2014 both copies are in the same file, so extract the block 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":"src/grain/bytecode/op.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee16f959615df1b24dfa376bcea1b80174f75f3999c9026168070b2203c1ad13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/grain/compile/mod.rs:688-697 | src/grain/compile/mod.rs:732-741 \u2014 both copies are in the same file, so extract the block 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":"src/grain/compile/mod.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"26470f2533ba5a16292cff7d575ba68b324f69dc9fe3e0a11ab3b41e0274a778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/grain/vm/mod.rs:2466-2475 | src/grain/vm/mod.rs:2488-2497 \u2014 both copies are in the same file, so extract the block 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":"src/grain/vm/mod.rs"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60c2d59bfabcf7affec672678b4f4d8b59602d94c0e35f5f0d39cb1470b6ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/grain/vm/mod.rs:2464-2473 | src/grain/vm/mod.rs:2478-2487 \u2014 both copies are in the same file, so extract the block 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":"src/grain/vm/mod.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eab3559a33f1c09be532717a65bcf893420f9fa156c785b7a10c20f10d65e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/serde/ser.rs:515-524 | src/serde/ser.rs:550-559 \u2014 both copies are in the same file, so extract the block 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":"src/serde/ser.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec05169db878eda3c4e884513a87dced48ac59ae72d8400d925070205f185d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/serde/ser.rs:632-641 | src/serde/ser.rs:671-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serde/ser.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4aef4d343b4ddf38bf31e8c78d3c579acd81bd721db23917cdd245fd451c068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/packages/string_more.rs:1319-1328 | src/packages/string_more.rs:1396-1405 \u2014 both copies are in the same file, so extract the block 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":"src/packages/string_more.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"917dfa68cd6504a42f03ffcd42681ae9065c540753465b4ba4ebd3ee4b11c266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/func/builtin.rs:545-554 | src/func/builtin.rs:587-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/builtin.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"011c8a3de276c6d85d63662b1d610aab18fa708d501af3f2f328d777caae0e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/packages/logic.rs:257-265 | src/packages/logic.rs:295-303 | src/packages/logic.rs:333-341 | src/packages/logic.rs:371-379 | src/packages/logic.rs:409-417 | src/packages/logic.rs:447-455 \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":"src/packages/logic.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f2db25503c1df6e3adc4bcf4aec4201004c99467cd74c7436c6435d7014ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/packages/logic.rs:533-541 | src/packages/logic.rs:571-579 | src/packages/logic.rs:609-617 | src/packages/logic.rs:647-655 | src/packages/logic.rs:685-693 | src/packages/logic.rs:723-731 \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":"src/packages/logic.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9d0953e1ebc8f610eb017c1a95d2fc73981b61349240ef888a06fe426e3fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/eval/chaining.rs:336-344 | src/eval/chaining.rs:404-412 | src/eval/chaining.rs:474-482 | src/eval/chaining.rs:630-638 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/chaining.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbba7a0ee07109f1bea11ee7a0d9160dfb2e9d16d7fbe16bf46e2df976551c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/serde/deserialize.rs:122-130 | src/serde/deserialize.rs:139-147 | src/serde/ser.rs:215-223 | src/serde/ser.rs:233-241 \u2014 before extracting anything, compare \u0060src/serde/deserialize.rs\u0060 and \u0060src/serde/ser.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 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":"src/serde/deserialize.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"de05cc14a5c595331711848356a5ab0ccc1407f1424bc04aa096372696e2f9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/ast/stmt.rs:655-661 | src/ast/stmt.rs:687-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":"src/ast/stmt.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"110bf1fc900148b58b8ab44ab2057b3bd0e368d17346dcd1938ba09f5ecd33b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/optimizer.rs:477-485 | src/optimizer.rs:488-496 \u2014 both copies are in the same file, so extract the block 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":"src/optimizer.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc4a23b49eabfdf3742381011348318185f2b0a0a59072f7abb30bacfa3b371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/types/dynamic.rs:570-578 | src/types/dynamic.rs:738-746 \u2014 both copies are in the same file, so extract the block 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":"src/types/dynamic.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e63ce1b943b3d95cff93b44915d6e32473f458ffb6acb1435f7b741e706fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/func/builtin.rs:70-78 | src/types/dynamic.rs:1254-1262 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/builtin.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"83178c001bcc8716454b7a99e713c1de837941c62b2286261ff5fc9942aa0bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/eval/eval_context.rs:273-280 | src/eval/eval_context.rs:320-327 | src/types/fn_ptr.rs:293-300 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/eval_context.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efcef7bb3243862ce993805348429ebb9a2e4c66f8e2ee34292b4ca85c26961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/packages/array_basic.rs:1751-1758 | src/packages/array_basic.rs:1801-1808 | src/packages/array_basic.rs:1813-1820 \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":"src/packages/array_basic.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"abca1a511b00158fb3c1673245abce75b10907f067000682b1ccc1ce9e6329a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/ast/expr.rs:546-553 | src/ast/expr.rs:603-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/expr.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7833d94a3c3169096411bdf9c087c751415f8cd5ff93e4493554410dc44bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/func/func_call.rs:548-554 | src/func/func_call.rs:805-812 \u2014 both copies are in the same file, so extract the block 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":"src/func/func_call.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3c698a6a3983c9727ac6a7396c8fc939f2b4a80fb8b45b824c341f5de3159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser.rs:2576-2583 | src/parser.rs:2585-2592 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a200c55e2584b352afdf15a0f5b4ed8b8b3a7f339552bf9ceb1cf7054fe0ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser.rs:3657-3664 | src/parser.rs:3825-3832 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":3657}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ac8e144996cb0f575fcd3e36a1422da357abe276decae7f1ac8dc9d14bcfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/types/fn_ptr.rs:278-285 | src/types/fn_ptr.rs:318-325 \u2014 both copies are in the same file, so extract the block 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":"src/types/fn_ptr.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7aec8612623c8222cd652c6a654f37b33ce0ff3bbfe33fab70adf878297ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhai-repl.rs:36-43 | src/bin/rhai-run.rs:19-26 \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":"src/bin/rhai-repl.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"45518e42b3bb532a0b03c88235282d4c9e85b6df4c3593f72824abe0eb0fded8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/packages/string_more.rs:1591-1597 | src/packages/string_more.rs:1671-1678 \u2014 both copies are in the same file, so extract the block 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":"src/packages/string_more.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2eab2c1d0ef9428a2baeed298da025a9a2500e976b43f996334fd71f76b287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/packages/array_basic.rs:1678-1685 | src/packages/array_basic.rs:1793-1800 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c18c788021040d22a12352e8751c677d7bc4b0985733e3a4d11daa3a1f3473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/func/builtin.rs:599-606 | src/func/builtin.rs:610-616 \u2014 both copies are in the same file, so extract the block 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":"src/func/builtin.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7d176dbaea35e05d902daa6a554162b5513dc76d1a4f63159e902d97a4dc5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegen/src/lib.rs:243-249 | codegen/src/lib.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":"codegen/src/lib.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7d5758a3e1ce71778a47cdf4cde6a5a8532ee4063a1a6cfd1d8a3adbb9417a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/api/definitions/mod.rs:404-410 | src/api/definitions/mod.rs:418-424 \u2014 both copies are in the same file, so extract the block 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":"src/api/definitions/mod.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261cf4100e8de2498b9f38db30fdbb5d92e3090bc8626014c81a484934687b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/func/function.rs:123-129 | src/func/function.rs:137-143 \u2014 both copies are in the same file, so extract the block 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":"src/func/function.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b465ac0a307013b464df9259f789610a9a6a6ef8e7de34ee8feabd29759a975b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser.rs:1527-1533 | src/parser.rs:1602-1608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d1b64d39f48a5cdbbba53fd3ea97ffac3fd90cc86117c75460c54039263b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/types/dynamic.rs:505-511 | src/types/dynamic.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types/dynamic.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f41e1c313d65aba86df1cd2d94301974e05309cb756a8461bb5c922a3134f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/api/eval.rs:124-130 | src/api/run.rs:58-64 \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":"src/api/eval.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94011c5ffa6893e912829bdf92bfabf876bbfbed924033b49e089d2dfbfb56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/packages/array_basic.rs:1653-1659 | src/packages/array_basic.rs:1756-1762 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf351e6af9132da7e1e44a564b0e5c493f5aab2fb318eefb0ce181e4cf05388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/packages/array_basic.rs:1661-1667 | src/packages/array_basic.rs:1768-1774 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9905fd85c01e2fc6f4de242d19ebf40188a9603865fdf468a617aad033915e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/packages/array_basic.rs:1687-1693 | src/packages/array_basic.rs:1806-1812 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"858e4821089234ef002924e98d0058e2121a757199ebcbe6bc2dbf6cfc98bbf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/func/builtin.rs:296-302 | src/func/builtin.rs:820-826 \u2014 both copies are in the same file, so extract the block 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":"src/func/builtin.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e23e65510d097625ebce9be8552c4bbcbeb521172794909c3613b0c80b1d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/func/builtin.rs:404-410 | src/func/builtin.rs:539-545 \u2014 both copies are in the same file, so extract the block 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":"src/func/builtin.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c466c9f12ce1a46640dfa1c6d1ab44061776b302fc6b72a376c7a38d16e50c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/eval/chaining.rs:329-334 | src/eval/chaining.rs:397-402 | src/eval/chaining.rs:495-500 | src/eval/chaining.rs:625-630 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eval/chaining.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb45c6b6d6d0b0ebe816700122f2831b9be9192369f58c9ea8c979ce2701f05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/types/dynamic.rs:505-510 | src/types/dynamic.rs:673-678 | src/types/dynamic.rs:1228-1233 \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":"src/types/dynamic.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4fb2133ff8844ea8e6c77972f762a977251414f447a97035d9d94c0aba56b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/grain/compile/mod.rs:569-574 | src/grain/compile/mod.rs:597-602 \u2014 both copies are in the same file, so extract the block 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":"src/grain/compile/mod.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2299a33d2bfab2fbc908defb3013f27bc61223809abc44cd0d22dbbcc95c34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/types/dynamic.rs:1875-1880 | src/types/dynamic.rs:1978-1983 \u2014 both copies are in the same file, so extract the block 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":"src/types/dynamic.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"80503ebc36c7bb64354c8b073366a9eca8d19da8ff41e52c6b4a978539840a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/packages/array_basic.rs:1670-1675 | src/packages/array_basic.rs:1781-1786 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d38aaf636ef49cbb33fe0ed84c9d7f2e2226efbf13792e01f5b000060b04ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/func/builtin.rs:308-313 | src/func/builtin.rs:832-837 \u2014 both copies are in the same file, so extract the block 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":"src/func/builtin.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef9d7fac14bfffd144521c9ee9cc01eaba6b1271a32db793ff0a53e61a7bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/ast/ast.rs:498-502 | src/ast/ast.rs:592-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ast/ast.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6294934063765572481c05dfa802dd66c3d9930079207f1cc1c488daac9edb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/func/native.rs:349-353 | src/func/native.rs:421-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/native.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d99e497f08e442ded51604b3ac34f0519838235c19fa06ab6af08aeb84e63f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/optimizer.rs:575-579 | src/optimizer.rs:632-636 \u2014 both copies are in the same file, so extract the block 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":"src/optimizer.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdf2383839e8d754290f8771d2c2534d93e4dd36a275f7862002ba7050fd7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/optimizer.rs:984-988 | src/optimizer.rs:1088-1092 \u2014 both copies are in the same file, so extract the block 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":"src/optimizer.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e2abd9ee588de0c4fea96e1fbf9b8a1bf9d39766c70abea35b56bff64772f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser.rs:3591-3595 | src/parser.rs:3608-3612 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":3591}}}],"partialFingerprints":{"codehealthFindingId/v1":"003041948d906611b38e14b26670454daeb5fa8887bb7e055d18a8131f5ea45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): src/func/builtin.rs:178-179 | src/func/builtin.rs:190-194 | src/func/builtin.rs:212-216 \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":"src/func/builtin.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"424eb30061c258ef46f7fbca9c95f346da049a4f9331f7040744504f46f2cc0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/grain/format/mod.rs:387-397 | src/grain/pos/varint.rs:71-81 \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":"src/grain/format/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcac0a9bc2724486cfd0ceadc9c85f735e74b434983dec1ce850abfacd6fe99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/packages/array_basic.rs:164-174 | src/packages/blob_basic.rs:262-272 \u2014 before extracting anything, compare \u0060src/packages/array_basic.rs\u0060 and \u0060src/packages/blob_basic.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"663cd9922291bb6130cb372f123de30964a2955896d2b460f0d805deb0f4f136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/packages/array_basic.rs:459-463 | src/packages/blob_basic.rs:574-578 \u2014 before extracting anything, compare \u0060src/packages/array_basic.rs\u0060 and \u0060src/packages/blob_basic.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"840c030016519faea110d9c217ed8fdc689d3dcd9d665677b535fda3bbaca023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/packages/array_basic.rs:530-534 | src/packages/blob_basic.rs:647-651 \u2014 before extracting anything, compare \u0060src/packages/array_basic.rs\u0060 and \u0060src/packages/blob_basic.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96dd4465843cefe2945fbcb329286a7af8de486efd19e21b5d3976d5e240e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/packages/array_basic.rs:547-551 | src/packages/blob_basic.rs:666-670 \u2014 before extracting anything, compare \u0060src/packages/array_basic.rs\u0060 and \u0060src/packages/blob_basic.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packages/array_basic.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e216a9b1fbbc29b009199eae790cc02f96854699ba59dbdc8a6ca1fbf70ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/packages/array_basic.rs:188-200 | src/packages/map_basic.rs:160-171 \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":"src/packages/array_basic.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c99e34aaad211fe6d6e4c3c6538941f1f4b9d13e2c285047b0a9d5bc2854c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/grain/vm/mod.rs:4097-4110 | src/grain/vm/mod.rs:4126-4132 \u2014 both copies are in the same file, so extract the block 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":"src/grain/vm/mod.rs"},"region":{"startLine":4097}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f55c73b183c013f8b6886b0beb54bfcead173937d92feeacf7d591e593902b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegen/src/custom_type.rs:148-159 | codegen/src/custom_type.rs:164-173 \u2014 both copies are in the same file, so extract the block 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":"codegen/src/custom_type.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3235512744679270f94f4c2dccc0efba512d80e638596a5365bd2718d04d6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser.rs:802-810 | src/parser.rs:842-851 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e421b4cafe080bd9aab242a5dc122f04ba82beddc0f85cb569b32763ad8cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/func/func_call.rs:727-736 | src/func/func_call.rs:752-761 \u2014 both copies are in the same file, so extract the block 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":"src/func/func_call.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"060bc33da40e484a20b1c0ad11f3ea726c78e11597c122e3b3d36e03c023f2ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/ast/expr.rs:303-311 | src/ast/expr.rs:316-324 \u2014 both copies are in the same file, so extract the block 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":"src/ast/expr.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d93d64b447c47a06eb11c8f35f739a9e7d10da103a510b31383721efccfb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser.rs:2613-2621 | src/parser.rs:2652-2658 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22cb39982f854a7af49355fe5f8230d2cbb8e68bd6fb3f5bdb9607753d90877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/func/func_call.rs:691-699 | src/func/func_call.rs:708-716 \u2014 both copies are in the same file, so extract the block 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":"src/func/func_call.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"012022856a15bdf1cf3d10933a0b5a98b4f7696846685f43c1f9cc16e70f4eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/packages/time_basic.rs:126-134 | src/packages/time_basic.rs:150-158 \u2014 both copies are in the same file, so extract the block 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":"src/packages/time_basic.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7528a9430e7e586dad6a4773b076db7baba45b07fad6b67521f4c9a70ee46d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhai-dbg.rs:171-179 | src/bin/rhai-repl.rs:126-134 \u2014 before extracting anything, compare \u0060src/bin/rhai-dbg.rs\u0060 and \u0060src/bin/rhai-repl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"src/bin/rhai-dbg.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9539a03710c04243a142f5ba509cc26991b42a2ebfcb35fb5564bf58a8532370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhai-dbg.rs:109-117 | src/bin/rhai-repl.rs:36-44 \u2014 before extracting anything, compare \u0060src/bin/rhai-dbg.rs\u0060 and \u0060src/bin/rhai-repl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"src/bin/rhai-dbg.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad63dbf4f04a13210e565816a7a7ffde315a544cb5edf4ecc36dd80123b569ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser.rs:1105-1113 | src/parser.rs:3107-3115 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"272b579712ea045dd36b80097b7f57fde07f93fe23722e6287b23111d0f0ac9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser.rs:792-800 | src/parser.rs:832-840 \u2014 both copies are in the same file, so extract the block 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":"src/parser.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"24520f215ba79b71809eee537cf422b9813ec546dfa6909b8ee03179d55e5dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/packages/array_basic.rs:1975-1981 | src/packages/array_basic.rs:2122-2128 \u2014 both copies are in the same file, so extract the block 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":"src/packages/array_basic.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d23aeac0cec4eb7b138a64416c4ba834289a7206e3dcd5122d793c63b312558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/packages/array_basic.rs:44-50 | src/packages/array_basic.rs:766-772 | src/packages/array_basic.rs:1211-1217 \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":"src/packages/array_basic.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceff3d603ae224e939d1783f0b59084644abb6f4fb50431bd26da40d61442038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tokenizer.rs:1201-1206 | src/tokenizer.rs:1377-1382 \u2014 both copies are in the same file, so extract the block 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":"src/tokenizer.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b559b72367e54c204e46b30a28000999db10e6cf5e268b7be53a718eef97604d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/optimizer.rs:967-971 | src/optimizer.rs:1015-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/optimizer.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6bc73a959a504004d0cc73f6ac251c91b35f6b230ef8ae8e2465eb7f8c2af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/optimizer.rs:1132-1136 | src/optimizer.rs:1141-1145 \u2014 both copies are in the same file, so extract the block 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":"src/optimizer.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bea70980b22f3689f71ae83f5f60846aeaab61d2d240ecf39ca2f8ce7c54884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/packages/bit_field.rs:106-111 | src/packages/bit_field.rs:196-201 \u2014 both copies are in the same file, so extract the block 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":"src/packages/bit_field.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"09826d7e94e5386b28a1b2b8b4578b73c9be43c15ba29de471ec124336ffc06b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): codegen/ui_tests/export_fn_bad_attr.rs:11-22 | codegen/ui_tests/export_fn_bad_value.rs:11-22 | codegen/ui_tests/export_fn_extra_value.rs:11-22 | codegen/ui_tests/export_fn_junk_arg.rs:11-22 | codegen/ui_tests/export_fn_missing_value.rs:11-22 | codegen/ui_tests/export_fn_path_attr.rs:11-22 | codegen/ui_tests/export_fn_raw_return.rs:11-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 7 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/ui_tests/export_fn_bad_attr.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"564af285a8c1b655af9bd679745703d7821e8c392e9b0a89eb9df681db8f9c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 8): codegen/ui_tests/export_mod_bad_attr.rs:12-27 | codegen/ui_tests/export_mod_bad_value.rs:12-27 | codegen/ui_tests/export_mod_cfg.rs:13-28 | codegen/ui_tests/export_mod_extra_value.rs:12-27 | codegen/ui_tests/export_mod_junk_arg.rs:12-27 | codegen/ui_tests/export_mod_missing_value.rs:12-27 | codegen/ui_tests/export_mod_path_attr.rs:12-27 | codegen/ui_tests/export_mod_raw_return.rs:12-27 \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 8 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/ui_tests/export_mod_bad_attr.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8d01300c0cf77594c8982d22435ebddcd4a318217034376ed0a2b19cbbae92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codegen/ui_tests/first_shared_ref.rs:12-28 | codegen/ui_tests/non_clonable.rs:12-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/ui_tests/first_shared_ref.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed98bd0c2a7dc1356b69b100c660482fc08f8bd234fad3ca3fe621e62704eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 27): codegen/ui_tests/rhai_fn_bad_attr.rs:12-27 | codegen/ui_tests/rhai_fn_bad_value.rs:12-27 | codegen/ui_tests/rhai_fn_extra_value.rs:12-27 | codegen/ui_tests/rhai_fn_getter_conflict.rs:13-28 | codegen/ui_tests/rhai_fn_getter_multiple.rs:13-28 | codegen/ui_tests/rhai_fn_index_getter_multiple.rs:13-28 | codegen/ui_tests/rhai_fn_index_getter_signature.rs:13-28 | codegen/ui_tests/rhai_fn_index_setter_multiple.rs:13-28 | codegen/ui_tests/rhai_fn_junk_arg.rs:12-27 | codegen/ui_tests/rhai_fn_missing_value.rs:12-27 | codegen/ui_tests/rhai_fn_path_attr.rs:12-27 | codegen/ui_tests/rhai_fn_rename_collision.rs:13-33 | codegen/ui_tests/rhai_fn_rename_collision_oneattr.rs:13-32 | codegen/ui_tests/rhai_fn_rename_to_index_getter.rs:13-28 | codegen/ui_tests/rhai_fn_rename_to_index_setter.rs:13-28 | codegen/ui_tests/rhai_fn_rename_to_prop_getter.rs:13-28 | codegen/ui_tests/rhai_fn_rename_to_prop_setter.rs:13-28 | codegen/ui_tests/rhai_fn_setter_index_signature.rs:13-28 | codegen/ui_tests/rhai_fn_setter_multiple.rs:13-28 | codegen/ui_tests/rhai_fn_setter_signature.rs:13-28 | codegen/ui_tests/rhai_mod_bad_attr.rs:13-29 | codegen/ui_tests/rhai_mod_bad_value.rs:13-29 | codegen/ui_tests/rhai_mod_junk_arg.rs:13-29 | codegen/ui_tests/rhai_mod_missing_value.rs:13-29 | codegen/ui_tests/rhai_mod_name_collisions.rs:12-31 | codegen/ui_tests/rhai_mod_path_attr.rs:13-29 | codegen/ui_tests/rhai_mod_return_raw.rs:13-29 \u2014 before extracting anything, compare \u0060codegen/ui_tests/rhai_fn_rename_collision.rs\u0060 and \u0060codegen/ui_tests/rhai_fn_rename_collision_oneattr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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":"codegen/ui_tests/rhai_fn_bad_attr.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"931acdd99fce18dd0ed89119b736f74223f011f928b6df980be25a3b8c220e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): codegen/ui_tests/rhai_fn_global_multiple.rs:13-28 | codegen/ui_tests/rhai_fn_rename_collision_oneattr_multiple.rs:13-30 | codegen/ui_tests/rhai_fn_rename_collision_with_itself.rs:13-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/ui_tests/rhai_fn_global_multiple.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b365863b72fba75348fb51f690575716b154b902b8db8baf2217db5e158495a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): codegen/ui_tests/rhai_fn_rename_collision.rs:13-33 | codegen/ui_tests/rhai_fn_rename_collision_oneattr.rs:13-32 | codegen/ui_tests/rhai_mod_name_collisions.rs:12-31 \u2014 before extracting anything, compare \u0060codegen/ui_tests/rhai_fn_rename_collision.rs\u0060 and \u0060codegen/ui_tests/rhai_fn_rename_collision_oneattr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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":"codegen/ui_tests/rhai_fn_rename_collision.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05453fedba4b68caaca9226a332a5601407909cd020b5503db030ee5f8e2615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codegen/ui_tests/rhai_fn_rename_collision_oneattr_multiple.rs:13-30 | codegen/ui_tests/rhai_mod_unknown_type.rs:12-27 \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":"codegen/ui_tests/rhai_fn_rename_collision_oneattr_multiple.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2047690807cee367e9003fe5192bf958bc74ffb03182664a0a5128d0f165b210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): codegen/ui_tests/rhai_fn_rename_collision.rs:13-33 | codegen/ui_tests/rhai_fn_rename_collision_oneattr.rs:13-32 | codegen/ui_tests/rhai_mod_name_collisions.rs:12-31 | codegen/ui_tests/rhai_mod_unknown_type_return.rs:12-27 \u2014 before extracting anything, compare \u0060codegen/ui_tests/rhai_fn_rename_collision.rs\u0060 and \u0060codegen/ui_tests/rhai_fn_rename_collision_oneattr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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":"codegen/ui_tests/rhai_fn_rename_collision.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e868f53b90401316ca1b0cee5dcf208f64fbbcecc7f0a21730c797993ff30f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegen/ui_tests/rhai_fn_index_getter_return.rs:18-28 | codegen/ui_tests/rhai_fn_setter_return.rs:19-29 \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":"codegen/ui_tests/rhai_fn_index_getter_return.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4ecf7c84605950b9b5d1c9b30704a4c3a637a7f690205b8cbb575096e9911c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DynamicSerializer (LCOM4 14): DynamicSerializer\u0027s methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serde/ser.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84995794b8adf37bb66bee01c81259721bd2cb0f9049ad509b62768cdd5c570"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImmutableString (LCOM4 12): ImmutableString\u0027s methods fall into 12 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 12 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":"src/types/immutable_string.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a9ba6cfcfed0b9576909636a21dd641bf178cc02486e5e6ebc158de1a33d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/vm/mod.rs: src/grain/vm/mod.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in Vm::run_frame at line 3442. 14 of those changes were fix/bug commits, and the other 42 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/vm/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/vm/mod.rs"},"region":{"startLine":3442}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d8704e9a71c3c9c2b65c3955c7e0827e1743b9e4c030cb246b97d8c80d4210"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/compile/mod.rs: src/grain/compile/mod.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in Lowering::lower_statement at line 992. 12 of those changes were fix/bug commits, and the other 30 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/compile/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/compile/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"58403df21f442f5935cf08205c1c456bed7b8f2ed0fd38fea680dec0b09d41a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/eval/stmt.rs: src/eval/stmt.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in Engine::eval_stmt at line 184. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/eval/stmt.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":"src/eval/stmt.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c4ea97fbd3ee0e4dc168ea4f35b91445ea0c9533883647c57a1d7ca02a48fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/bytecode/code.rs: src/grain/bytecode/code.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in rhai::grain::bytecode::code::assemble at line 373. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/bytecode/code.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":"src/grain/bytecode/code.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df505fd1e3160e16699ed68a676ad75b633616b05ca917e06654b3abf8ee08e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser.rs: src/parser.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Engine::parse_primary at line 1308. 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/parser.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":"src/parser.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"845d3c80394c2808057c31fac3dbd0fa49b805b51513087167c3f9f22a3acff2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/optimizer.rs: src/optimizer.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in rhai::optimizer::optimize_stmt at line 398. 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/optimizer.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":"src/optimizer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e13326e5b0b8a2c9cf25d9a9503a238ae992fde78090e5e74d82dc84dc7c51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/func/call.rs: src/func/call.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Engine::make_function_call at line 423. 3 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/func/call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/call.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3158e75087027e11b9fa62cf524a27c3125daea0ba19c34bfbee413cdeb918a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/bytecode/verify.rs: src/grain/bytecode/verify.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rhai::grain::bytecode::verify::verify_chunk at line 250. 3 of those changes were fix/bug commits, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/bytecode/verify.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":"src/grain/bytecode/verify.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce3a8c8dacd433f2df77b69ad8f01b6d7b32dc1bc507f4cb981b737b70d7662"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tokenizer.rs: src/tokenizer.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in TokenIterator::next at line 1697. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/tokenizer.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":"src/tokenizer.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490e8745b5eef8d3eb0d19dcdcf188fd09741c971f4ce491c253017fb918941"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/bytecode/op.rs: src/grain/bytecode/op.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Op::disassemble at line 858. 4 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/bytecode/op.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/op.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ed7014f92836cffb72f57719e8d786392aa14e705998e91b7270f74886a2d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/format/read.rs: src/grain/format/read.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rhai::grain::format::read::get_constant at line 437. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/format/read.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":"src/grain/format/read.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7399d331fcebdd041bdbe379206c43e2d9f3d10c6e88d54aa762f83e40ae2da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/grain/format/write.rs: src/grain/format/write.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhai::grain::format::write::put_constant at line 358. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/grain/format/write.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":"src/grain/format/write.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbe3c3af903e66bda3ebc5857f3e00360b6ea3c69b4e05d0c01d9b9e6f8918b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/func/script.rs: src/func/script.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Engine::call_script_fn at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/func/script.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":"src/func/script.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c094ffd438708696220d842e79786805324fdfead62be6efc1c462b35354591"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ast/expr.rs: src/ast/expr.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Expr::get_literal_value at line 359. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/ast/expr.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":"src/ast/expr.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f29a8a199dbfdd2d04864fab5dac16446d90b93efa54f17e4e4ef96c95de27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/types/error.rs: src/types/error.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in EvalAltResult::display at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/types/error.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":"src/types/error.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc79f101a407f61ee80cb74ae03aec6edf14b0a368ee8b21a0255dd1f9f67117"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ast/stmt.rs: src/ast/stmt.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Stmt::is_pure at line 700. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/ast/stmt.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":"src/ast/stmt.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f715fa15adcafbf6bb7f83e425716d65bcbdd1a2b96ae56fdc023d354614a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/func/func_call.rs: src/func/func_call.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Engine::exec_fn_call at line 791. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 00:42:56 \u002B08:00\u0027 --until=\u00272026-09-30 00:42:56 \u002B08:00\u0027 --full-history --no-merges -- src/func/func_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/func/func_call.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"10418842571342b4cc91686942ace445c4ebe04d76fdcb660a8310c00edc196b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO store (with lazy static) the vec of string \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":"codegen/src/custom_type.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d8bc130228baac6fa4358e8d211cc80c10446bd9c5e86cb41daa66fdc34f2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO maybe optimization, reverse the order of segments \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":"codegen/src/custom_type.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4398cd701bbe5508f199f9681a5b9fa7bf73f6e3d7d28dea13143a33fe6bf3"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx[???]... = rhs, xxx.prop... = rhs \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":"src/parser.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"2375404f50e9a6e28eb9ff6f6ea2bcfa6b1879ebe570a70fb8a4a215b25adeb4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // [xxx..] | (xxx..) | {xxx..} | xxx.., | xxx..; | xxx.. =\u003E \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":"src/parser.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e76097bb3649e09260d01adbcf05001ec5721215dc7c464f6042a4e287be4b7"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // [xxx..=] | (xxx..=) | {xxx..=} | xxx..=, | xxx..=; | xxx..= =\u003E \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":"src/parser.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1414364a34ec94ed686b209ecacc77f529ae133def49cca85cfa22815c983eff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Further audit no_std compatibility \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":"src/lib.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c65230ae1ef1fc5d74f0f43189827dcb13146832fa434988069ad4f4ca1458f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Further audit no_std compatibility \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":"src/func/native.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dbe8f90b5a266be307ea6ba0bc941131bbfb8fa9edcd2fce9a2b61cd053235"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Further audit no_std compatibility \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":"src/func/native.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7688edb6b3d57ae3950da582b9ff1583826e384601aaab607b689e5979eccb8b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// xxx \u0060.\u0060 method \u0060(\u0060 expr \u0060,\u0060 ... \u0060)\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":"src/ast/expr.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d368478bf7ee65869aab7c981f4ff539bd5d608e42f92a8def8a18e216cd9bce"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx[idx].expr... | xxx[idx][expr]... \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":"src/eval/chaining.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0af9c9171bfaec4e729fc4c71c01f641d28a19f9cd903db791da027aeb9ce4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx[rhs] op= new_val \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":"src/eval/chaining.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb48658ddaa27c6187edc05c83771e621417cb23464ef8c7e55af1a14e47b87"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx[rhs] \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":"src/eval/chaining.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b524fb3c37eb6adcae67d8fed53850594587d5b4e1e6acd4337982579e12db"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // {xxx:map}.id op= ??? \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":"src/eval/chaining.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d516a6a8ff81695ddd97664b33376c27722c3274789830369425b26ef4ac2bc"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // {xxx:map}.id \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":"src/eval/chaining.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f69b310d2ecc53d1ada77421b1c2407b8404d851af5a6da3a83023c53cbce2a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // {xxx:map}.sub_lhs[expr] | {xxx:map}.sub_lhs.expr \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":"src/eval/chaining.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f47965b1a1bbe275536ec1a0973706d239a484cdec193b4ec83592086385ba"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // {xxx:map}.fn_name(arg_expr_list)[expr] | {xxx:map}.fn_name(arg_expr_list).expr \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":"src/eval/chaining.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed3482aa9568454b56981e0d230f5a29be02b2108294932a0cc16baa3fe1763"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this limit when \u0060rust-decimal\u0060 is updated with the fix. \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":"src/packages/arithmetic.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fbcc947d30a0ce5a32bf24794e38c7ca827b2b874afec91dba5990861c5589"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also add test case for unary after compound \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":"tests/unary_after_binary.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72738c1c1225f844e26b284ea3930a504306b6c6183d35f65bf0604d8ee8627"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant registration methods for functions with different error handling semantics. \u0060register_fn\u0060 and \u0060with_fn\u0060 imply standard return types, while \u0060register_result_fn\u0060 and \u0060with_result_fn\u0060 imply returning \u0060RhaiResult\u0060. This forces users to choose based on implementation detail (whether the function returns a Result or a value) rather than a unified API. Similarly, \u0060register_get\u0060/\u0060with_get\u0060 vs \u0060register_get_result\u0060/\u0060with_get_result\u0060 duplicates this pattern.: Unify into a single registration method (e.g., \u0060register_fn\u0060) that accepts a function returning \u0060RhaiResult\u0060 or the value type directly, handling the conversion internally. Or, enforce a strict convention where all native functions return \u0060RhaiResult\u0060 and remove the \u0060_result\u0060 suffixed variants. (signatures: Engine.register_fn | Engine.register_result_fn | TypeBuilder.with_fn | TypeBuilder.with_result_fn)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"998ec6d9edec4091826aaedb07b2b198b05e92f4b6ca6939bcbad9b970ba0217"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent type registration API. \u0060register_type\u0060 takes no arguments (likely inferring name), \u0060register_type_with_name\u0060 takes a string name, and \u0060register_type_with_name_raw\u0060 takes identifiers. Meanwhile, \u0060build_type\u0060 returns a builder for complex definitions. The existence of three distinct methods for simple type registration with slight signature variations is confusing.: Consolidate into \u0060register_type(name: impl Into\u003CIdentifier\u003E)\u0060 and \u0060register_type_with_builder(builder: TypeBuilder)\u0060. Remove \u0060register_type_with_name_raw\u0060 as it duplicates intent with a more complex signature. (signatures: Engine.register_type | Engine.register_type_with_name | Engine.register_type_with_name_raw | Engine.build_type)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d3847d90ecfc0e6431e367ae711a636e305569e611da26596391af335f1d244e"}},{"ruleId":"D22","level":"warning","message":{"text":"Excessive duplication of execution methods with nearly identical semantics. \u0060consume\u0060, \u0060eval\u0060, and \u0060run\u0060 appear to execute scripts/ASTs. The distinction between them is not immediately obvious from the signatures (e.g., does \u0060consume\u0060 store it? does \u0060eval\u0060 return a value? does \u0060run\u0060 just execute?). Having three verbs for essentially the same action (executing code) creates cognitive load.: Unify into \u0060execute(script: str)\u0060 and \u0060execute_ast(ast: AST)\u0060. If \u0060consume\u0060 has a distinct side effect (like storing for later), rename it to \u0060store\u0060 or \u0060load\u0060. Clarify the return value semantics in a single \u0060eval\u0060 method. (signatures: Engine.consume | Engine.consume_with_scope | Engine.consume_ast | Engine.consume_ast_with_scope | Engine.eval | Engine.eval_with_scope | Engine.eval_ast | Engine.eval_ast_with_scope | Engine.run | Engine.run_with_scope | Engine.run_ast | Engine.run_ast_with_scope)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f800de34d16105c61dec460c60429cc39812eaac774834fd37dd8b3d044a30a6"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming and grouping for compilation methods. \u0060compile\u0060 takes a script string, \u0060compile_file\u0060 takes a path, \u0060compile_expression\u0060 takes a string but implies a different AST structure. The \u0060_with_scope\u0060 variants are repetitive. \u0060compile_into_self_contained\u0060 is an outlier in naming convention.: Standardize to \u0060compile(source: Source)\u0060 where Source is an enum or trait covering String, Path, and AST. Or clearly separate \u0060compile_script\u0060 vs \u0060compile_expression\u0060 if the ASTs are fundamentally different, but remove the repetitive \u0060_with_scope\u0060 suffixes by using a builder pattern or options struct for scope. (signatures: Engine.compile | Engine.compile_with_scope | Engine.compile_file | Engine.compile_file_with_scope | Engine.compile_expression | Engine.compile_expression_with_scope | Engine.compile_scripts_with_scope | Engine.compile_into_self_contained)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5f899e2141f9bd4b9cb54150e850e34bbd723843f5575490c50b79e6551bd2b3"}},{"ruleId":"D22","level":"warning","message":{"text":"Fragmented function registration on Module. There are specific methods for getters, setters, indexers, and generic functions, plus a \u0060raw\u0060 variant. This duplicates the logic found in \u0060Engine\u0060 and \u0060TypeBuilder\u0060 but with even more variation. \u0060set_fn\u0060 vs \u0060set_native_fn\u0060 is unclear.: Adopt a unified \u0060register_function\u0060 method on Module that accepts a \u0060FuncRegistration\u0060 builder or a trait object, similar to the \u0060TypeBuilder\u0060 approach, to handle all function types (native, script, getter, setter, indexer) uniformly. (signatures: Module.set_fn | Module.set_native_fn | Module.set_script_fn | Module.set_getter_fn | Module.set_setter_fn | Module.set_getter_setter_fn | Module.set_indexer_get_fn | Module.set_indexer_set_fn | Module.set_indexer_get_set_fn | Module.set_fn_raw_with_options)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58cb4bb5b00a2d9eea44835cdd758f57e3da242de60f2643f6b0f4d066b674ab"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant custom type registration methods on Module. Four methods exist with slight variations in parameters (comments, raw identifiers). This mirrors the inconsistency in \u0060Engine\u0060 and \u0060TypeBuilder\u0060.: Unify into \u0060set_custom_type(name: impl Into\u003CIdentifier\u003E, comments: \u0026[\u0026str])\u0060 and remove the \u0060_raw\u0060 and \u0060_with_comments\u0060 variants. (signatures: Module.set_custom_type | Module.set_custom_type_with_comments | Module.set_custom_type_raw | Module.set_custom_type_with_comments_raw)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"abde26acc3b124d551878e47317376cf7bdd0af42f9d92edea0718e82bd0e56c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060(repository root)\u0060 (68359 LoC, 248 public types across 19 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d4360894b2964cff7de98994c81d1616a1a419dab3a5af503a4f01f2d7cdec8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95aaa627248530f3a63680c9833808a371863c8da144bd40496852cf37a7e22e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f10af0d4bae4d4eaef932b72c9ae623043fac4a1d4da96530d6ce7029c4a5512"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1f3e3a96386d3cf2a09fa1b2ee086568b14149ffbb176c4b92b8ecf6af2fa512"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"440d3c0e011476046a9eb8879e5e8d3a0e9e13278a7d885142ea8cbd0fa41aaf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30bc318c701c88ce922925208ae007fa4b322a660a4bb75f49752e1de3246766"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd6108671ef97b26086bce176d4ad0599ecd90debbf6943f7d0231b55395d8b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a4cba461b2514b3e62ec5de57bb69080886fd613c18d48f725946482ed72dbb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a3ef218c82e053156634db992c0bafcc2f62d9f7e0dcc3d780a2626a3af24f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb5ab39f5b7933f2be6cc1a485da87010aeaa2d74e044536715c73daba7f1d51"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63971014418d75eef7a8e55f7f272933c4622a893210d5a7fcc7a42b6eb9ba96"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bbe9349db8a2c4d2dfba503fc904ef9528081d64488176a5f6dcf950cf43326"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e19667e8fd6e6552c975bb0d594ae3b602a95f7e1237ae5b2c86433bf1a7a5e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2852c9ff7e53fce947be462fdbde8b96339229779c8d228ca227f94811e58ac7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0029431f78d494f431c1fcbd4b360ceefd0fd960bf77cbe2145626c9571f0021"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3e051320f9fc6c7a5fa65a0a39899b808abeb4451415bdabd31c3eb4750f671"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbbcbf47f51dbae1809c36810d72f687fd6fca35a8ffacfeaab7fb936105c397"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"520a46a8f201850b13894870977361b17c340d38ee32f9402de17de3f6e87dcc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08d31a1f9e9edd32d20f6fdeb2d35afababef00f4fbe1ba159133249f07be2a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b9164b0b8e4fbd591f543ee9d31f9469fda2f6acc9e1a36d3bbf2bd2a32c820"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3f62966b6fa5bda1eaf9fef89c4566eaada71d3e3d0d82d7a4dc896c43511b5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d65cce143f173ba792065ad4cf2e840b2e812aa45f0619a5945bfbc6343157b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcca128f09a3b64df87a4eae939e04513949911144189b6eded2d234bf2ec371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fd48bc520870a47753c0aa1c96f54ee0cb5f850ed86d45a7d02a40287d2998a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff8180eb97f745c1ed6b460ff6c9cfffe257e635a9027b1b46f4004f51782c76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f24d073da8e59134980237744f1c2162f28fec3e56a96f15b80238eebe8a33cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2940855d38a965fe1eb57c143503147d55bdfe9c8c7b8a9101631f22205b2ab9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"103700f505632bcd4aa20eef2f9cc20791be9a3ec59efe66d1f155a3e37ab24d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a378eb575e3f20eca26f26f9af5fcfc839b4b37f9977c04073aa58942c61cd4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7155ef539c11431eedbd29fb54f7565cfcc13ba4ba088f0563a46679cb845fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9413d177ee3dfb094dc7ceb596e3a2705c4a851450d2130bbb4a0076070eb76d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc1116276295bca89c14c9f95cd04228a0be18bd573d83b09c9eca410c4316c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60f2175b4cc57c5e5f4733eb52f74dd913ea51fd4af01ca099366244c6b42944"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db881e73c52138a6f7ff5ee50fe3521b5eaac3c9506cc29e6359b9deafcc2aac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb938903d65a4d8d9cb8d1e57eda6d8321ce01e9af99af1b6f4b3c092c165530"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e343421e318b51ddafb433864aae5395297293de517097f68605641d11b400c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78f0c8809c3544bdde3c0c0fd5a3fd27a61c1626608ecac38a7b6254d1fb476d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdc11dfb44118ca55f6de57a5dfd36d63b5427a84fc952f2e5a85fb1e2608a0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f41b8bbd3ad6b6b5d2903d81366bf0b9c677071684e9e54c9db77041b3321d92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d344060610c3f78f345c793f6ba35bf55c98212e67a2c600f593cd361819a53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c376ca2fc248cfc443dc680c3ea9fef9ddfda9401649ab6549f002027c9228c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f295cdd70bcdd19c7a49c1d939018e53645f529bd45a44f8d567ebb4045a934"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6a5e787d45572c17355f563c7b1784b3bef7160e1fe33b0aef4754f3e51eaf0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6816a80fd56508782e42871a00afd58343d5b2e637599e9516505eb87efb4fc3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee5706bf81af4c4faf80e038a3093c8debe0d746189d9c4dd823fce469a47552"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8e4f9b488ad353c6eb106a7a4f9b7e0a358a55e9ac66acc4487fca9aaf3c9ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2e8f2b66cde07bb276425870b27dd70a532a4d00a0b9cb6789cc8fd9ef4ecd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f93a1831c3f53cd62248debe0fbb68d612ab75960135188203e06c70023c8f2a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76c664182c6eb05e7d5cb154dbf63c39d3104e2ec6e1f99ebc4f82544637077d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7436b67b34097643135eae3430344015e57c62801ceb91e0cd8604c45402ee5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5dab717b9712139b109b49353b6f069768beb91a7247684497521b932a61a5d5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bc165e795b977d5c0dbee6e9fe90920a054b2a7f1ea189b2c690a48d8401f7e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71da725b28c8a60c96df06da1fbeb6d7733565b7e3cccede7e330ecf942e9997"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb9bcac4743707e61383ddda130b141687559de024fa2b452fef984d8a860fe6"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f578c7638346e5bfdd3e233c151ca76b7d2eec81f452dfc61f687f1cff1857cf"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6535e0c15275cd516d2bef5b736c44ed0a343ccf0b71af467b2dd3cc4a6a7169"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"caa22daa984f399892d3396d8b45401435e33057f2e8942bd00a37cfab340a14"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ea308bf1faec486c645bc164402e33e7c7a7c8d6f1c49d558ec17f58d01d1df"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cd01798d01af78aa7637a870e1170ba95c78abedc764d017bdb03fe08dbf049"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c970881be8742202c082b4e0b930e1b71f7d4dc0e7962e41f67e114259b4ec80"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65d2b6a1b84b9dda210690dc4dd6c004f53ed513f0d0cea4535d066a45b1f3a2"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56351993cfa46071986dadfa759d5a984cabdf5b461883d1607fe016a11c61e5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8d62da1d7086cc359ed6c226a300b9b4279bdc0de22e301fbcc044bdd67a633"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a96692a968f6f6601aa93a5189f4c3f5a6243bbfb736ef1347f6d997cf0f2b13"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94fee9f7963f590663f3ecde5c3c9b275db437158b9b4900c20a1d6390647233"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c8cdf08365079ff94045341d164c1a031cd825fb902b6d6930605d345083bbb"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc8e4e7ce495330abaf35a7d2af76910f5e4acb4a038e7143524ca210928c923"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"119fb2ed982b3ed9a7d3b72eb4947d1a43c03568284a7a23baa6d4adaf018a3b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30ef2fd019b4b53b13b9dcff681b905a8fa5536f5eeff96c450b37fe1581d364"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4f4679c7c0269d53f08536ff5f56288c410f382706d3e5463eaa12f0d0d5be6"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89e5d3aa95d37c3ea5aaec361c7f8b5cfa9597362962877d7692702a91978f10"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a280376dc85f71d4dcc3ff43b8d7b603ab23e7f5fb15679855aac512e2b014b9"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"643cd13f0f92a8e34cd1598a21707d6b6936cf8b075c63c9ba3477e955bcda7a"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7b81f7f3f0b1e79382d9f3277ab82608fde18141c46d9fe442de6115818cbe9"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 119 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 119 of the 206 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: fuzz/fuzz_targets/scripting.rs, fuzz/fuzz_targets/fuzz_serde.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: verify.rs \u2194 mod.rs: \u0060src/grain/bytecode/verify.rs\u0060 and \u0060src/grain/compile/mod.rs\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060858ada21\u0060 Leave switch subject on stack and avoid putting it into scope.; \u00607b0d7ead\u0060 Optimize out Unit/Pop pairs, control flow structure jumps (#1156); \u006068336226\u0060 Fix missing caps in verifier. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b36c4216a01b50708a36f67d572ea6893b54452c136604cf26783b57bf2fbf1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: verify.rs \u2194 mod.rs: \u0060src/grain/bytecode/verify.rs\u0060 and \u0060src/grain/vm/mod.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060858ada21\u0060 Leave switch subject on stack and avoid putting it into scope.; \u0060a0797968\u0060 Merge pull request #1148 from rhaiscript/vm-capabilities; \u00604bc1cfa4\u0060 Fix bug with declaring const. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grain/bytecode/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b062561445192cc55571bf85e4d3a2d36f4ebea5446a89fe803f9897cf014a2e"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060codegen\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"CWE-1329","shortDescription":{"text":"CWE-1329"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":82,"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."]}]}