{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::search::run (cyclomatic 143): xan::cmd::search::run has cyclomatic complexity 143 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/search.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8f0205d0c0b276dc0f68dc770330099527d66e62bd170c84193ede56dc3db"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::spark::run (cyclomatic 115): xan::cmd::spark::run has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/spark.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec38da0bf9107704b429b6bb0ba77c8f3d0a3172eaa66387b3d4f3dcb650270"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::plot::run (cyclomatic 114): xan::cmd::plot::run has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7126b405a6a9686f2c88c20acc86b38a1d3abb0c229d77a23039d1a4f93678b9"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::view::run (cyclomatic 101): xan::cmd::view::run has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/view.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8593131d160d633c9f46e467939c815ed5bbb5cf949e861b15240ad2eba261a3"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::dedup::run (cyclomatic 68): xan::cmd::dedup::run 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/cmd/dedup.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3965b435dfcbdc6f2a3f6d130d7960933c87c36a5aebd2aeda60f31ea80c39"}},{"ruleId":"D1","level":"warning","message":{"text":"Aggregator::get_final_value (cyclomatic 62): Aggregator::get_final_value 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/moonblade/agg/program.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b787c85463dda15f4f8a41d2a23429f96b77f259e774c40d5c0d0c72abe46a"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::agg::program::get_function_arguments_parser (cyclomatic 60): xan::moonblade::agg::program::get_function_arguments_parser 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/moonblade/agg/program.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"eace22dc4ae314bd7c1feba611bbd0b87f07d9eec9e7814ecdd8e6f1aef69b80"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::separate::run (cyclomatic 58): xan::cmd::separate::run has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/separate.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"1603ed7cc8c1f8d23a4ec847613d207e4e6b6746b4b8c57ddf968ebb3bfdfa2b"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::tokenize::run (cyclomatic 56): xan::cmd::tokenize::run has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/tokenize.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c744c1610b1df9560c6cb08e5d90d964a21179cac7352ea9fa2979aa4a5d9537"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::complete::run (cyclomatic 52): xan::cmd::complete::run has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/complete.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a445fc253e8474c79a9bcb1fc04a73b4a52a840acf95b4abf31e5f17589c85"}},{"ruleId":"D1","level":"warning","message":{"text":"Scraper::scrape_article (cyclomatic 51): Scraper::scrape_article has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/scrape.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc9d75c77fae35b2e140369d1ebab993f81a1ed033152dca8b91c1a95e9edda"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::sort::run (cyclomatic 51): xan::cmd::sort::run has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/cmd/sort.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"af603ef9b8563b53e027b520f393dee9c94c17aa539fc1aaa896cb937ef1a612"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::heatmap::run (cyclomatic 50): xan::cmd::heatmap::run 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/cmd/heatmap.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acca00a45419ab1de04c63afc4f9b5ef2998f2d6513ebecf921ac679a1e1f2b"}},{"ruleId":"D1","level":"warning","message":{"text":"CompositeAggregator::process_value (cyclomatic 49): CompositeAggregator::process_value has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"8777068b30b6874bcf62b5e77c31093e28b10489d563587dc9ab45ee17df23d5"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::vocab::run (cyclomatic 49): xan::cmd::vocab::run has cyclomatic complexity 49 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3286c31ee2c2bfaa0558f3681a72d27b9a63fe9b92f58954553152eeecee464"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::compgen::run (cyclomatic 47): xan::cmd::compgen::run 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/cmd/compgen.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e69a6abe0ebd4c1a12c8fd73d59abd36c4163e0ce13aca3a32903aaade20cb"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::stats::run (cyclomatic 47): xan::cmd::stats::run 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/cmd/stats.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9bf79185a8f960763b162197438a5aacda5f41fabca4857031e6bd3978ee08"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::frequency::run (cyclomatic 45): xan::cmd::frequency::run has cyclomatic complexity 45 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/frequency.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6964e4af79ea104f903eb4812b0fb36b47c3ba0f697b903baf1bf51c7691d8"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::hist::run (cyclomatic 45): xan::cmd::hist::run has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/hist.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd87d3f3708e9e61b02ad8123c3bc27ce0780c8ba7c927b8af92ff3afb0e98c"}},{"ruleId":"D1","level":"warning","message":{"text":"CompositeAggregator::add_method (cyclomatic 44): CompositeAggregator::add_method has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68516f0f595f9ca71af53626be5d12fa05cf655a718ebbc4f5f38b7471b67d"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::flatten::run (cyclomatic 42): xan::cmd::flatten::run has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/flatten.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8898090f8f9a299e5b4a666aedfed7537f9f231366cd11b5638788dc59b688a3"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::functions::special::get_special_function (cyclomatic 42): xan::moonblade::functions::special::get_special_function 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/moonblade/functions/special.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8c5e7b197912617b452eb59242b87c52d25c29db2e2a320b62600477a191ce"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::parser::pratt_parse (cyclomatic 41): xan::moonblade::parser::pratt_parse has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/parser.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e188f097f9363e23c06f92af98c736f353e9dad2cad1b4d59bf39fa97d7896"}},{"ruleId":"D1","level":"warning","message":{"text":"Selector::indices (cyclomatic 38): Selector::indices has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ea9d320b19b707bf1d3f44a87e333ec6c9d438fd0473a2270a98f407fe5097"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::groupby::run (cyclomatic 37): xan::cmd::groupby::run has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/groupby.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d81e9b85fda4ce6ab782903313e2fd5220aa547f836cdb20ac531b771dd32e"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::parquet::human_readable_column_type (cyclomatic 36): xan::parquet::human_readable_column_type 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/parquet.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c89aa379b7afc4a2c9007d2f3b633dffd9b68f1b3d4c1875d126b11d5dc390b"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::bisect::run (cyclomatic 33): xan::cmd::bisect::run 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/cmd/bisect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1cc814d6a63e7e96978a8218ba656c3773bae6f0dd91637ba0941723e8abe2"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::explode::run (cyclomatic 33): xan::cmd::explode::run 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/cmd/explode.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed9e8d95cefac59c80dc5d009c0ab8693ca2544c66225b9b373d438e58815b1"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::map::run (cyclomatic 30): xan::cmd::map::run has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/map.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e01ae622a428932d1e7e2855fa7ea9bca9947485e466076f440fc245b0f5988"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::rename::run (cyclomatic 30): xan::cmd::rename::run has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/rename.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8942440e830ede8d469e13b377797c4ced4ff80dcdefbf1eef7aef224ba2d415"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::window::run (cyclomatic 30): xan::cmd::window::run has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/window.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6829dedbd2281026bc074bcd9b85358059d2d4e7ecd5a2afb8342811869e0c83"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::merge_join (cyclomatic 29): Args::merge_join has cyclomatic complexity 29 (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/cmd/join.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdfbb1331e372faef83f7b59c173ddce0f2804e1904177c1a82adb86f2ddab3"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::help::run (cyclomatic 29): xan::cmd::help::run has cyclomatic complexity 29 (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/cmd/help.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa68d8d774590f5698c9753d676c398025912ac01d7be3cf51b7177ef89a956b"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::interpreter::concretize_call (cyclomatic 29): xan::moonblade::interpreter::concretize_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/moonblade/interpreter.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e7735e2eb992e0bea327ce1a3e526d8e564e4635abfab0a52b58067befa989"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::agg::window::concretize_window_aggregations (cyclomatic 27): xan::moonblade::agg::window::concretize_window_aggregations 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":"src/moonblade/agg/window.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9a6ad9099ec00fbdac1dc5f088a6680a0a5c2e42e93a8e09ac2a8af6553870"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcreteWindowAggregation::run (cyclomatic 26): ConcreteWindowAggregation::run has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 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/moonblade/agg/window.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"53db83e10b319a0ace61d4eb67d78a4f176fc1c3963754b65d101db8bd5f26e4"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::functions::special::runtime_higher_order (cyclomatic 26): xan::moonblade::functions::special::runtime_higher_order has cyclomatic complexity 26 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"e344bc15cb2bb314a92aafcf1a0e8720740b26fc01eb0a6aa44729471b3313ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::merge (cyclomatic 25): Args::merge has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/view.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d269dbc46b2bdd039d7b9aff3cc49bf9d8a794ec999f534c560c7a4b4caf8b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher::replace (cyclomatic 24): Matcher::replace 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/cmd/search.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"42280aa7e88b1fb16e8c045869704e8eb62514a9e75c16a4b4791a30917a50cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SparklineRenderer::render_impl (cyclomatic 24): SparklineRenderer::render_impl 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/cmd/spark.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba17ca42a9d8b494b219a9b226124281ff1ece6451d31ead4acda0197d4d0d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphBuilder::write_gexf (cyclomatic 24): GraphBuilder::write_gexf has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"146773b15c54cb527ca38b183a86edc6b0b6a7bb3660282f4c861262fd021e90"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcreteWindowAggregation::finalize_total (cyclomatic 24): ConcreteWindowAggregation::finalize_total has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff277cff36c165299ab7daba440005178f23c9859b92e16148e08148e6b83e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor::run (cyclomatic 24): Extractor::run 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/moonblade/scrape.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"89911a4659769a41414f985c88dc9a0d5d2786ec2466a4674f875ef91b9c5f78"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher::unique_matches (cyclomatic 23): Matcher::unique_matches has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0354f053f4e524eaf6994f9261169732941753724f3e3feeb4d0379e7c232093"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::agg::run (cyclomatic 23): xan::cmd::agg::run has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/agg.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2df186539da2bcf23519bdb7ba6fd9e2a38156a76df706e61107e4a9ac8396"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::join::run (cyclomatic 23): xan::cmd::join::run has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"87abb6772baa3a853c1b34f9db9985a67be1040d1e9b5602fe2ef51148028ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::top::run (cyclomatic 23): xan::cmd::top::run 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/cmd/top.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ff57dd86bd527fca74153e265baa517be4c6147eec4fbd1ae18fb2ab0e9569"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::cat (cyclomatic 22): Args::cat has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 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/cmd/parallel.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48cb4bb620004e66c04ed0ed8cec53128038d2d8b330857278a083a63755983"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher::count (cyclomatic 22): Matcher::count has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a7add69613d474d3f04ceb1495bb03a23f973cc215f85eb455e81b8f5b0666"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher::breakdown (cyclomatic 22): Matcher::breakdown has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"170924b1422ca717c3277bbe8316ebc001ce0eb7d42c3e3f5878c2e7344fabcb"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::build_matcher (cyclomatic 22): Args::build_matcher has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"549677c117fff8cc97eae7e1b9a7e4ba43c73e6b795bb69bafe4be67579f928f"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::parser::build_string (cyclomatic 22): xan::moonblade::parser::build_string 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/moonblade/parser.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"28591694ebca750bfb359999b1e246e6b121910a5fca9d857e0262f14a9325e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Cooccurrences::for_each_distrib_cooc_record (cyclomatic 21): Cooccurrences::for_each_distrib_cooc_record 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/cmd/vocab.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad62db4ec3f802609630a94bd0883a9c3b70a355bba730fd64e1d0d2b3fd66d"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::scrape::run (cyclomatic 21): xan::cmd::scrape::run has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scrape.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c67ac64243e06330496748897e1da6213161db4bab5927a04166336e084bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::interpreter::concretize_expression (cyclomatic 21): xan::moonblade::interpreter::concretize_expression 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/moonblade/interpreter.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4d007a48b971fef677100bff388a4f67bb950871d44f99ef009d95adab8d0c"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::convert_to_latex (cyclomatic 20): Args::convert_to_latex has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (escape_latex_table_cell). 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/cmd/to.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1284079f24e3553322ecb4706299f61c99985675cb6405bbf0fc22e9059405"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::convert_xls (cyclomatic 19): Args::convert_xls has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/from.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ef6500792564ecd653a9ca66610418d905fb731e78a8cd31b3b0e7ca5497f8"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::cat::run (cyclomatic 19): xan::cmd::cat::run has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/cat.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1571113dfe452cb37d9ce3b9ca60e0a1f210beac98271d9efc07b4986f77f4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::input::run (cyclomatic 19): xan::cmd::input::run has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/input.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e14a453ac0cef10ee1ae110bf085a5902d40f6c68eeb3a94bfb621a7547710"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::edgelist (cyclomatic 18): Args::edgelist has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/network.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f0b43f055dbd28b6373f950f2802aae09acf4d8f5a9c0ce15ff9eab99b9385"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::new (cyclomatic 18): Config::new has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecba4309fcb5a666bbcd4463903abbc3651f02a241d8550d77538e2bd196e757"}},{"ruleId":"D1","level":"warning","message":{"text":"OneSelector::index (cyclomatic 18): OneSelector::index has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"756c3c971f8d7195559d062765cadc0c3f96f79d17cad34990ca37b5441796bd"}},{"ruleId":"D1","level":"warning","message":{"text":"LRUStems::from_tagged_url (cyclomatic 18): LRUStems::from_tagged_url has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/urls.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aac716d17be1034edd3a515ce52c6bfd71fab57127a998a5e040953cf029f89"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::implode::run (cyclomatic 18): xan::cmd::implode::run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/implode.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c47b06b4b0f929bdec3f64aa8d24ede7432507f47540f7820867fa9d2f15777"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::sequential_partition (cyclomatic 17): Args::sequential_partition 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/cmd/partition.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7451156828e9c95b637800e88b678854f89170112dc051339025189e31de1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Split::next (cyclomatic 17): Split::next 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/cmd/separate.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae722eadf9cdfbe2fab4d983af49c0eba05c0ace893674a4d080358131751532"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionRoutine::run (cyclomatic 17): SelectionRoutine::run 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/moonblade/scrape.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"76483c807333c731742d537e00dbfa738b2e1f63326bb8ca04c95bfbd88986fa"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::bins::run (cyclomatic 17): xan::cmd::bins::run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bins.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1deb626a0fcb4d51aedb053751e25ef79f158c12ee6429de4b60fe125bcdf"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::count::run (cyclomatic 17): xan::cmd::count::run has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/count.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c717227eab34982ec768ec1aefbdc6eda1bc19b30b718398a46df02f21d6c67f"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::headers::run (cyclomatic 17): xan::cmd::headers::run 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/cmd/headers.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5892e7ac6095e53fcdfb37bf83f486b0b62c8f896b2cad52a218ed6af875e1"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::fixlengths::run (cyclomatic 16): xan::cmd::fixlengths::run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/fixlengths.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5312c4a2cd796a52f1df8b96b91e19477670981c093a213e942e43ede20d2610"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::cmd::network::run (cyclomatic 16): xan::cmd::network::run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/network.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b3d4d7fef9ad4d4a7cd4ac220a8f4407c9eb390e61725f6d2d172801211d0"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::moonblade::functions::special::abstract_runtime_cols (cyclomatic 16): xan::moonblade::functions::special::abstract_runtime_cols 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/moonblade/functions/special.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"84709353fb7aef721c6bcb9b30056d6addde0064de6f4db8eb4411bfed7cbfb0"}},{"ruleId":"D1","level":"warning","message":{"text":"xan::tui::utils::print_buffer_to_stdout (cyclomatic 16): xan::tui::utils::print_buffer_to_stdout has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (colorize, group_cells_by_color). 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/tui/utils.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc380a2dda36e0e5ba0754eb82bf1926ab8b50226caeb98c842979bb786da14"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::search::run (cognitive 351): xan::cmd::search::run has cognitive complexity 351 (threshold 15). Drivers by points: if/else 112 (247 pts), loops 23 (78 pts), boolean chains 26 (nesting depth added 190). 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/cmd/search.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f367ee2c50f12dd37f75650b802287822994d2dee35a2726ee14f953dba7e1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::plot::run (cognitive 279): xan::cmd::plot::run has cognitive complexity 279 (threshold 15). Drivers by points: if/else 113 (231 pts), boolean chains 19, match/switch 9 (17 pts), loops 6 (12 pts) (nesting depth added 132). 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/cmd/plot.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e7ab751aec24ae122d818a09a166eaf8047d0829a780ad45e00c0c70c8129c"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::spark::run (cognitive 254): xan::cmd::spark::run has cognitive complexity 254 (threshold 15). Drivers by points: if/else 92 (182 pts), loops 21 (57 pts), boolean chains 14, match/switch 1 (nesting depth added 126). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/spark.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8da572e8e20fe5209dacd33b3a35ac22c1caf3938096d05db96ef1ef3a92637"}},{"ruleId":"D2","level":"warning","message":{"text":"Scraper::scrape_article (cognitive 157): Scraper::scrape_article has cognitive complexity 157 (threshold 15). Drivers by points: if/else 46 (150 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 107). 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/cmd/scrape.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccca8c0dc12073f2a5c594880d5124c3a119cfda03bee16b3c58fa8e4f349da"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::view::run (cognitive 154): xan::cmd::view::run has cognitive complexity 154 (threshold 15). Drivers by points: if/else 79 (113 pts), boolean chains 17, match/switch 9 (15 pts), loops 6 (9 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/view.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b42dfc348000966a2d95f0f3d7af574565983debfdfe420540bc1e2b177156"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::dedup::run (cognitive 137): xan::cmd::dedup::run has cognitive complexity 137 (threshold 15). Drivers by points: if/else 47 (90 pts), loops 13 (26 pts), match/switch 7 (19 pts), boolean chains 2 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/dedup.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b786ac4bc5c608b3211cad77c398bce42ff76a4d6f7be43dc6e8ee4b2e2903"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::stats::run (cognitive 134): xan::cmd::stats::run has cognitive complexity 134 (threshold 15). Drivers by points: if/else 32 (73 pts), loops 19 (57 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/stats.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"da613fcf7e4384e9b355fde0c25c18447a831b2d6b4165080896a91a0bdce656"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::vocab::run (cognitive 131): xan::cmd::vocab::run has cognitive complexity 131 (threshold 15). Drivers by points: loops 19 (74 pts), if/else 25 (41 pts), match/switch 4 (12 pts), boolean chains 4 (nesting depth added 79). 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/cmd/vocab.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea559642c75aa286c00058f4bcc055abd9ae33c6f6092aaf38e256011447ce4b"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::sort::run (cognitive 128): xan::cmd::sort::run has cognitive complexity 128 (threshold 15). Drivers by points: if/else 47 (91 pts), match/switch 6 (20 pts), loops 8 (16 pts), boolean chains 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/sort.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"beec38b9c4ebeaee916bc878de10acd74114aa1b5da35bbdda158f61e291401c"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::heatmap::run (cognitive 126): xan::cmd::heatmap::run has cognitive complexity 126 (threshold 15). Drivers by points: if/else 30 (64 pts), match/switch 12 (47 pts), loops 5 (8 pts), boolean chains 7 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/heatmap.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af6ebcee05d63a5ea44be9380e9f94bcb667cc9662741d6ae5d72d4a4f1e345"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::frequency::run (cognitive 116): xan::cmd::frequency::run has cognitive complexity 116 (threshold 15). Drivers by points: loops 15 (49 pts), if/else 29 (48 pts), match/switch 5 (15 pts), boolean chains 4 (nesting depth added 63). Of this number, 110 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/frequency.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56a93a0f6239c5b9712083059b5c9b82a37858d2a24ad9e09f0835ed4e3564d"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::separate::run (cognitive 115): xan::cmd::separate::run has cognitive complexity 115 (threshold 15). Drivers by points: if/else 47 (78 pts), loops 8 (23 pts), match/switch 4 (8 pts), boolean chains 6 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/separate.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d657f9e1aa1e37b7c500827148e17ac71f41f7e200b35ca02e8d242218abd3a"}},{"ruleId":"D2","level":"warning","message":{"text":"CompositeAggregator::process_value (cognitive 105): CompositeAggregator::process_value has cognitive complexity 105 (threshold 15). Drivers by points: if/else 23 (85 pts), match/switch 5 (18 pts), boolean chains 1, loops 1 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into 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/moonblade/agg/program.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ed81500c1404925cd0a6bf98a0fd617d1581404a67e790c7342a9e8a296552"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::tokenize::run (cognitive 103): xan::cmd::tokenize::run has cognitive complexity 103 (threshold 15). Drivers by points: if/else 44 (65 pts), loops 12 (27 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/tokenize.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5a9a5e750a32bd5c045a803fad9cca6b5c4a733317717372ea0d6f3bfa0298"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::complete::run (cognitive 101): xan::cmd::complete::run has cognitive complexity 101 (threshold 15). Drivers by points: if/else 41 (69 pts), loops 5 (13 pts), match/switch 4 (13 pts), boolean chains 6 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/complete.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef5e4f549a8322793f6cc9e777244ab4afe0075a86ab5340564ec18b1514bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::hist::run (cognitive 101): xan::cmd::hist::run has cognitive complexity 101 (threshold 15). Drivers by points: if/else 30 (63 pts), match/switch 9 (26 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 53). 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/cmd/hist.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"35502dbce36c7ee97c214222a31fc5ab1cf01b349bc72fb6288ccf92dc5ac4f5"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::flatten::run (cognitive 92): xan::cmd::flatten::run has cognitive complexity 92 (threshold 15). Drivers by points: if/else 36 (71 pts), loops 6 (13 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/flatten.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"847575b2842dd99d72d479fa038dd049b2bdeb7d7a866cb8e3b0075a2afc960f"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::compgen::run (cognitive 89): xan::cmd::compgen::run has cognitive complexity 89 (threshold 15). Drivers by points: if/else 23 (49 pts), loops 12 (27 pts), boolean chains 10, match/switch 1 (3 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/cmd/compgen.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8368ab656ff35e9b3ee5d70e4637c0bdd0623b30f5fd2da332b0998060021b"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector::indices (cognitive 85): Selector::indices has cognitive complexity 85 (threshold 15). Drivers by points: if/else 33 (75 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8adde4ae59989b18b96919a2b4d380de3b781b24bbbf16dfcdb5506232a2673"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::explode::run (cognitive 78): xan::cmd::explode::run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 25 (54 pts), loops 10 (20 pts), boolean chains 4 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/explode.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db5b47c7ef501bb9822128be392bcc7260d69a32d294a26601773f29429edf7"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::interpreter::concretize_call (cognitive 77): xan::moonblade::interpreter::concretize_call has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (59 pts), match/switch 5 (12 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 44). 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/moonblade/interpreter.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"935a0aa135cc45973b78d91df81dedeeef5013cf87e4e8317d72f4b70f003a76"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::map::run (cognitive 75): xan::cmd::map::run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 8 (24 pts), boolean chains 5 (nesting depth added 39). Of this number, 61 points are the body\u0027s own statements and 14 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/map.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3184444d5fd8033362fd3a786f2deaf1ce166c29ee85475972372d3fce63f2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::window::run (cognitive 75): xan::cmd::window::run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (51 pts), loops 7 (18 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/window.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"884fec98d258f989615138ffd4366b5ca99986ff12f1e0f34f0c216507865fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::groupby::run (cognitive 71): xan::cmd::groupby::run has cognitive complexity 71 (threshold 15). Drivers by points: if/else 27 (48 pts), loops 8 (17 pts), boolean chains 3, match/switch 1 (3 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/cmd/groupby.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56aedd7b921f0c4d5964ee7e819eb7b7a0518c237f161690728639df582a8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::bisect::run (cognitive 70): xan::cmd::bisect::run has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (55 pts), match/switch 4 (10 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bisect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8af51486591cfc5aab1d796a4dd4544e0b1393751e51e1b8695db056fe7c7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::top::run (cognitive 67): xan::cmd::top::run has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 8 (23 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/top.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc8e8d2312cbc0d437b57e12badbb6eb2b4c0bec7b329178de1392cf20362cd"}},{"ruleId":"D2","level":"warning","message":{"text":"SparklineRenderer::render_impl (cognitive 64): SparklineRenderer::render_impl has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (42 pts), match/switch 3 (11 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/spark.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f231ddde274b7ef585a0f2ef9796b86794b6cc22f02d1d89a20a6c4c95577bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcreteWindowAggregation::finalize_total (cognitive 60): ConcreteWindowAggregation::finalize_total has cognitive complexity 60 (threshold 15). Drivers by points: loops 10 (38 pts), if/else 4 (13 pts), match/switch 3 (7 pts), boolean chains 2 (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/moonblade/agg/window.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea0ae892d8f5a20e4e6cd2925fa593c18ac78cc89b85ff954294b26bcf81291"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::merge_join (cognitive 57): Args::merge_join has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 8 (24 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81830157a0b4cc3f9ba46955a72d0a28b21e39234b8f573261524fceebc3fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::rename::run (cognitive 57): xan::cmd::rename::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 36 (54 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/rename.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74a00889f9a34093b68583a2332b095a31b026e83e23767cdfa583d815211e0"}},{"ruleId":"D2","level":"warning","message":{"text":"LogScale::ticks (cognitive 55): LogScale::ticks has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 4 (14 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"94196027bf560ab44eb0c4fa193a01c82d705a57bcc283c207ae81fc3780bfc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor::run (cognitive 54): Extractor::run has cognitive complexity 54 (threshold 15). Drivers by points: if/else 7 (41 pts), loops 2 (7 pts), match/switch 3 (6 pts) (nesting depth added 42). 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/moonblade/scrape.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc6b94b01652444a6bbd50e39956f3c2ced5c43f702957590a3b4a1fd2bc209"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::special::runtime_higher_order (cognitive 51): xan::moonblade::functions::special::runtime_higher_order has cognitive complexity 51 (threshold 15). Drivers by points: loops 11 (30 pts), if/else 5 (15 pts), match/switch 4 (6 pts) (nesting depth added 31). 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/moonblade/functions/special.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f9f1bf48d1ed773819f7905e72e18ab09dfcd40f9f340ea1ddbbb56fc5e5aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::sequential_partition (cognitive 49): Args::sequential_partition has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 5 (13 pts), 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/cmd/partition.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1403d49c42d0f8b904c296e6767e0d98c5dbda0f81cc9fd48b9f15067a39450e"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::build_matcher (cognitive 48): Args::build_matcher has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (41 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ebf6f16493c4cb9f1acb2c4913b995eebbc0dbe9ab2491ce46eccd28318c8"}},{"ruleId":"D2","level":"warning","message":{"text":"OneSelector::index (cognitive 48): OneSelector::index has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"38725752dfbddff7d62f81483d878594eba50c209147fa41d54b4ba6e05270fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Cooccurrences::for_each_distrib_cooc_record (cognitive 47): Cooccurrences::for_each_distrib_cooc_record has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 5 (9 pts), match/switch 2 (7 pts), boolean chains 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"902f620b326071f9030093a333096adc5fe2817755569146f6ab5ec4ac354be1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompositeAggregator::add_method (cognitive 45): CompositeAggregator::add_method has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 24 (45 pts) (nesting depth added 21). 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/moonblade/agg/program.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3ac540c19d3d5493fd02a4b6f4f3fdb4a5af39f249a081dafabda17ea66e1e"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::help::run (cognitive 44): xan::cmd::help::run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25 (32 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3f20a9b02be6ac5c2429c1028494e3c428479a5c09c9472a049129089d5f63"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphBuilder::write_gexf (cognitive 42): GraphBuilder::write_gexf has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 6 (10 pts), match/switch 3 (5 pts) (nesting depth added 19). Of this number, 41 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":"src/graph.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce21959ec7d586f0ad1683eeeea8b103a6ce39b50417d6fba78faeb86b40428b"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::agg::run (cognitive 41): xan::cmd::agg::run has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 13 (18 pts), boolean chains 1 (nesting depth added 18). 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/cmd/agg.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9822571f92bfb4ba89a60e4e3953eb9a9e556a6c2f2f374d6ea33c184f86044"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::special::abstract_runtime_cols (cognitive 41): xan::moonblade::functions::special::abstract_runtime_cols has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 5 (18 pts), boolean chains 3 (nesting depth added 26). 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/moonblade/functions/special.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf82aadbbe1fc0cdc37699bd57cad6f288112410e67e50fac68a1650fa1c76dd"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::implode::run (cognitive 40): xan::cmd::implode::run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/implode.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"57164509d3722ac1181bdb9b15bc93048e9ede6bd6c13fb5e17822610beb8788"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::cat_rows_recombobulated (cognitive 38): Args::cat_rows_recombobulated has cognitive complexity 38 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 10 (17 pts), match/switch 1 (3 pts) (nesting depth added 20). 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/cmd/cat.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"915dfe233613e538cc2968b0d446604be11000ae47afe0a74419c3cb9deac9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher::replace (cognitive 38): Matcher::replace has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (35 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"be827af89d4870b1f9413bbf330a20c3bf924f7215dc8b68fe2a77291741bf5e"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::special::get_special_function (cognitive 37): xan::moonblade::functions::special::get_special_function has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 8 (16 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd7ae7a020048dd6be9d12d83edbcda9efe2e0f566e293e3e4181ec154602b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::cat (cognitive 36): Args::cat has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 4 (7 pts), match/switch 2 (4 pts) (nesting depth added 14). Of this number, 30 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1bee0ee49f7cca6898d996201fa782ebeb640153b28e879abc5383ac933cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::bins::run (cognitive 36): xan::cmd::bins::run has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 4 (17 pts), if/else 5 (9 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 20). 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/cmd/bins.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea66e6c492037e2715f6c741142ebc073e7f5729edf3f91c9ca79953fa56d7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::merge::run (cognitive 36): xan::cmd::merge::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/merge.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e94a131bf0eeec135bb5a59993661c509e412c1a83e6198ad379881f3fb4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::special::abstract_comptime_cols (cognitive 36): xan::moonblade::functions::special::abstract_comptime_cols has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 4 (12 pts), boolean chains 3 (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/moonblade/functions/special.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"822ed5f9bfb41ed6b78f0f1f271736fb4c402781644bb5c5dc1d139e53f52592"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher::unique_matches (cognitive 34): Matcher::unique_matches has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 6 (13 pts), match/switch 2 (3 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5bfc9ca254ffa3fd4025749d0d3ff16ab906c25558c201731c5e71fdacdd1"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::filter::run (cognitive 33): xan::cmd::filter::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/filter.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d905176db58b09fe0e589cb1a0a522ac4918385cdb23b6fc95eb7b9db6b775f"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::headers::run (cognitive 33): xan::cmd::headers::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 8 (14 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/cmd/headers.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897c005ffde98a9d43366b2b0674308cc9147519c9a403bbd2c7d687a1e050e"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::plot::patch_buffer (cognitive 33): xan::cmd::plot::patch_buffer has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e798e0c2b200142b12299a0e2d29ef71a194534c4916b89e9109035f18f8b32f"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::transform::run (cognitive 33): xan::cmd::transform::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/transform.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b6e0b59a2e5f200375be4ee1b110f9b76151da12c10638d68b18caa8f0b924"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::cat_rows (cognitive 32): Args::cat_rows has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (7 pts), match/switch 2 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/cat.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"43548bfbf8c78d87eda38ea28310a20a910141cd51bd6117a3884b1494ae8985"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::view::infer_best_column_display (cognitive 32): xan::cmd::view::infer_best_column_display has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/view.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebf4a31cf51568aabc47efcdfe91dcab842aa4a0937bd74263fd1064c88697a"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::edgelist (cognitive 31): Args::edgelist has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 6 (10 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/cmd/network.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf45d108d837b67afa09fb39435a1d5c1ecf15f8f269626097839fd73fe268f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher::breakdown (cognitive 31): Matcher::breakdown has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (10 pts), match/switch 2 (3 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a92746c1d2c90b112a4f2284364dbc29332d45bdbe2a036656208d25bb0d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcreteWindowAggregation::run (cognitive 30): ConcreteWindowAggregation::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 6 (11 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). Of this number, 24 points are the body\u0027s own statements and 6 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/moonblade/agg/window.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed0cce615383fece7c8b9b71119da679625ca6c9febf496d70db7ab119f1515"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::scrape::run (cognitive 30): xan::cmd::scrape::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scrape.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"798c6f075e7e2e5fed0effa602d54fb02afaf0152d11590ec9716865e22d8212"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::sequences::concat (cognitive 29): xan::moonblade::functions::sequences::concat has cognitive complexity 29 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 6 (10 pts), match/switch 2 (4 pts) (nesting depth added 17). 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/moonblade/functions/sequences.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"178144c16f6d1218692af7f79d040ed6f47ecc2534ff3f86dd9a7a93b2e260ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::convert_ndjson (cognitive 28): Args::convert_ndjson has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/from.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"58afbb1766ef334d4a1cbd7f185d16bdc9ca955e6de22fe6271fb53fe81ccaa3"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::io_reader (cognitive 28): Args::io_reader has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"552198f862b64b966283e3002b4869ce8bca0866c148defa258ca64af04d56c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::inputs (cognitive 28): Args::inputs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scrape.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"092e418455f017ea347b1aff218a9ba24e0c71e72d5b95269804f25b7050dc9b"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphBuilder::write_csv_nodelist (cognitive 28): GraphBuilder::write_csv_nodelist has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f141778d9de7bae3eec439bfe295452ae9034bea23e2eda8d21dd5bea1daacd9"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowAggregationProgram::run_with_record_impl (cognitive 28): WindowAggregationProgram::run_with_record_impl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3430a266405dbe242431d6c0b9fa2958533d50f9d46a1d5a4be3e406149e115"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::fixlengths::run (cognitive 28): xan::cmd::fixlengths::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (9 pts), match/switch 2 (6 pts), boolean chains 3 (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/cmd/fixlengths.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8097d9e0a93810e506baebaf58fc6018703a9d5ec683b18d01f6e519b0d0c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::convert_xls (cognitive 27): Args::convert_xls has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), match/switch 4 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/from.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21c0a40f8a58ff2864c7483a9ad0e9b3fa7063d2468cb5f8443984fa3be1244"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::freq (cognitive 27): Args::freq has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac0d167defaa2c9165c4c52afb857a5c158842fbf2595619a3602da55e9b47"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::agg::window::concretize_window_aggregations (cognitive 27): xan::moonblade::agg::window::concretize_window_aggregations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (11 pts), 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/moonblade/agg/window.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba2abe799926b6c8f360da4c0371006ad58d5cd831f359110dc7aac8ee3ed10"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::temporal::parse_fuzzy_temporal (cognitive 27): xan::temporal::parse_fuzzy_temporal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc41dbbbe18e67b22e6cab324c70846e212d4cfc2b4e41a5d901ed7e3ada9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Split::next (cognitive 26): Split::next has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/separate.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb08192bb63892bbcae002dcc2e91c7d562aea260afa9af20121ca679d4ade44"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::run (cognitive 26): Args::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/slice.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"307bc2e0efafb17280b16e9f4df5bdc50a0ca40e4e2aafd6de58a3c7886b2e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Aggregator::get_final_value (cognitive 26): Aggregator::get_final_value has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 13 (20 pts), if/else 4 (6 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/moonblade/agg/program.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa0c6f01061ed9a3622e0d685df2f45716638cb6eecb9f6387a445b79abaf0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector::refine (cognitive 26): Selector::refine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7531374031d496ffb4f9e078daf7120dbbca116c1ce1fa0d11e0ea9eedc272c7"}},{"ruleId":"D2","level":"warning","message":{"text":"LRUStems::from_tagged_url (cognitive 26): LRUStems::from_tagged_url has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/urls.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47ce2cc204c15f8e6f23eb3d6ae4a3e5aaac4c73267d6c08b6d8a96387ce0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher::count (cognitive 25): Matcher::count has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a5bfa6ebde6161b5bb9dbb143dc22e5d33dea88fad44ee635093bd0c56617d"}},{"ruleId":"D2","level":"warning","message":{"text":"Splitter::split_cell_into (cognitive 25): Splitter::split_cell_into has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (7 pts), match/switch 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/separate.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be3898dd47250bfbb73775795d8e5e239b5cd2e2271f85f6b98d50b9e2c1872"}},{"ruleId":"D2","level":"warning","message":{"text":"Cooccurrences::for_each_cooc_record (cognitive 25): Cooccurrences::for_each_cooc_record has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f99a9f9bb64961ca13d93263d448c63c02ca61394ab7f03325a42bfd2cd383"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::count::run (cognitive 25): xan::cmd::count::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/count.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d6024b403bcdad5a6b0be5682b6cff1964d32746840e2a959a92d99598196"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::merge (cognitive 24): Args::merge has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 12. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/view.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0153dc844d4a863140400c4149de5be2b113297d56e94f6e9adfa03dd8e10bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"Sum::add (cognitive 24): Sum::add has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/sum.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaba3649e08af4603c3f84ef24b8eaaa4593dd2c0041974711e0b2d90313922"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::enumerate::run (cognitive 24): xan::cmd::enumerate::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (4 pts), boolean chains 3, 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/cmd/enumerate.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9e01bbf5caafb44e85bb1c81a5eac399044ef4e17d7776542f060840f12f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Stats::process (cognitive 23): Stats::process has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (23 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/moonblade/agg/stats.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71ca745460eb697b4a194e75ac45c21c3ac179f9ab72a48afbfc1011c1e111"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::cat::run (cognitive 23): xan::cmd::cat::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8 (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/cmd/cat.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcaaaa4e334a255414e82ed5f7eb9cf025807b6623cdc395943b7a2cc74f560"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::input::run (cognitive 23): xan::cmd::input::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 2 (4 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/input.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc94ed94bac56a706b736023aba26c675e2fd678f4283850e9768b3ebb058c0"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::progress::run (cognitive 23): xan::cmd::progress::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/progress.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6310d8e940840e827e84ef215e94fc34c7f5b9de2c5bb6c8decc0498523e6a31"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::run::run (cognitive 23): xan::cmd::run::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/run.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83e58e17a21682718df8c2f765fec166705a63bf0ae2fbf1705efa23c62974f"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::fmt::fmt (cognitive 23): xan::moonblade::functions::fmt::fmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/fmt.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33f1ba2f55ed4f62e4ed31c2ecdd61aac9242e2883ab893da0a44664176b853"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::bins (cognitive 22): Series::bins has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bins.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5b370d140284b64086306d3d705a4a1b01b60245a425924da43a44a8df1df8"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::correlation (cognitive 22): Args::correlation has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 4 (9 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/matrix.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10b7c402269c2ba310666ab71e7002591a43aa5870eacb4121b276804e46182"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::ops::add (cognitive 22): xan::moonblade::functions::ops::add has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 2 (3 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. This shape REPEATS in the file: one other method here (xan::moonblade::functions::ops::sub) 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/moonblade/functions/ops.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd88a299cad633cc33ab1a63e5a09b1be80a17cde868606906e978e574bba2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::ops::sub (cognitive 22): xan::moonblade::functions::ops::sub has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 2 (3 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. This shape REPEATS in the file: one other method here (xan::moonblade::functions::ops::add) 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/moonblade/functions/ops.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21381f193cc00ea33f7f5f4b411ce700d736fa9d936d7284d6ea7626af31724"}},{"ruleId":"D2","level":"warning","message":{"text":"Histogram::complete_dates (cognitive 21): Histogram::complete_dates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/hist.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"044456e5b2739601eceb2097177f622d996d20663ab20b4110fa66577fa01a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::join::run (cognitive 21): xan::cmd::join::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fd3afdfa5c2d79e599b9d2a054d6bfb60697aefa811187374eea627d939312"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::scales::ticks (cognitive 21): xan::scales::ticks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 4 (10 pts) (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3a239d74e3300437db4f7e0cec4cce7a371eb30c7393494ca6b7f6eb0d1f81"}},{"ruleId":"D2","level":"warning","message":{"text":"Histogram::compressed_bars (cognitive 20): Histogram::compressed_bars has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/hist.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"910f506f1c3b5f2a3bf8d7932431896e562fd0e51c033359f70a7c1be73a0853"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::fuzzy_join (cognitive 20): Args::fuzzy_join has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 6 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 6). 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/cmd/join.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7e834796ee815cfc47c7252779c02aa3cedcfbb5b3b951e500daf7a10189c9"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::select::run (cognitive 20): xan::cmd::select::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/select.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a258d0f579405bf28d63b7982f7da0db04ea7a2697ae47c3f7d6616c7d72d189"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::parser::pratt_parse (cognitive 20): xan::moonblade::parser::pratt_parse has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 3 (4 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/moonblade/parser.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"81952ded10e41b8d7b6b7b2ca28a84af6b8711c44873a086e4d4598219055ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::temporal::parse_any_temporal (cognitive 20): xan::temporal::parse_any_temporal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"982ac938dfe2d168a2b329c2304c473925455f6f3688e6653feda220b50461e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::cat_columns (cognitive 19): Args::cat_columns has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/cat.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7e884beab7361c1ff6702bb5b05408922e96ee22928506daf5d1eb353c4c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Exploder::explode (cognitive 19): Exploder::explode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 2 (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/cmd/explode.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"993fcad808241511fbc75be1cc22265f60c9cc427c41ee65ceffa61332cb0984"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::convert_markdown (cognitive 19): Args::convert_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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/cmd/from.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"142adac66f2bf2cabe69a155046f20d735f6b89f369fd0a4712ca1607535fd69"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::inputs (cognitive 19): Args::inputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa80ac0e8e1990654f373042ac986295bbf00d1afe820b0d1012bf02b1e4a33e"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnEstimator::infer_type (cognitive 19): ColumnEstimator::infer_type has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 6 (7 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/stats.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ff3af506aa7c2d8b710d97f32967b7513e5263be72a808bbdcd321760e30a"}},{"ruleId":"D2","level":"warning","message":{"text":"Vocabulary::for_each_doc_token_level_record (cognitive 19): Vocabulary::for_each_doc_token_level_record has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919fdf084711f3856c6e0d16c5c69bdf3edc2caf5ea8ad2584d35aa6d115543"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::new (cognitive 19): Config::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fec01d27d6a186f6fda89513d07b97c9c54ed13165fe9dccbe9b35b4c15d39a"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::io_reader (cognitive 19): Config::io_reader has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (8 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e11bc504dfb916528365ec6b7549fbd7725f7bc4f9d99dc029d05d901f0716"}},{"ruleId":"D2","level":"warning","message":{"text":"HeadersIndex::get (cognitive 19): HeadersIndex::get has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/headers.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3838a8f79e534d8ba64b2fee861ca07df66835ae9584d0cf0c89a65242a4fa6c"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::cmd::plot::patch_buffer_for_density (cognitive 19): xan::cmd::plot::patch_buffer_for_density has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (5 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0e2ea84be3c82b3cab609ea4047862766930a969bd9c06bb00d3578733d6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::agg::program::get_function_arguments_parser (cognitive 19): xan::moonblade::agg::program::get_function_arguments_parser has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e43ea9893f6620aeb9ec82d009ef1b43469536889eaae8f5aedbbc327f9b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::temporal::parse_maybe_zoned (cognitive 19): xan::temporal::parse_maybe_zoned has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"253a56be766182dbf371bcfe9c0eda3b94390e46839ce41963f77f248d16a24c"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::sorted_grouped_reservoir_sample (cognitive 18): Args::sorted_grouped_reservoir_sample has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sample.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd1179f8b8317ae6f4991859e5122cbc660d7274be09d90f00b432366262be2"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorParser::parse (cognitive 18): SelectorParser::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"54afd48243be6275fc6680e96f8b43be5b34c773b8fa3d829ccab36f7e37e03b"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::ops::variadic_optimum (cognitive 18): xan::moonblade::functions::ops::variadic_optimum has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/ops.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8875cb0f0f80bbd9a08648bb025bb58449cfcf531861f8a2bd64fad3501d56c8"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::scrape::concretize_selection_expr (cognitive 18): xan::moonblade::scrape::concretize_selection_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (6 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/scrape.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"549dc022842732853b72cf9b8d2c33855d0839c134fe4b589316fef6a5ac365b"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::convert_json_like (cognitive 17): Args::convert_json_like has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/from.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adefa2eaa233d091e1b9cabf742a8f11ccc1f504eb1b15b8275339e38fa8a72"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnEstimator::finalize (cognitive 17): ColumnEstimator::finalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 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/cmd/stats.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad37faddd4b3e3b86928101a322eb8911a8652fd9ed03f8bc95a7edbf4b8231"}},{"ruleId":"D2","level":"warning","message":{"text":"TopKHeapMapWithTies::push_with (cognitive 17): TopKHeapMapWithTies::push_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/heap.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8955aa3691280896805502cd5e7958627ccf59a2b7c8737021a51bc275df3753"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::temporal::date (cognitive 17): xan::moonblade::functions::temporal::date has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (xan::moonblade::functions::temporal::time) 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/moonblade/functions/temporal.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7555a1fe1a63c6fbd0b3590db2224aae358db29211d08d8f25ea3d8a99c7dba0"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::temporal::time (cognitive 17): xan::moonblade::functions::temporal::time has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (xan::moonblade::functions::temporal::date) 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/moonblade/functions/temporal.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9a382df6a1f356869d64077f8f94e129ea06a84f11513b13225d40a1256934"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::scrape::collect_text_inner (cognitive 17): xan::moonblade::scrape::collect_text_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/scrape.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd98d973e9c5e0f66fe056b9bb9babfbf8ac684cb21201b5792432e60b66d9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::parquet::human_readable_column_type (cognitive 17): xan::parquet::human_readable_column_type has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parquet.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"72051c857aceb6af15d23a2abf60f4f1a90d838109971fd7fae2267dc3b338b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::mark_as_temporal (cognitive 16): Series::mark_as_temporal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a12686993a3210663c2c65b092ed1986a56167060c7d3af42be80311f9f3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnEstimator::process (cognitive 16): ColumnEstimator::process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/stats.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"565755ba83ff9e82fa84c94a70bd8cdc05fe4adb491a411fe25d8a59afa13349"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::seekable_io_reader (cognitive 16): Config::seekable_io_reader has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"482c6a774707854ac52a513f92ca0aeb7b78ead6ede73151e7b0826290388491"}},{"ruleId":"D2","level":"warning","message":{"text":"Numbers::dist_sparkline (cognitive 16): Numbers::dist_sparkline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/numbers.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f563c6c77daf0786ddb65e4805ef808f3510b6b64c9855a5faee2cb071889f"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowAggregationProgram::flush_impl (cognitive 16): WindowAggregationProgram::flush_impl has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"679dfc0a88bdbfaed65d44f80d0d6c1c763ab72422dd391ace2ece54ba6b1033"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::maps::get_subroutine (cognitive 16): xan::moonblade::functions::maps::get_subroutine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/maps.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa3ec2ee89f50e1d8049ff18b4bab77e4b323a54eccfee85fa14518eea67898"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::sequences::range (cognitive 16): xan::moonblade::functions::sequences::range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2 (4 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/moonblade/functions/sequences.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d1cf4b3eba6df868ed528611360c68e61c0bc5e7f8683b0cb0669a15c3b4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::moonblade::functions::special::abstract_comptime_col (cognitive 16): xan::moonblade::functions::special::abstract_comptime_col has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea0aba3dfa95daa5a85e9df2048384a8b64820baf44d852429cf63e09776720"}},{"ruleId":"D2","level":"warning","message":{"text":"xan::scales::tick_spec (cognitive 16): xan::scales::tick_spec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee0af82d6eaf2733dec766af431da4be437d42c686e8c91bc282ae713d2871"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::spark::run: FunctionTooLong \u2014 xan::cmd::spark::run runs 478 significant 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 378 over it, 4.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/spark.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faf82646f2b09ce682177bb313286de9f8c92cbf569506966628664f1ae5142"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::plot::run: FunctionTooLong \u2014 xan::cmd::plot::run runs 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) in one body. The bar is 100 significant lines; this is 322 over it, 4.22\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/cmd/plot.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c37d1d6695afb3cbcb575ca7b2543132eed229e138a13ddbadddba47cf1d10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::view::run: FunctionTooLong \u2014 xan::cmd::view::run runs 406 significant 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 306 over it, 4.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/cmd/view.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"674300338a5e65c7371759dd136d5eeae2bd3dbc20f6fc7170eab68184479534"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::search::run: FunctionTooLong \u2014 xan::cmd::search::run runs 402 significant 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 302 over it, 4.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e707783bc552ffebfaef53771e0fa1077d4e05cac003212f989f6e33a8d633"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::stats::run: FunctionTooLong \u2014 xan::cmd::stats::run runs 343 significant 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 243 over it, 3.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/cmd/stats.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b9b5063d0a014f07ef398a836f1e57cfa5baba61e348b1defe5d022416e1fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::sort::run: FunctionTooLong \u2014 xan::cmd::sort::run runs 274 significant 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 174 over it, 2.74\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/cmd/sort.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cd7e1f83e4bb922955742e775cfb055047a8e2e70a8a4653e378e4cecd7f30"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::dedup::run: FunctionTooLong \u2014 xan::cmd::dedup::run runs 259 significant 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 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/dedup.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"79384f7109ec0614d8396f5c93223e227b978e4f26050ffc811ce75f433555e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/search.rs: FileTooLong \u2014 1291 significant 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 791 over it, 2.58\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/cmd/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf97e4a4b173d579a1041a181dad3947d57a93bc3830155cc56fc9ffd295637"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::moonblade::functions::get_function: FunctionTooLong \u2014 xan::moonblade::functions::get_function runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"276fba5805d6e62f85aff73700e887896fda8cd21f0c8b31df2bb9f4ec1d1b12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/plot.rs: FileTooLong \u2014 1266 significant 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 766 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade0674d42f3c0179d31c0f8d84e564f98ddff209a8979de1fa75dfd3f6d967c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/spark.rs: FileTooLong \u2014 1244 significant 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 744 over it, 2.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/cmd/spark.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7ff99c4bd5fbd60e66de61f118779f6a815384728e14e1c44ec70de6199493"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agg/program.rs: FileTooLong \u2014 1241 significant 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 741 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86ea9c1136044f3b66908f67faf7c99992e2a174d1160d2a1239364b1ae8204"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::separate::run: FunctionTooLong \u2014 xan::cmd::separate::run runs 241 significant 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 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/separate.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9b50180f5c15a2a583f05f4dcb944c58b9360e33b217794dec411fd03d40e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::tokenize::run: FunctionTooLong \u2014 xan::cmd::tokenize::run runs 235 significant 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 135 over it, 2.35\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/cmd/tokenize.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b277bf76b5d7685561d67521e7033ee4e8dc3c22b59ed90451ac225537be1c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::heatmap::run: FunctionTooLong \u2014 xan::cmd::heatmap::run runs 234 significant 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 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/heatmap.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad344287d0c7a825c0f398905af849f12b8e4b4e7914552eaa129265f74dd49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/parallel.rs: FileTooLong \u2014 1166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Args (2 blocks, 679-1797). The bar is 500 significant lines; this is 666 over it, 2.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a9a653f620f6555dc9037bacc9bbff1877f0eb9e72bd90c67886fa37201ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Aggregator.get_final_value: MethodTooLong \u2014 get_final_value runs 218 significant 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 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8589f9cbb8b9f6fb2cbb8d1b6c055c27f56bda571f96b8cd81d5d56e14a742"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::vocab::run: FunctionTooLong \u2014 xan::cmd::vocab::run runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0eda78fb53f2ce37c58fafdc2566f03816bf962a4f2ee249af9a9ed1406030"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::hist::run: FunctionTooLong \u2014 xan::cmd::hist::run runs 203 significant 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 103 over it, 2.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/cmd/hist.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b349e86a90a21120e255c85d942454c6070a99f9b9a2a5166ef83df0ae02320d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f93f1251193e018a9bb40108f2ec60d7828427a23f5b442efa46b16b5f34b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::complete::run: FunctionTooLong \u2014 xan::cmd::complete::run runs 186 significant 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 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/complete.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2351108498783bc07a5868184965d291d93903a2640692b314da0896cbcbea1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/vocab.rs: FileTooLong \u2014 906 significant 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 406 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f5b1da10e009bdc7b75b3baed1b8a0e5531200eccec6c61f229b42df60eb6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::flatten::run: FunctionTooLong \u2014 xan::cmd::flatten::run runs 181 significant 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 81 over it, 1.81\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/cmd/flatten.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf1473123320f2e8641d8b3938759cdee3586fcda6fe8146478a2bf667fe965"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::frequency::run: FunctionTooLong \u2014 xan::cmd::frequency::run runs 181 significant 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 81 over it, 1.81\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/cmd/frequency.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a5f9a49f19046c99a6b4cc66175f1d9125789564dcbcaf2378636c532415b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::moonblade::functions::special::get_special_function: FunctionTooLong \u2014 xan::moonblade::functions::special::get_special_function runs 179 significant 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 79 over it, 1.79\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/moonblade/functions/special.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf4f149134d388627c6ba207bdf34c4f76c473921fe2dc6704aa3e66c9c0169"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Args: ClassTooLong \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), 16 methods, 2 blocks, lines 679-1797. The bar is 400 significant lines; this is 310 over it, 1.78\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/cmd/parallel.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab1396568f7b4441b90963366af33fba2e42320e86c0a898c95871bc6ceafa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/scrape.rs: FileTooLong \u2014 864 significant 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 364 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scrape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc4456beddc90d73216ad9bc2021980d66f6477471c4496b31dc424b7d62319"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::groupby::run: FunctionTooLong \u2014 xan::cmd::groupby::run runs 169 significant 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 69 over it, 1.69\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/cmd/groupby.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9950903a037458c1fa474d14eff51e5dfc7326da3b8822d779755dc307ae6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/join.rs: FileTooLong \u2014 834 significant 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 334 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9088623aa8d9dcbe7833bccfdffd96717c67d34cf7974d3cde895a498ff769d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/view.rs: FileTooLong \u2014 826 significant 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 326 over it, 1.65\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/cmd/view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d81e1694302f600f830048949835360c4cbcafb1e31b87d6799d7be5d2d4fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agg/window.rs: FileTooLong \u2014 816 significant 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 316 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48899f8e9c389da3fb7b58fdcfdfd0990a60dd6e0e830b4bc415180ff82a3ced"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scales.rs: FileTooLong \u2014 774 significant 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 274 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7179099fe0de0db64a4abe851bec460fbb8ef7526543a9ed07867a7d134aae54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Selector.indices: MethodTooLong \u2014 indices runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62cf09def7278814281b9d28228a44a4723c89b975b2d46fb965629327996cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/stats.rs: FileTooLong \u2014 729 significant 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 229 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e3f61cb05b080780d29bb1c747882c788e3aad95613cecee0a1aefcb5cdeed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: GraphBuilder (2 blocks, 325-1085). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306b27e0abe93660704d9a80e5f0e6b6ef28249457e0d9c4c20e65a3ee82f335"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::headers::run: FunctionTooLong \u2014 xan::cmd::headers::run runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/headers.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ce20e15ed61751ed1a494804947537e68f405d469af19403c56a0bffe6da0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 41 stored fields beside 16 methods. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ff31a6944f3f80af2c97ceeeee7077f3cfed55392fcd8434552150fce0bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::window::run: FunctionTooLong \u2014 xan::cmd::window::run runs 136 significant 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 36 over it, 1.36\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/cmd/window.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6db8d172e2d13d61a72d67ad8e78b7cdc0addd6fe51a3037d477cb4733899f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::rename::run: FunctionTooLong \u2014 xan::cmd::rename::run runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/rename.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35031f2572c4d09ecbbbea1f365df24e9b54c6d6b4c7711ae48005169c7bc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DynamicValue: ClassTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 30 blocks, lines 36-927. The bar is 400 significant lines; this is 124 over it, 1.31\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/moonblade/types/dynamic_value.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e4f203f46c0d699aa3d6f89c3b8ff06e7c1508bd67975f90a23050a61726a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/help.rs: FileTooLong \u2014 652 significant 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 152 over it, 1.30\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/cmd/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5b5a14752387600f1e4f5655fad0cd31b1608a161b5d8f66104eefceee76b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::moonblade::agg::window::concretize_window_aggregations: FunctionTooLong \u2014 xan::moonblade::agg::window::concretize_window_aggregations 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/moonblade/agg/window.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9afe8c4eba074e5981439c4513af642f885b21170ece46bd9ba774fc5a13f27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/dynamic_value.rs: FileTooLong \u2014 639 significant 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: DynamicValue (30 blocks, 36-927). The bar is 500 significant lines; this is 139 over it, 1.28\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/moonblade/types/dynamic_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b227d5fedfc276000e902dda8cb44e0f7106782f3e5717509bc09916e2cf11cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 38 stored fields beside 3 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca085e19895aec115923de096ee759956223b808eeb9cb1de12c29b0c0558ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 38 stored fields beside 3 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/spark.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a5faf9fe12f70d5e9ec6b9e5dd7f23fa8251a696d25804804c95817c3d9ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphBuilder.write_gexf: MethodTooLong \u2014 write_gexf runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb869f28f2b312d06123f37e9bfe9d0bdc70e9cf5dbc6b36c712f845b693c19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcreteWindowAggregation.run: MethodTooLong \u2014 run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1066065f3a4a6519988397b263fa4df5fbd6c3e6ea861788c53960a3579fd2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphBuilder: ClassTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 325-1085. The bar is 400 significant lines; this is 101 over it, 1.25\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/graph.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9e3f38100ebc59556ca615694e75313d1fe65499f598d5c5b94a24e5732bc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/select.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b46322caa80e563183432ee8576290afc81a67f565c5fe1ff68f886a1ae789"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Args.io_reader: MethodTooLong \u2014 io_reader runs 125 significant 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 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b4ac5fd52385ee40613444dc2be2f4c81d3a25ad61eac0dcf526f630bd82d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Args.build_matcher: MethodTooLong \u2014 build_matcher runs 125 significant 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 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e06c3c449d01c5db0ca19c288f5af705ee7d649541f71ba93b39871b304f67"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 2 blocks, lines 184-918. The bar is 400 significant lines; this is 98 over it, 1.25\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/config.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccf199d05dfd81f832d4c728ff3d34103b42b187e57cdb3456dcaa021bba549"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 37 stored fields beside 5 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7370e94e86460f262a6b2d91a3dfac70557020d16dece6d1e2b8c6fc155fce9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 615 significant 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 81% of them inside a single declaration: Config (2 blocks, 184-918). The bar is 500 significant lines; this is 115 over it, 1.23\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/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4945c3bcfb06e8e0bf42248c5194e236ebe17412d594290e36ced9b966a475"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::explode::run: FunctionTooLong \u2014 xan::cmd::explode::run runs 122 significant 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 22 over it, 1.22\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/cmd/explode.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"423633663d0b72f2865c4c49bf5bc13ca59ad533b21e810cf0e20a0f83c84dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::moonblade::agg::program::get_function_arguments_parser: FunctionTooLong \u2014 xan::moonblade::agg::program::get_function_arguments_parser runs 120 significant 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 20 over it, 1.20\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/moonblade/agg/program.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"711c9c38d0549967fd9f0070419f7eaf3654975aef7b3261ab7dfef88f15b6ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/separate.rs: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/separate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c074388796e1230a5cbf3c7c5649bb4a41db92d7ca7fa930d52e2929778810ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::map::run: FunctionTooLong \u2014 xan::cmd::map::run 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/cmd/map.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e1bf99782a3d9b3e0eb9f77ec29803e1d5052433a84121fefc25f554c0bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Args: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 465-1169. The bar is 400 significant lines; this is 58 over it, 1.15\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/cmd/join.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195673368682a98a76ac44a1595b961cd268395d0fa0118d79f055fdb9e0f94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/from.rs: FileTooLong \u2014 568 significant 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 67% of them inside a single declaration: Args (2 blocks, 205-814). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/from.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe93e24789bfb36dfec8ede91eb19c85ccbfd9ed2863944d8981779fb7ddc1f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 34 stored fields beside 2 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/tokenize.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae71d15656be807baf093986129559f8045ffd0d6c96aa091583bb5a5b8b61a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: moonblade/interpreter.rs: FileTooLong \u2014 564 significant 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 64 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/interpreter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a413ec64a9c656d2c85a8f7ddd92dc277ff69022b8a1c07dbec4fe17e6771bf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.rs: FileTooLong \u2014 563 significant 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 39 free functions. The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcdcbd86204b9dea98960289f403d15e4e155e4a7c3a35e6e73c2b9594d5e4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: moonblade/scrape.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/scrape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43882652868e943b59bcca45a60cd9182dbe6dc10a156e69437df52cd3ad5fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/heatmap.rs: FileTooLong \u2014 557 significant 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 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/heatmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0526781decefa1853e96f23874fcde2b749295b66c3a7fe972ea06acf6344014"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: functions/special.rs: FileTooLong \u2014 557 significant 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 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c4207db7631e867a66f4daea5466d1ddb278a2522ed68d1ef729d705ca37bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DynamicValue: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_value.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f175a04abd4fddc9f7692dd8fc9801ea5537083a2579c737532d2b3c56e62c76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Args.edgelist: MethodTooLong \u2014 edgelist runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/network.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbead262049ac0d95cf44050b92f03b08454a86625d643ad6cdaf008fbbbae7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::scrape::run: FunctionTooLong \u2014 xan::cmd::scrape::run runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scrape.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e510b928e633c8a1775ebcf18a351873b4b22b3a6f0a22a3dce0eb0aa27cf40e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SparklineRenderer.render_impl: MethodTooLong \u2014 render_impl runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/spark.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3aa562d26464c14d0ca16f5fd5ec23dd223cfd2e2bb2228a3b4091dda6a3b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BoundArgument: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/bound_arguments.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ddbccbf873091fc12cae879ef67c83af58040d01f02726db9be838f2c58e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::bisect::run: FunctionTooLong \u2014 xan::cmd::bisect::run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bisect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3976bb4bdff1aa4ea7b05f32452bd44e325067205cf18829961e3bf686dba60e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xan::cmd::top::run: FunctionTooLong \u2014 xan::cmd::top::run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/top.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee41def636c6f394113962db84024bf742932c1fd2e5740da3e92882c4966d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompositeAggregator.add_method: MethodTooLong \u2014 add_method runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebad70fba076cd08b4c4e0100dc0d9c2d951e66c9296b12a59fe06016563386d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/json.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01769c353afb4691886553ca1f58bf69d6eef934c514cffe1c5404d91a97cb65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Args.cat: MethodTooLong \u2014 cat runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bb3c81bf3fd2516b2747fda4d87732fc4bcb719d586c0cf2a9ed42915ef4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/cmd/vocab.rs:982-1032 | src/cmd/vocab.rs:1034-1097 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"40037405a43a20675cc4e17199f2a1df0c9a7c2d268a3e49b6438c777e2a8716"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/cmd/parallel.rs:1175-1342 | src/cmd/parallel.rs:1448-1491 | src/cmd/parallel.rs:1493-1538 | src/cmd/parallel.rs:1540-1603 | src/cmd/parallel.rs:1675-1755 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0037faafb9b5371420c6b1f6775d3bc95c7e9510ad2b9da2a16425c79cdeb831"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cmd/join.rs:667-699 | src/cmd/join.rs:701-756 | src/cmd/join.rs:758-803 | src/cmd/join.rs:805-850 \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/cmd/join.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5809b715349fa8a817dcece1c0c1769cbc83790f20d0ef9b7c5094f9847ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): src/cmd/search.rs:411-491 | src/cmd/search.rs:498-568 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f97069761c607250644d34163a3743601af4e0311d32f4f3cc8b9f1b684c102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): src/moonblade/functions/temporal.rs:73-129 | src/moonblade/functions/temporal.rs:131-187 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/temporal.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15291e6b0e813230829d592cfa6552cbb37e43f21aac78e6c8bde663375d101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/moonblade/types/dynamic_value.rs:883-903 | src/moonblade/types/dynamic_value.rs:907-926 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_value.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7ed59ec70180340d8000c63a19db5c9092528912c8f0d310454e3acfe65117"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/temporal.rs:381-425 | src/temporal.rs:444-492 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0318a7b5f0f5566b1b1502a85a922be25e0f6604693303cc330e73efd9197da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/moonblade/functions/ops.rs:33-60 | src/moonblade/functions/ops.rs:62-89 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/ops.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"89223fe8c620fd2ba7aeb72bddcdbdc71e54a941fadea105dc414fc186c8229c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/cmd/sample.rs:179-222 | src/cmd/sample.rs:333-387 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sample.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc40dfee2b53e34dcfd83e86e1f8a2eead268c95ff0425923e7954a314c24583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/cmd/to.rs:180-223 | src/cmd/to.rs:225-264 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/to.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8077e5ca165005e0a57394d9b66f1d39785a67c41c77852c1fc0484909fd7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/config.rs:654-689 | src/config.rs:694-739 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa8e7bf931ccdf8ffec569485916de66dbeecd1ddf93c6141bd75614fc0f442"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/json.rs:358-403 | src/json.rs:471-516 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/json.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d051a23ae7ad7b8f0e545eb360d07b123172fe2d41b8bb9ac814d707fd486b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/moonblade/parser.rs:684-714 | src/moonblade/parser.rs:725-762 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/parser.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b4709c4775b32e8cbe6cfce2fd605909f5125d28c76228bc1f7a301a686c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): src/read.rs:18-45 | src/read.rs:50-77 | src/read.rs:82-112 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/read.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482aab224c8670a0ae2bc391ffddb3717b8a173a336d3551a24b28a8657b12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/moonblade/types/dynamic_value.rs:477-492 | src/moonblade/types/dynamic_value.rs:526-544 | src/moonblade/types/dynamic_value.rs:546-561 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_value.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb2de083cc7c91417438ee93c1168537ad16968b011827e08c5a128d1d2aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/cmd/help.rs:149-174 | src/cmd/help.rs:176-203 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a567f74d6bcdc90e88df2e56789ff03869551de1bc839d174a9be3e7595ff2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/moonblade/functions/io.rs:170-191 | src/moonblade/functions/io.rs:193-216 | src/moonblade/functions/io.rs:218-241 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/io.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7195a794641259b43710450d6089cd27af66af674a65f480cb42aef8bc26195f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/moonblade/functions/sequences.rs:101-115 | src/moonblade/functions/sequences.rs:117-131 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/sequences.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96c219da097924f829ccc1df58435c0650051ddeaba8febccdc13c7c40682ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/cmd/help.rs:544-571 | src/cmd/help.rs:573-600 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b4889b070909420ff7ff13969cbb15ece1b72705cc0227fe587a32909b962"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/moonblade/interpreter.rs:650-667 | src/moonblade/interpreter.rs:673-690 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/interpreter.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba0da41d88348085cf147dfad327f48a7914da9e23cb56d781c886e276fb61e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/utils.rs:514-531 | src/utils.rs:537-556 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8e5dfa51f684baff7035bfec5495e7f433988987388c3779d70d5231d251a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/moonblade/functions/special.rs:462-480 | src/moonblade/functions/special.rs:482-500 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"727d3bbdebef9c618d67e9b9c2612daef5351358c91c08105acd9e025ce1a44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/moonblade/parser.rs:491-513 | src/moonblade/parser.rs:515-537 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/parser.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7c8dc2054b566fcf33bc1a2736db08b9a0d5da795cfa61af42c59d59c45e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/moonblade/types/bound_arguments.rs:170-184 | src/moonblade/types/bound_arguments.rs:187-201 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/bound_arguments.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"880b273188362fa01b415bfd7912d9c5664f8dc632feeaf439587c771c26c4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/collections/context_buffer.rs:51-72 | src/collections/context_buffer.rs:82-103 | src/collections/context_buffer.rs:130-151 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/context_buffer.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e417ae56d3afda46b93905fa4236ce5e220ffe6c8df34d76939fa4f0ba2497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/graph.rs:202-215 | src/graph.rs:226-239 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e3995f234df91d48caf63b1ea6f60258b91864440a720c8e2c3cdbd06ed06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/moonblade/agg/program.rs:1555-1574 | src/moonblade/agg/program.rs:1776-1797 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b277fd00854ad0a6a16518da62e2a60ea0e45bc8de2a2880e9d87ab3886ecbff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/moonblade/functions/temporal.rs:212-231 | src/moonblade/functions/temporal.rs:233-248 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/temporal.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52b7dd7c0de95d72f31d96e79bffdede4704573dae6dae0d17ea05f15e3fac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/moonblade/agg/window.rs:28-45 | src/moonblade/agg/window.rs:88-105 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"077429217475a7d51b30337cb4da4112f73d2780e1034c8e8f7e2a0aeb31c78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/cmd/sort.rs:564-576 | src/cmd/sort.rs:583-595 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sort.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf51cb7676533b7a7fefdb7662ff2c786b8c6cf4a061d1edabc5ed9f9cfc7345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/collections/heap.rs:103-121 | src/collections/heap.rs:187-205 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/heap.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f75404bfd9b268910c40dc360defbab59cb564b0d4ac850677b89c4b180223a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/moonblade/types/dynamic_value.rs:382-397 | src/moonblade/types/dynamic_value.rs:399-414 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_value.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5c9e874bd903ebef178d1f63dfd79b9a5cc8659aba776d76813a0c3282c886"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/moonblade/agg/program.rs:1607-1626 | src/moonblade/agg/program.rs:1723-1742 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"45641f6dfface43204dd95a405dd7b5770ff13cd7b61e8090a5d20b16535d17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/collections/heap.rs:83-101 | src/collections/heap.rs:167-185 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/heap.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a2b920bd67bae74a880d3afc2e588658cab87d5f2ce24aef0edea986f52ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/moonblade/types/dynamic_number.rs:176-187 | src/moonblade/types/dynamic_number.rs:200-212 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_number.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c670cb3406d574c8ed8694d9ec642e83efd09d9d324067aee244979b6dd20b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/moonblade/agg/aggregators/frequencies.rs:74-85 | src/moonblade/agg/aggregators/frequencies.rs:87-98 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/frequencies.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"448db35fe3ee785579e48eb5a72793e8ea9e83405cbc0d37980b08bd12476cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/moonblade/functions/strings.rs:60-68 | src/moonblade/functions/strings.rs:70-78 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/strings.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faa1e10c81d550f3379974178e0c7b5c46b679b726f2be24474c53821b74fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/cmd/head.rs:36-47 | src/cmd/tail.rs:36-47 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/head.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2740ed28b975d07b067925b2eb5aa4e4b93bbcb4d194130699941860b7fd922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/moonblade/scrape.rs:803-813 | src/moonblade/scrape.rs:821-833 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/scrape.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"5654afc5c557f1d1379c1ccc96445a0c71879c230e9316feff99279bc6792965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/collections/context_buffer.rs:35-46 | src/collections/context_buffer.rs:108-120 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/context_buffer.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c394b2353561d1b4fc2f74d9afd7ada7e485d1a4ff9abe8a1d82df0d1a656e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/moonblade/functions/special.rs:502-518 | src/moonblade/functions/special.rs:520-536 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e441a805298bf4690197dd96676cd76f32b7df16767abb219afc36c23bf6c3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/moonblade/functions/temporal.rs:200-210 | src/moonblade/functions/temporal.rs:250-263 | src/moonblade/functions/temporal.rs:265-277 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/temporal.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7a324e2af1b0cb39052ae9cdcd871ffb2d9745a2fffe5185860d8e8dda9010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/json.rs:231-239 | src/json.rs:268-278 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/json.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"15702b532ae19d9d2541b078fcac47207670a60ebc52585254118ea6d1ae1000"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/moonblade/types/bound_arguments.rs:243-255 | src/moonblade/types/bound_arguments.rs:258-267 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/bound_arguments.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4088b84d7c7fe478c369d5a591a030dccbecebb843e8b9cd39c3792e07e1d360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/moonblade/agg/aggregators/first_last.rs:30-41 | src/moonblade/agg/aggregators/first_last.rs:66-77 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/first_last.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b5ac5a5fb3579be1cae41e1997707d4006bad42370705d2b48b9597c2d2320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/scales.rs:1132-1142 | src/scales.rs:1153-1166 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5e50ae04b7ff93c173afdc8750d89dbaf073835c272e644416c702983befd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/temporal.rs:126-133 | src/temporal.rs:135-142 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ec42369182cf1e46d5a6dd466e87f66831bf560ea33907937af27e496e67fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/moonblade/interpreter.rs:762-774 | src/moonblade/interpreter.rs:781-793 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/interpreter.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd631796ce250e226c8e4ff4e7c3ffd05c0a7493883c1f6d615ba224190734b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/moonblade/types/dynamic_value.rs:643-657 | src/moonblade/types/dynamic_value.rs:681-697 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_value.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8c2607530998340fa14c07bb17ea26b8cc3bef40eb51e7998d6d2c270b6867"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/moonblade/agg/aggregators/welford.rs:22-33 | src/moonblade/agg/aggregators/welford.rs:48-63 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/welford.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8edbbd58b4d3a3de03f40e119617af254823278881eef8ad072d7161255ea12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/graph.rs:393-403 | src/graph.rs:409-419 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ff429dcd9a2f865a1bbc26019e1d384d19a7800900af60e060b64d7ac2e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/cmd/help.rs:78-95 | src/cmd/help.rs:97-114 | src/cmd/help.rs:518-534 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e13874b7e078fe48c5ddade3848e20b0d2ab752ca137ff8f0be35d75b43c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/cmd/help.rs:321-332 | src/cmd/help.rs:334-345 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3de4bc9cec8082b7a5f88327c072c8c4aad4f171c0525985c5a5174942704f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/moonblade/functions/io.rs:18-26 | src/moonblade/functions/io.rs:28-38 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/io.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2b6306bdeb5285abd685a797b5fdc12b4d3f638fbba961c6ba25697b6e7b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/cmd/matrix.rs:198-205 | src/cmd/plot.rs:1130-1137 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/matrix.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f251cc104a1323ee32ade4afb815059d0f0ecad5dd61d8f5095f22a99677b8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): src/moonblade/select.rs:113-150 | src/moonblade/select.rs:157-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/select.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a611d1171d06462b98f62b5094b9abecdca1c0be788c6712d173f8b0857f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): src/cmd/vocab.rs:906-933 | src/cmd/vocab.rs:984-1011 | src/cmd/vocab.rs:1036-1063 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060usize) -\u003E (f64\u0060 in one and \u0060usize\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48733b2c49efced88cc69c04a68238ff5ca6297183c8bb8419756820abbcd9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/cmd/stats.rs:839-863 | src/cmd/stats.rs:920-944 \u2014 both copies are in the same file, so extract the block 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/cmd/stats.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"078e1fb8b5548c659d997f50ce8e72a53b892e0b647a0f9834c49e12b9764aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/cmd/to.rs:181-204 | src/cmd/to.rs:226-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/to.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a78328004bbc55aa2412570456d57494d197a2c88a315cf9eb261c464d6085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/json.rs:380-403 | src/json.rs:493-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/json.rs:380\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/json.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c981ed42642ce3a1afde6cf98f52f93e0953a1551c990c76c7a1a87b7736fd16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 3): src/temporal.rs:401-419 | src/temporal.rs:468-486 | src/temporal.rs:538-559 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/temporal.rs:538\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67d9cc03be4c5727fa59fcfa64b5c009357f9a285484588a8df255898a476b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/read.rs:25-45 | src/read.rs:57-77 | src/read.rs:92-112 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/read.rs:25\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/read.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5298b7b4ef457412d4a24a9d5f76793663d7971a9e37087d99b272cefe77f297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/cmd/parallel.rs:764-783 | src/cmd/stats.rs:530-549 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f600447ce85a6cb4ab25e2078bea05af8726dae77a3b92a94413a74b825aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/cmd/vocab.rs:940-959 | src/cmd/vocab.rs:1065-1084 \u2014 both copies are in the same file, so extract the block 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/cmd/vocab.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2025339f6b8ab5d56fdc8d0f2d126458cbb865530a5b8c6e5674b25b1c23bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/moonblade/functions/special.rs:623-642 | src/moonblade/functions/special.rs:650-668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/special.rs:623\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c803684840e6939502b51cabe486db9c7fc327c333c88ba03b44694571d1a2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/moonblade/functions/temporal.rs:17-35 | src/moonblade/functions/temporal.rs:74-92 | src/moonblade/functions/temporal.rs:132-150 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/temporal.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/temporal.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f477d0288b97b0fa71e796ebb6cab387f97e31574dc36b5516d338119f2fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/cmd/complete.rs:386-404 | src/cmd/complete.rs:454-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/complete.rs:386\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/complete.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5315eaab0b73cc2840841a755592c436be78b87efc95c4beac7efa6b838c2895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/cmd/join.rs:769-787 | src/cmd/join.rs:816-834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/join.rs:769\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5f959b7c39fc4c5d0fd5534799368db10ef16b81d44c68694bd25d369f385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/cmd/map.rs:204-222 | src/cmd/window.rs:237-254 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/map.rs:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/map.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"add1be86bbe553bd7dd06dc1ba76c7181def1f17067b4ec22929e5e5ee245d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/cmd/search.rs:1612-1629 | src/cmd/search.rs:1789-1806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1612\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"031f79af359b594ca4913ee74477620a3c4a8bad338a380f26d818afaa13dfa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/moonblade/agg/aggregators/extent.rs:44-59 | src/moonblade/agg/aggregators/extent.rs:238-253 | src/moonblade/agg/aggregators/temporal.rs:84-99 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/extent.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea81edc4b54558b22ad56b1de4f4e7af5a60edf51bc748a033b23da1972be6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cmd/matrix.rs:483-498 | src/cmd/matrix.rs:505-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/matrix.rs:483\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/matrix.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"13653e0705ac26b27ed8572cd9ecca406c34488d7fbc02e88be02e70f68dfdd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/collections/context_buffer.rs:52-67 | src/collections/context_buffer.rs:131-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/collections/context_buffer.rs:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026T\u0060 in one and \u0060\u0026[u8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/context_buffer.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b3af5c41513ef1c5fa94ea58f90c63967ee32232657001a06cb5c7d453f64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/graph.rs:1014-1029 | src/graph.rs:1045-1058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/graph.rs:1014\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"755eff93cf9ab6b376fadd68c984ae0e16162db45728e09556f3225cb3171d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/moonblade/agg/program.rs:252-267 | src/moonblade/agg/program.rs:291-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/program.rs:252\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a902d4fddb32bb10a2b9c8690500245c30558396c26787460fcd753959ff041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): src/cmd/join.rs:668-682 | src/cmd/join.rs:702-716 | src/cmd/join.rs:759-773 | src/cmd/join.rs:806-820 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cmd/join.rs:718\u0060 calls \u0060get_padding\u0060 and \u0060src/cmd/join.rs:684\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a5e8de85010b9b6b89e9f211953ef7f053aefce18592340e75d4dda25169cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/moonblade/agg/program.rs:329-343 | src/moonblade/agg/program.rs:383-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/program.rs:329\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0abc479c01477b43239e0dcb691dee3ed4e8b62a7479970b379e2fbb03436f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/cmd/plot.rs:904-917 | src/cmd/plot.rs:1050-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/plot.rs:904\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"983852514da72b0bff07e78a3298a4de277bb38974952cc96effec6604422bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmd/sample.rs:203-216 | src/cmd/sample.rs:367-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/sample.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/sample.rs:365\u0060 calls \u0060insert_with\u0060, \u0060with_capacity\u0060 and \u0060src/cmd/sample.rs:201\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sample.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e6ce076457fe34b13ed3c9c9a5a480666e4d954d50e22f2db0d1cbbf2ee1d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmd/search.rs:1641-1654 | src/cmd/search.rs:1664-1677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1641\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c25ab6f4158764404a71e47a76d696b77c42533bcc60212a2a7d1d2ba228c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/cmd/search.rs:1661-1674 | src/cmd/search.rs:1836-1848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1661\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4188470db1741e85b869b38949568e761b8fe2d3e7781d9f76ff1586a8361fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmd/search.rs:1817-1830 | src/cmd/search.rs:1838-1851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1817\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e53a808f9fedc76812ea9bea66f02886077fe1dd122c185f2e67f247a9a2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/moonblade/agg/program.rs:883-896 | src/moonblade/agg/program.rs:911-924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/program.rs:883\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"3927b5d27de4845528d7dab3b6aebd4034a2485d659ec0d4148baa65dc3dca14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/moonblade/agg/program.rs:1608-1621 | src/moonblade/agg/program.rs:1724-1737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/program.rs:1608\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72488fa4268cb4f268c7e98c6872bea3d77c2f831b66733f453d0d1dbd87462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cmd/search.rs:1639-1651 | src/cmd/search.rs:1815-1827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1639\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"263a8d969f690a4fa0af5caf79e2d4cb0398dc1571eb9c8461c3bd718871ce08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/scales.rs:932-944 | src/scales.rs:1067-1079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5e866557c2d13be4c49eef6c7180c464e912546b9de2e1c6f4545541cf0e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/cmd/agg.rs:236-246 | src/cmd/groupby.rs:216-227 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/agg.rs:236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/groupby.rs:215\u0060 calls \u0060Some\u0060 and \u0060src/cmd/agg.rs:235\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/agg.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"57567802ad896e46e64bd0fa3ff65579f72cb3bb03c4736f487fef2dcc5d7752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmd/frequency.rs:185-196 | src/cmd/stats.rs:590-601 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/frequency.rs:185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/stats.rs:589\u0060 calls \u0060as_ref\u0060 and \u0060src/cmd/frequency.rs:184\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/frequency.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cd2241c8edd081b57a051789dab22f573e00f2d3bbb0049eabb1ba779f7c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmd/scrape.rs:542-553 | src/cmd/scrape.rs:557-568 \u2014 both copies are in the same file, so extract the block 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/cmd/scrape.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf317eb794eb86ff407ba0fd73f59e27d0377baad27848169f6085c941a4446f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmd/search.rs:414-425 | src/cmd/search.rs:499-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:414\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd9b46ed0ac321a1f6d62b1a00bc20f18f6867d5f26c1e0d64c91804d672216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmd/slice.rs:223-234 | src/cmd/slice.rs:255-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/slice.rs:223\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/slice.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efa0b038ce778dde90a238f3d3ddb0f597273b0fa414ac55e98b4613845bee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmd/vocab.rs:1369-1380 | src/cmd/vocab.rs:1384-1395 \u2014 both copies are in the same file, so extract the block 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/cmd/vocab.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e4b9065e082e9ba729c1d167cea518f0d5acd67510ccc346b406b9384795aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/cmd/window.rs:303-311 | src/cmd/window.rs:346-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/window.rs:303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/window.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa98828786347a133e5d6b29c289fa49aee0c61fd715631ecf34dd6e8cec645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/moonblade/functions/io.rs:194-205 | src/moonblade/functions/io.rs:219-230 \u2014 both copies are in the same file, so extract the block 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/moonblade/functions/io.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c6261ea90505bc45e45976ce0c9e37a0df63ffae5c7392c5acd6e5590fb7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmd/blank.rs:55-65 | src/cmd/fill.rs:50-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/blank.rs:53\u0060 calls \u0060unwrap_or\u0060, \u0060to_string\u0060 and \u0060src/cmd/fill.rs:48\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/blank.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb149d90cbd2883fc51f1cc5649f1a29b59a959268edfb4028d6408c257b7d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/cmd/partition.rs:159-168 | src/cmd/partition.rs:194-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/partition.rs:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/partition.rs:157\u0060 calls \u0060as_mut\u0060, \u0060unwrap\u0060 and \u0060src/cmd/partition.rs:192\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/partition.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b7a547830f51b5b4de67ebe8a565949bcfd466955121fcf429a92e7d6c1877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmd/sample.rs:279-289 | src/cmd/sample.rs:396-406 \u2014 both copies are in the same file, so extract the block 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/cmd/sample.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d55323e6ce1bbba462578e1c73c2a8a7855230bca8f7f754b15ec1dc86586de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmd/sample.rs:341-351 | src/cmd/sample.rs:402-412 \u2014 both copies are in the same file, so extract the block 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/cmd/sample.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8683ad891272625541c1aef3e98cfea03dd67641a39b7a19754f8debacd7e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/collections/heap.rs:188-198 | src/collections/heap.rs:291-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/heap.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d84c20f6e1a735738892419a01409c3d4f1489ece82687da73d687914ea09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/config.rs:564-575 | src/config.rs:579-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/config.rs:564\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b167f886581ea8db0c48fe52ecafff87c3bd3bb9ad24a91b22a19cc6200ae49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/config.rs:673-683 | src/config.rs:723-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/config.rs:673\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccee3b862029c549ce07cfcf0c927a4983503c68536610dd9d49ad13279c3d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/moonblade/agg/program.rs:1556-1566 | src/moonblade/agg/program.rs:1777-1787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/program.rs:1556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c3920d832aed105b1a2a9d448700e2cfe27a22af3ff0ea12414a839be930cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/moonblade/interpreter.rs:602-612 | src/moonblade/interpreter.rs:629-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/interpreter.rs:602\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/interpreter.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ea7b5b6ce38de872db282ee12f0abf507ea0bf565b7c47d97acb8fa6548e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/cmd/groupby.rs:218-227 | src/cmd/stats.rs:570-579 | src/cmd/top.rs:166-175 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/groupby.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/groupby.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3a97b8f2a6dc1d35e4ae005e0208e0eea9fc92ae3d7cb5cbee5dd006fbdef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmd/agg.rs:238-247 | src/cmd/count.rs:90-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/agg.rs:238\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/agg.rs:236\u0060 calls \u0060Some\u0060 and \u0060src/cmd/count.rs:88\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/agg.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5709a162080b3aef93721df8583d31d73fa0b3a0f0e232991a658948e1e7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/cmd/parallel.rs:1230-1239 | src/cmd/parallel.rs:1294-1302 \u2014 both copies are in the same file, so extract the block 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/cmd/parallel.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"705d0388dc640abf7426ec7ec95b637a40dd5d27888e330838993d79a29b6193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmd/sample.rs:225-234 | src/cmd/sample.rs:336-345 \u2014 both copies are in the same file, so extract the block 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/cmd/sample.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b37814ac122c03d62e9114ec89dbe8849148473ef61c95d86260efbfda6f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmd/stats.rs:986-995 | src/cmd/stats.rs:1020-1029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/stats.rs:986\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/stats.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fc2cf8fa772cd4ea355a174eaf823ebd1152038e722ca9a4a8324f9f7c4a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmd/tokenize.rs:534-543 | src/cmd/tokenize.rs:548-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/tokenize.rs:534\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cmd/tokenize.rs:558\u0060 calls \u0060push_field\u0060, \u0060as_str\u0060, \u0060as_bytes\u0060 and \u0060src/cmd/tokenize.rs:545\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/tokenize.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b498db7edd5a2ca12445fd1f871bc4f37eb9ded2fea2de84fbde81f49905a132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/cmd/transform.rs:148-157 | src/cmd/transform.rs:172-180 \u2014 both copies are in the same file, so extract the block 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/cmd/transform.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e4ef6243e239faf3a2a382bed0e207bc0544396dd8385751acf0a8808f9f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmd/vocab.rs:1248-1257 | src/cmd/vocab.rs:1391-1400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/vocab.rs:1248\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d238d5439293cc201665bc9454d9406676e8bd1d2f5e7b54e78ae5d2dea3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/moonblade/agg/program.rs:474-482 | src/moonblade/agg/program.rs:491-500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/program.rs:474\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db6ce9829433edcb3522ea8b4d5bae79f9c2f222e06f43d8e33438fdca44fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/cmd/search.rs:1509-1516 | src/cmd/search.rs:1696-1704 | src/cmd/search.rs:1869-1877 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1509\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a452dc867d9d6eed4d65c53a127e78ae2e6fb89bc9826cd42b5b4f520679cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): src/moonblade/functions/special.rs:626-632 | src/moonblade/functions/special.rs:653-658 | src/moonblade/functions/special.rs:672-680 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/special.rs:626\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e7369e493b0a64dff459ab706d29a159c5bd313abb4e3984dad9c831df4200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmd/bins.rs:105-113 | src/cmd/stats.rs:577-585 \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/cmd/bins.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b0cc719bbb2780bb4805bfe7cc362549a4ce74deed76d95a039e3e4fb3ce03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmd/filter.rs:101-109 | src/cmd/map.rs:185-193 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/map.rs:181\u0060 calls \u0060is_some\u0060, \u0060Err\u0060 and \u0060src/cmd/filter.rs:99\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/filter.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33c8555f047d31a34eefc6ee87cb942f6d71f02135291d59c494ec7a8a975c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmd/plot.rs:919-927 | src/cmd/plot.rs:1064-1072 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/plot.rs:919\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07b396f7ab7754695fda14a6ebc13586bc5de160199ff9b9362fdfcb4f318a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmd/plot.rs:1589-1597 | src/cmd/plot.rs:1600-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc7b631fa43f2b9cd2dda13ebf074329e3b8bd39e9f07ec0e4c1fd3afe917a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/cmd/sample.rs:356-364 | src/cmd/sample.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/sample.rs:356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sample.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8781ee1cf5d552bb1f29eda7e1370a4b23938e42015ff4f1186eeac15bd7aa89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/cmd/search.rs:1577-1584 | src/cmd/search.rs:1746-1754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1577\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fab3f9837c517a31517d29e26d7a583125d6c23b35d86b550d170c21713054b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/moonblade/agg/window.rs:722-730 | src/moonblade/agg/window.rs:792-800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/agg/window.rs:722\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"adadfc31a15da95c0cc548a782e3637535841c5ed45a19b0f56cfabc0645ba4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/moonblade/functions/special.rs:226-234 | src/moonblade/functions/special.rs:265-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/special.rs:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4a801c820ce3cc0c2fa899b326dd3d9299e19865f3a32d62cdcd4fa5616dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/moonblade/scrape.rs:805-813 | src/moonblade/scrape.rs:824-831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/scrape.rs:805\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/scrape.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f465701d755ca9e7eafb943c63748d4005f07ab5f40879b5a24cc6697604f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/cmd/join.rs:719-726 | src/cmd/join.rs:775-782 | src/cmd/join.rs:822-829 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/join.rs:719\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmd/join.rs:718\u0060 calls \u0060get_padding\u0060 and \u0060src/cmd/join.rs:773\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdb47ff446e056c2de7a49312e01eb4c85270835ebf13e86bc5546ae63a1967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmd/search.rs:1679-1686 | src/cmd/search.rs:1853-1860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1679\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d9afbd90fa870010264c71babadd5776c5ec915593269409b95da7a68b3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/moonblade/agg/aggregators/frequencies.rs:75-82 | src/moonblade/agg/aggregators/frequencies.rs:88-95 \u2014 both copies are in the same file, so extract the block 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/moonblade/agg/aggregators/frequencies.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"896393c1d15703277a4e1df6218dfa56826f3ac3a3604ff8f176d5d34bc8d3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/moonblade/functions/io.rs:323-330 | src/moonblade/functions/io.rs:354-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/io.rs:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/io.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2cc7293d7750c943178e47f3b7e188177c58b2afbccafb14821d96e7825464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/moonblade/functions/special.rs:783-790 | src/moonblade/functions/special.rs:807-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/special.rs:783\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/moonblade/functions/special.rs:816\u0060 calls \u0060into_flat_iter\u0060 and \u0060src/moonblade/functions/special.rs:791\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f67714a065332f7b957a04e2b8e83b25a11c47431538a37e292dcb5fc8f91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/utils.rs:521-528 | src/utils.rs:546-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/utils.rs:521\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9811af7944fe0cacb42d5b6483467d1f3e0889e24be0187769c6b16dcf6b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmd/groupby.rs:225-231 | src/cmd/implode.rs:116-122 \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/cmd/groupby.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e240ffe9ca96b789fe6e31df8999a98f11c4b6eb7d1926dad22760ef58603b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmd/groupby.rs:278-288 | src/cmd/groupby.rs:326-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/groupby.rs:278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/groupby.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"63db0ba5e90f4cd379bbb84417fc9478c38c830580a585e4e3c7ece1572ea697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/moonblade/agg/program.rs:956-962 | src/moonblade/agg/program.rs:981-987 \u2014 both copies are in the same file, so extract the block 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/moonblade/agg/program.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2243afb88c64c049cfb97926e186ab2a5eaec462a7b1d9617e7e924a8ae03a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cmd/filter.rs:105-110 | src/cmd/map.rs:189-194 | src/cmd/transform.rs:102-107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/filter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afd3e13d1033952a0f6d34aedd433b4f0d1e84d79accf80ce3df8cb2c69b46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cmd/frequency.rs:123-128 | src/cmd/stats.rs:555-560 | src/cmd/top.rs:151-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/frequency.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cmd/top.rs:159\u0060 calls \u0060Some\u0060, \u0060get\u0060 and \u0060src/cmd/frequency.rs:131\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/frequency.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e87bacfc5e5474c170b915a4e61f979ea3fa917a51066aff46205d4841596dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/moonblade/scrape.rs:667-672 | src/moonblade/scrape.rs:676-681 | src/moonblade/scrape.rs:685-690 \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/moonblade/scrape.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6510559530f7891aaac0b34bb5c54d75f4ca6b9d2dd743d37acaa714c78f405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmd/agg.rs:245-250 | src/cmd/window.rs:202-208 \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/cmd/agg.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"061d0f8e4c4516c705fa4291fadf1fa3ea21432225da4574cc64b1215a4761b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmd/frequency.rs:199-204 | src/cmd/stats.rs:604-609 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/frequency.rs:199\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/frequency.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0ed83f4eff2e327b23049607387418cc5ef3e749df1c765a5bc409a4a0fc18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmd/parallel.rs:1106-1112 | src/cmd/parallel.rs:1150-1156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/parallel.rs:1106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8dbd6e1774fc2a3cb44762695eb6998de53b0fb415cfcc944b259687b1800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmd/shuffle.rs:84-89 | src/cmd/shuffle.rs:94-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/shuffle.rs:84\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/shuffle.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeb80acb73a3f146efcc5c42bb71b4901e834e1e9f5b3c91a5b3f39c783dfb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/config.rs:660-665 | src/config.rs:705-710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/config.rs:660\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"da53377bfa911486b50115e08fcd86d6acf0bf6d127872082db1c22db0878134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmd/bins.rs:110-114 | src/cmd/explode.rs:217-221 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bins.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"338f0352b63950ab5dca5eb343a04be5a62eccd0923462564680cd67d072e8b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): src/cmd/parallel.rs:1290-1294 | src/cmd/parallel.rs:1456-1458 | src/cmd/parallel.rs:1498-1500 | src/cmd/parallel.rs:1546-1548 | src/cmd/parallel.rs:1692-1696 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/parallel.rs:1290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cmd/parallel.rs:1552\u0060 calls \u0060clone\u0060, \u0060unwrap\u0060, \u0060selection\u0060 and \u0060src/cmd/parallel.rs:1504\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7fcf28d799e9684906262121aba9c8d9a0af8af4ab34b0751f38cb5940a2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmd/search.rs:1635-1639 | src/cmd/search.rs:1657-1662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/search.rs:1635\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f05312c8019f428b92ee06b509a8fb73dca56e75abfe3c4a02ea3e42f90e456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/select.rs:548-560 | src/select.rs:652-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/select.rs:548\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"368ee84d17eca7027fe33014bdc614493dc8b89cee91b6028e2dcb487713e3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/select.rs:527-539 | src/select.rs:577-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/select.rs:527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"23919048c76b0ac06d7f91e8d82fd0166f9a24b02f47a81fded2de4ab6feb2b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmd/vocab.rs:480-490 | src/cmd/vocab.rs:506-516 \u2014 both copies are in the same file, so extract the block 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/cmd/vocab.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe004354eaa46bd13301c02f0d7f911e4e505075b860fdc85cee7cde3edd222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/moonblade/functions/temporal.rs:95-102 | src/moonblade/functions/temporal.rs:153-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/moonblade/functions/temporal.rs:95\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/temporal.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168ed69cbf71f4bfd2ac8d7ef1a240c7cb85af1efd31b221b8ab843a74f9dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cmd/help.rs:942-947 | src/cmd/help.rs:950-955 | src/cmd/help.rs:958-963 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmd/help.rs:942\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e44142458f5f1256861bfe04509838b73a2551e500cda93aaebef9bd9469bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/moonblade/types/bound_arguments.rs:216-221 | src/moonblade/types/bound_arguments.rs:223-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/bound_arguments.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9772783310bd98dee90158cd81dd19fd69b311b28545edfe81c7f7101e0ba9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Args (LCOM4 4): Args\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87122d67573692e0faa380037848a26bdf688f5d1666ce0bcf8da21f5c0b178"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/agg.rs: 0.0% line coverage (0/91)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e70621ddeb0008af252913f940e1abb4690d8fbe86a755a0f3c66de3d9c17b2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/behead.rs: 0.0% line coverage (0/38)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/behead.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ca0b335098633dc399aafd0f1408d8e3cb2cf1a2da0c4031411951be4e864a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/bins.rs: 0.0% line coverage (0/277)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bins.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b3b48ea0e9fcef0fe24c38340395044d9e94c755d6993b23681c3d8df7178c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/bisect.rs: 0.0% line coverage (0/139)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/bisect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3d241827f965ad33abef53dc0b644839c0ce95b2bc110814cdcd54a2e7536"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/blank.rs: 0.0% line coverage (0/32)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/blank.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b303c052999fd2c56a81a4a3934dcefb52feb4ac9f220a66871ec213932138"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/cat.rs: 0.0% line coverage (0/240)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/cat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c87dc418ead2bb0c4855fdaad56074d71927d8609de05eae267bf547bb3563e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/cluster.rs: 0.0% line coverage (0/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/cluster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b21017d465e8f33c40aee7226531a02ababbace505ce59f67d8d3c7edcb38d6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/compgen.rs: 0.0% line coverage (0/130)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/compgen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9bd741dbe58450cb8cb802ca0fc9df86af13a07dbc386a27448a7ea3d4f19f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/complete.rs: 0.0% line coverage (0/278)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/complete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2626985a68329cbff79c28bdcbf50f28a34768daf689aa1b391ca54c34f8eed1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/completions.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"815c0cebd8c7b368c3365e0eb6675113d4210e20484448dc207a1280bcccae74"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/count.rs: 0.0% line coverage (0/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/count.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcc037b27dc919b55895f556d5b4887b24dffa43f9eb4c812746b282efd4009"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/dedup.rs: 0.0% line coverage (0/324)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/dedup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f46712e64cc368189028a7a05aad1d0d83b7ad95c4e9603c22fa55d661073e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/drop.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/drop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef8b951d76c8c71dec3b788f8c7e8e9aa1601250979688cf8cbba6bcfc5ab3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/enumerate.rs: 0.0% line coverage (0/84)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/enumerate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ecae9db2ef7b56bd42d0cdad49305ca53b973b3f605e1b8ab41053e4f3f310"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/eval.rs: 0.0% line coverage (0/36)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/eval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3870a0a98673c224645cf305e03f7786a0f9d54af00b47e1dedbb4ee38cd1280"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/explode.rs: 0.0% line coverage (0/198)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/explode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe2d672b75f925d5ef6d08c24414b83519213e78ec49a5ea202b1c13a023741"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/fill.rs: 0.0% line coverage (0/42)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/fill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627769d8f543dceb178860bad5b482f7715e111da1db143847be0c060608a6a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/filter.rs: 0.0% line coverage (0/64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d47e6ebdbf32c8c80eec8d72ccf2e57afb75852032ce3e092c0f20f2adf5b4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/fixlengths.rs: 0.0% line coverage (0/49)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/fixlengths.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbc98086c468fa2a29c818767d159ef78c3ba1fe168101362e40e5b8b643b08"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/flatten.rs: 0.0% line coverage (0/194)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/flatten.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a803872f50a586652df2d08e4874264cc115c80677d8baabb5f09c2ba45d78c5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/fmt.rs: 0.0% line coverage (0/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c26b5157f3de58221833103965bf4c13748865b64cd4ee09de27a7b61896ef"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/frequency.rs: 0.0% line coverage (0/192)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/frequency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e788b10aae06d95f338bbf46039687eee22e767b66a59db5cafa32ef66ba66"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/from.rs: 0.0% line coverage (0/417)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/from.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ce10ddfb0a8fa98e4b4d97e38977cf750c1d69a62fd45c3f73a3491badb31f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/groupby.rs: 0.0% line coverage (0/189)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/groupby.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d25e33ef1ad56704c52d92435535acba2f92c90d0c9a19e37b6ce142943b13"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/head.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/head.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10457347b51845ae94de609045f8767b972327c055e83fb9bd7355b248d0bd8d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/headers.rs: 0.0% line coverage (0/148)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/headers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cce81564efb8cfedb7407208cf889755a87790280c42e8072b04bfb375f56c6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/heatmap.rs: 0.0% line coverage (0/389)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/heatmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8232ff4b9c8e85d4887d6b92f6ee9ea16560507fefe0ccd0f2906eb43cd8e7e0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/help.rs: 0.0% line coverage (0/574)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8963492f1e86915099ef3b9949f2b220b4c8bf4ebfbfe4c67390d585509a6e5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/hist.rs: 0.0% line coverage (0/363)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/hist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88eb40127b38c7cc59494bc87991d19465778d484a25410f494a71251603aa4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/implode.rs: 0.0% line coverage (0/125)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/implode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fbb58670419cd4491b71c5ab084e356f7188da4f7c3d393f6322037a0ac5ca"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/input.rs: 0.0% line coverage (0/99)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e667f42499e1c1fc109f900c986830257cdf0b73eda73295c930c3234dbd091"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/join.rs: 9.4% line coverage (62/663)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"286d71d94cf26a428cd88feb7c33e8d32267d27c61dde8ae8eaac50ff8f01c8b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/map.rs: 0.0% line coverage (0/129)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a3ce8b0d27977a1bc4e07f2340b59b890901b866f68d2069f2365848c1958b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/matrix.rs: 0.0% line coverage (0/326)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"284d8c498a1d6fc6b601e4ac71aedf1716856d7e190a5d72c802582770d7e4f6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/merge.rs: 0.0% line coverage (0/164)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2ffe5ee7a1dd6e6b23f92e0533734c275ccfc1178ea012fdfe9656b6cfbbe3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/network.rs: 0.0% line coverage (0/250)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/network.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"456e0e01b38455c979750f2390deb3097a6c2fefa8d778066edff17a39ba114f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/parallel.rs: 0.0% line coverage (0/1012)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/parallel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4044dd0bee0a98f7b87cdfc751ae6159bdf9a54fa3d70c7d8ad6726db01fd30a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/partition.rs: 0.0% line coverage (0/119)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/partition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d154576237ea4a4083de2621d3bab6b3ff65b889a9148870c2045acb540de05"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/pivot.rs: 0.0% line coverage (0/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/pivot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715579b611008840b0b7d82f1c307be42e26bf4916d12a8346a004b6b5bf72e2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/plot.rs: 0.0% line coverage (0/1150)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/plot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ee4e1fd73de148ea36921f0de356c0b9731fe39ec21639e33d3ffea91f94ee"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/progress.rs: 0.0% line coverage (0/143)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/progress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974fb8e185868547ef0140692b1a513e63ee6f39f14671c2caea98200fc3f97"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/range.rs: 0.0% line coverage (0/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8371f8fae692d978604755cca11cde707a00e51dd787dced596a526733c071c2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/rename.rs: 4.6% line coverage (7/151)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c651f5c5b9486f5e0ea52b9e9ac8fd1384fd52b3dd86586c2a52264b7246f5c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/reverse.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/reverse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc13844802db8f6a9d6a7e8a944758a4dcaa56ebe34e54d4f96645ee4b2a333"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/run.rs: 0.0% line coverage (0/65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a18f5a5349f500d5d729f028eeec7cf22ac2956959352886518d18611ad365d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/sample.rs: 0.0% line coverage (0/293)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sample.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ff2615fb2faf48c8297185eb48c03b686da5e96828837ce1cb6814e7f858a3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/scrape.rs: 0.0% line coverage (0/651)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scrape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeec9a73b0fceb76cd858320151fc2a393e7ee05970ece3669af6aa1dcc09f0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/search.rs: 0.0% line coverage (0/1020)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"653bae357af8c7a2ee7f435826b5836cbfd9d528dacb519a3f7a45d9e624a9e0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/select.rs: 0.0% line coverage (0/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bb1c7c14f8c73d606e758644ffec2031f577c9bd85b96f1982f1db69332c19"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/separate.rs: 0.0% line coverage (0/424)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/separate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a29eba0e1decec1377eb8fe4ab65c3dede016b6cf9c7f449170268f3e81524c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/shuffle.rs: 0.0% line coverage (0/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/shuffle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a472a52960aa9a9e034bb4d9d2b9885e9c42cd86d15e465e932b6d171c6107a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/slice.rs: 0.0% line coverage (0/241)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/slice.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a098fa8413446ae135fdae1cbaba4b8c9fbe676cd2491335d33e9280fe09115a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/sort.rs: 0.0% line coverage (0/352)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b94d52aa8d998ee3047037b965f61d6fd5067397b015cb35b04eca0b86213c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/spark.rs: 0.0% line coverage (0/1124)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/spark.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20678d5f688b142aa5285cfddfe64c069e109a9f75dcf112c9d30097bb27895"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/split.rs: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/split.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8b87669a47713ec0145b14e8878b6ee2b20f429e57baef8bbdf17e5f236e6c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/stats.rs: 0.0% line coverage (0/579)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a302457b3d877161d35bc155aeefb3c7deed1e1949aad8bfb1cdfec36a501a4c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/tail.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/tail.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"686fc3dbfaf0b7cc95269d65239120f020404a3dc36bbc76801e2075d0858a16"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/to.rs: 0.0% line coverage (0/366)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/to.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5941ab1511b8aca9b2d9ec16fe8d22aa6948c7d68b5f38f79c026f107a7dfeb5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/tokenize.rs: 0.0% line coverage (0/290)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/tokenize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e0d186c2e1a0b1434d4b703a358cf76c07bfb49a7ec85299b5b4f72c0748b7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/top.rs: 0.0% line coverage (0/120)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/top.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab120f90eec14cdb6043d620377d119113b3b999142edc3fc51f83cf14c07d87"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/transform.rs: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8adbe6089e0e9fa3efd1d0506c0b66d5161c0081134aaff59eec65fbcdbd830"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/transpose.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/transpose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322d48ece818e27880387235955eb219ff37dd020e483cfaebaba9781ec43eac"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/unpivot.rs: 0.0% line coverage (0/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/unpivot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50d54287754e3858b5bd74f4b1019210b605c256fe90b291163edd144925752"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/view.rs: 0.0% line coverage (0/721)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e867c0ca35be84b522efc5cbc361ad0b163f9aee0fd6f3a1716bd88df6405206"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/vocab.rs: 0.0% line coverage (0/756)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/vocab.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ffc12e0c567f66801e6f8a51ee4614a87f06bd927829d5ba65bcf4ebdffe08"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmd/window.rs: 0.0% line coverage (0/183)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da3f02d53ba28c65ab1c1237b81ed8387cfbbd962929aacf5a79ba782eb3ae8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/collections/clustered_insert_hashmap.rs: 0.0% line coverage (0/71)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/clustered_insert_hashmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17469c530733b227672b1ee3bb96dc9dfcd819382c4ac1148bba757b94fcb6e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/collections/context_buffer.rs: 0.0% line coverage (0/106)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/context_buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1865a60a44e8dca1bdb1a8bd54d6d4c2eed641a79aaf9ac6ed54f7f697f281f8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/collections/counter.rs: 0.0% line coverage (0/205)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/counter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f6c1b431525cb6d174428b816f81e50e2d247cf91c51d0ab83928c950d43ff"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/collections/incremental_id.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/incremental_id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dced9ea928b0d8620ca97f893fad40733c3928271efa925763a58825f852b05"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/collections/mod.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collections/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ccbb5c28ddac96f1e0ec9d4270095698eb68d58a3ce1943564d46ff20313b8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/config.rs: 0.0% line coverage (0/598)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f39c712208840f81c3a4b7003d2b51a12011be93376595d0effca010f13ef00"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/graph.rs: 0.0% line coverage (0/688)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f985ca54caa04c0a40e850f52271b5fc6338993ee78eb8577440cf8e3458e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/json.rs: 7.4% line coverage (37/499)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f0bb93bdfcafb5b66ec7a1b5463f4ecccb43d61f8ace723e0d7f351015e0ba"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 0.0% line coverage (0/192)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/all_any.rs: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/all_any.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec54385d4ef750898b0719c278218fce0df86bfb9b2b1e80d5d8cf07ebe212b5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/approx_cardinality.rs: 0.0% line coverage (0/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/approx_cardinality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c212acf578703ab919b29dccf51d676e882bb5dc6d92e9e959008a6962013e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/approx_quantile.rs: 0.0% line coverage (0/42)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/approx_quantile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2700ed702d2deecb1a7af5423dcaf5b4f359643c135f26f62695107eda327b2e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/count.rs: 0.0% line coverage (0/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/count.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71c7451b5e45ca17546c1c7a6fdfeb97efb66bab76f4d7f6ce3c770a7c72c34"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/extent.rs: 0.0% line coverage (0/169)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/extent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa958fca7b9803ca96fd67b0115721bbf5d2d7a8ca34557e94beb40e05d7507c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/first_last.rs: 0.0% line coverage (0/46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/first_last.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343aec41fff457f8e12842c511e974308300211df4d3f1c3090b48b008637516"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/frequencies.rs: 0.0% line coverage (0/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/frequencies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d03aedae9fc2e7fa177afdf66ecca5b9fbdd7cefe505b8e32ca54d465ac4e7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/temporal.rs: 0.0% line coverage (0/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/temporal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10939729c0c3ff05700283143fe25657d0a3858476f46c35e60e7b7654eb3724"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/aggregators/values.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/aggregators/values.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4693a5ecee99ae113f2a12573f06b0c5b90955076b35d734cb148a0f9523cde9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/program.rs: 0.0% line coverage (0/1156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/program.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5f855e0848f0eabd9965165bcbf06a835369b163473bd2bea932bebd9df903"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/stats.rs: 0.0% line coverage (0/193)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfad85e61c239bfaf55c8ec3db50e85b5ca95543e782d67d112f6423d1c899f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/agg/window.rs: 0.0% line coverage (0/820)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/agg/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fa18f0350171e396ea24a6adde723e63f899418dbae5a19b728e130b90f4bb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/choose.rs: 0.0% line coverage (0/32)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/choose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11fd9e1cae6588a65695067264eec33c27e1d6234bac45f64662f6c56c17bc3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/error.rs: 14.9% line coverage (21/141)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17b20a4a3514894ab7499c1c54db0d4cf9b6f5b11db3b047d5998030d615654"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/fmt.rs: 38.7% line coverage (55/142)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eec62e48953a29aef00e23d099d25dc0398bb490dee0a004d81789f4e9a6f2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/fuzzy.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/fuzzy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c695285986563c4cdc5a556dd212e0f813da15e3673ef391acceb221a8969103"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/io.rs: 6.1% line coverage (17/279)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179fd2a0dbd655b0c57a49e6df998b3e275ac599c7eb470026c523c85aa56c0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/sequences.rs: 31.7% line coverage (85/268)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/sequences.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4d14fb4bd5b973cdf977b4175a6208750e496a1b8d456310c9774c8b4c5744"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/special.rs: 26.0% line coverage (151/580)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/special.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e4b096ac72aee7adba660b1dcb2fc26157e5d01012e85725e407d8d91c1a3a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/strings.rs: 45.1% line coverage (51/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ef8a9c8e1ad08c1dc322a8ad61c7528046d0c0538a3733b4c68b7f5716b85"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/utils.rs: 29.2% line coverage (7/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78959f65faab1998ad34cb6f37e02e50b08d2ba81b43980099e70d75032b694"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/functions/web.rs: 0.0% line coverage (0/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/web.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34614dc42bc1e3086407165414d7493168a8d5a999d8ed13194a7fb5c9ad796"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/select.rs: 0.0% line coverage (0/166)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9e4056223123bc64d5e40463230721bae220230cd395f4aeaaf6334b5f8b5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/moonblade/types/dynamic_value.rs: 34.1% line coverage (205/602)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/types/dynamic_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3285e4f419eeaa2fc31e18fb29c257ca6713b37fc28c44a902c42cc208ac01"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/parquet.rs: 0.0% line coverage (0/120)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parquet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b44c596f86fea64ef2d5f95cee24f110caaf9920d9a14a7f68c083bbb6d535"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/processing.rs: 0.0% line coverage (0/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/processing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f748f302ae8529f48bd4ac3a0200f690b55092a992c4f5c10555132129c82682"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/read.rs: 0.0% line coverage (0/92)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c2b1e4198da186c0d8b4b26f51f34a2171e5d93c72e3e32ba424fbf647924"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/scales.rs: 10.9% line coverage (78/717)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scales.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cc58287394bb8b7f1a9a9606558675c34fe85eb63d11d630f2a229577bed02"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/select.rs: 2.1% line coverage (14/655)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227fcc4e7dd1c3d089ffe733e76cccf7d98f3147a4addbc5c3fa458d8dd4e3a5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/temporal.rs: 36.4% line coverage (123/338)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/temporal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aea206b0699f9e03faca9d79990c64f53906811f262a37c82a8413ba50ceb44"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tui/utils.rs: 0.0% line coverage (0/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5bb5f21a0751cee5cfee643b78425ee150694caed23ad623c868ddb4ca1d78"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/utils.rs: 9.9% line coverage (54/548)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e045571daf7f9c6c90b47e9bb257de340912308f800a920aa08562ca845657f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/xml.rs: 0.0% line coverage (0/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae3595c3f7afdc071f407bdc0420df3da4e651470c57764e3c3238309a3823a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_cat::cat_cols_headers: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_cat.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb06f3c9b422f51fe3f14d50350a54bb30bac09860ec455b75c6a1da8150d247"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_cat::cat_cols_no_pad: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_cat.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bf06aaffcd78046e222d2f6d687a92d706e1e3611b06145603330f89876c99"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_groupby::groupby: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_groupby.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4443a26a9e4c531ada230d9deae6b552cced9036b9f3d705996ef9e2dc5084de"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_groupby::groupby_max: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_groupby.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab9e63d1dee11df3985d760b4bce0c5a85a02b812cf16614e1cdca2c6b96fe5"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_groupby::groupby_mean: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_groupby.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"84718e0b8e6cc95a6ac2cf59639cf70b21ae4d7e4ffb9fdb20ce279ef5adf491"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_groupby::groupby_sorted: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_groupby.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a53f5818f9996883deff669fbb8ab05684b1a68ca4f28f167a2223e7d9b3f7"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_join::fuzzy_join: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_join.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1ba076b56d29581c79b632f7aef958445df5e10b303065d5aefb4bd5753043"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_matrix::matrix_bivar: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_matrix.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0729b05c6a953dd6c6b41e3b6af614dcb7b8cf5ddfb26688b01779980e26b45"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_matrix::matrix_bivar_weight: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_matrix.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f1f44775aa28eb93657e5f0b6cc37c09af264e5a3d67f8ff007bc75ce282d0"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_partition::partition_case_insensitive: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_partition.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2bcc312186894e5fa5a8b5761a8314dde3e67503cb4e1afa5274ee5d44dc36"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_all::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5a5590d82509c7e5e1a9fb14068719e7e578e0664ac36652fb876187f9571c"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_duplicate_range::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8d392f334d85fe24f9f0dbb6f85862a15a81a6b39495c53a96101065ce7b3"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_duplicate_range_reverse::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ace007a396efdc996e2e4c9d8e101a341fe6367f1915da4f0d5f64a214d111"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_duplicate_range_reverse::no_headers: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"85583960fda5a797b04149b6f33185255e0e0a1fbbc23b57106d7306edcaa3a7"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_negative::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"927d99a0fb736b93baa097c979e8272084329a54385d7b61a7853ad67989218a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_not::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d22203ea953481540d1e4d17d74c8346dd86b6a4f637b7a4234823961267b47"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_not_range::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc74cdaf8476ca1dcd8131a405da7eb53fcdeb5aa8031223fd622b7e2b85ac17"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_quoted::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e2ab0edaddc6df4c622793baac78face2d291e399877ee531f775445067d9f"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_range::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cac64a1b1753b77691ec2cf7cdf4cee0ed9e31077b9ff6bdf55cac5ccaf8fd"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_range::no_headers: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f0e54455536da1c2ae0098d48f0fae9d86eed7d72f33998ba9ed62ffdc3d65"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_range_no_end::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6386ecdfa89706fcaff072834f76d1dd00dc886af6fce0e16bf8a0e0f1243c"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_range_no_end_cat::headers: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e190cd350525b1680ae12290b5fe4b94287db5f91658aaac438cd1189fb75f46"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_range_no_end_cat::no_headers: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0297fbbcc41419b549e74f2fefe25772b6df3edd4ca99f94d5be91d1c2dd03"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_range_no_start_cat::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"341b56a554aa2d50e558ccda0cf6d0fcff66b67de0745f240297b6346121058b"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_simple::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d8e5e4da7848b2853e6575dcc87b33c5d1526329ddc2c91eef9e4f916cf1b1"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_select::select_simple_idx_negative::headers: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_select.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e98ad4306fbd4e9f675b0632cd7ceeaa5db408e798b3f2b1f10350f29e80ea"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_sort::sort_check_numeric: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_sort.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d28c725a1e5b43c6956e09382c844dac412dae3aff7cc7b050080320c6ea95"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_sort::sort_check_numeric_reverse: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_sort.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"379dbd9f31a3213511d55348704d4367f73b6fa288b2df50acae61c1206c12de"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_sort::sort_check_reverse: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_sort.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"104484959579c1eec2cc7a7c675aaf13e8f6397ae6fc23407c200a6838363d69"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_sort::sort_count: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_sort.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca290f5046c30cc8d19aaf00dfbb0a03103c47f3712c915b94105b5c0cbc69ab"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_sort::sort_count_one_group: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_sort.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"330bb0fd940fe7b6ea4c8ca5ab1197a3439a81a07026fd35cf85ecbe062c4d67"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_split::split: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_split.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac182355a9493ad17f7c3009f49090d883828b97bf8ba41db77771d63b6e973"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_split::split_custom_filename: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_split.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcd7db1e7a427dfbe910606332cc072e163bf20bd8f7fa41debd082b2c178bc"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: xan::tests.test_to::to_latex: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_to.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d9a072f2a3d97f210cc1314d1c07c223ea20e8c5487b216b84fd9521e3c1c8"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: namedlock: \u0060namedlock\u0060 0.7.0 is published on crates.io under \u0060GPL-2.0\u002B\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f184fc27f69c1956120b5eeecc638f00e1bb2b62d24d0dd0d5e82d1bda4e25c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/view.rs: src/cmd/view.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in xan::cmd::view::run at line 423. 1 of those changes was a fix/bug commit, 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/view.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/cmd/view.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96b557057f1e5a36fb5d7793748d3abe0a184e1be75dd2b5ae481f91d2c476a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/search.rs: src/cmd/search.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 143 in xan::cmd::search::run at line 1251. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/search.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/cmd/search.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2515b7e264a321d3fd6e74de3e14edc7f53b0dc83604ca76bd82c364e805840c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/spark.rs: src/cmd/spark.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in xan::cmd::spark::run at line 1106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/spark.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/cmd/spark.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c817be2bcff2514270c3fadf882f0b40b15c6efce8e1a6b9f2977f6723e27f6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/plot.rs: src/cmd/plot.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in xan::cmd::plot::run at line 438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/plot.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/cmd/plot.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c78b09be527f24387d405bc8927f378d36f21288356dc3f2d5a8e26815638e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/moonblade/interpreter.rs: src/moonblade/interpreter.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in xan::moonblade::interpreter::concretize_call at line 498. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/moonblade/interpreter.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/moonblade/interpreter.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8264fe9010e72842edfbf4f91330a8a1a111c271b9bb39ebbbd0116040146c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scrape.rs: src/cmd/scrape.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in xan::cmd::scrape::run at line 1115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/scrape.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/cmd/scrape.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce14eb60de4c90fd1f2cd23779e38af128c22d64d21a22fc78d1580105f3d21a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/moonblade/agg/program.rs: src/moonblade/agg/program.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in Aggregator::get_final_value at line 125. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/moonblade/agg/program.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/moonblade/agg/program.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"006aada18a35115d4e0101711b594946ec7bb18e81bbedb23da60df00f0cc9a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parquet.rs: src/parquet.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in xan::parquet::human_readable_column_type at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/parquet.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/parquet.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ddac1a06f23a061823b9040f64688da66ac0d173cae588c6477d0743d3b12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/flatten.rs: src/cmd/flatten.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in xan::cmd::flatten::run at line 110. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/flatten.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/cmd/flatten.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcab6e1d9439e4eed675d2ef76247a37a0d9119e2714f331037a12f800bdc1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/heatmap.rs: src/cmd/heatmap.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in xan::cmd::heatmap::run at line 376. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/heatmap.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/cmd/heatmap.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a86c02956659303ad59a511a58ebee6a581bdaca9e046e199954b804c280caf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/explode.rs: src/cmd/explode.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in xan::cmd::explode::run at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/explode.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/cmd/explode.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62176710cd6dec92789b0c8a691361874475b419e520f8c251f49434ab2256f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/hist.rs: src/cmd/hist.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in xan::cmd::hist::run at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/hist.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/cmd/hist.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490cc8973356effa7cb276dbaced40e04147bfc130179f38b5a6c6a1bbe68a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/rename.rs: src/cmd/rename.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in xan::cmd::rename::run at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/rename.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/cmd/rename.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd51e1363b67ec6c62fe1efc3fa61d00e7165e96aa16cb009a29be03b7467382"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/dedup.rs: src/cmd/dedup.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in xan::cmd::dedup::run at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/dedup.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/cmd/dedup.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d5baa78976b4b94647e4bb61782fff34bcfe1e5e5468b251d8f631ba6288e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/moonblade/functions/special.rs: src/moonblade/functions/special.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in xan::moonblade::functions::special::get_special_function at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/moonblade/functions/special.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/moonblade/functions/special.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ff12231c4bbd82cadf67b0bef23abc789f0dfab03a509d0c21cc6f305f9529"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/tokenize.rs: src/cmd/tokenize.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in xan::cmd::tokenize::run at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/tokenize.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/cmd/tokenize.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cec9595ed8f47034597f82c452fafce0d6d066d54266a45c83ba4ce716c6156"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/sort.rs: src/cmd/sort.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in xan::cmd::sort::run at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/sort.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/cmd/sort.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f0ebe9656a7515992a0d869e49f1af54062f4315696d867cd1772d82e7db89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/stats.rs: src/cmd/stats.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in xan::cmd::stats::run at line 552. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/stats.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/cmd/stats.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"03044d6c256f0a46ba0c651b57db4221e796fc62a60d2ed115592de561c0e80c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/count.rs: src/cmd/count.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xan::cmd::count::run at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/count.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/cmd/count.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"831412f1e57f7a3f001b438ed459298dfc27d8549201e6da636e15940e468d97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/bisect.rs: src/cmd/bisect.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in xan::cmd::bisect::run at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/bisect.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/cmd/bisect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7253fe317df547a4e04f3a54d39060426bc6610a77c2af77744828b7c396961c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/parallel.rs: src/cmd/parallel.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Args::cat at line 1175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/parallel.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/cmd/parallel.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae586a7d31d54426b7c65c5ae56e8d2d3e6aa65acd3b6cbb4b66d4688894cbb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/input.rs: src/cmd/input.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in xan::cmd::input::run at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/input.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/cmd/input.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea5dc0febbc7570dfa9e9ed3c72074edfad25b1ed9b8d28209c45f50e2b415e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/headers.rs: src/cmd/headers.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xan::cmd::headers::run at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/headers.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/cmd/headers.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a312b59d0d1c19ac61318cd17f6d70732c830b514aa7db698de4109ea88dfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/bins.rs: src/cmd/bins.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xan::cmd::bins::run at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 16:48:30 \u002B01:00\u0027 --until=\u00272026-11-12 16:48:30 \u002B01:00\u0027 --full-history --no-merges -- src/cmd/bins.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/cmd/bins.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f840f78b8ddec1b3c19bc139c768171949fb11a47e1d6bd02f8d0d2889b60d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge attributes here? \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/graph.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"4836834d8f17a79c4471a1615fa990780f86d3b81e3a56f057f6562bec69a8a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could work on the Tape itself without bothering with clunky TapeValue \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/json.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd59efc06d72fee992f21a55912cf46ecdafb3ade2078bf8ce3e696e8dc2e80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deal with pos_opt \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/select.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc894155e0449e7dd81e9e651e7bf05d0ae05ed7db9852937c0d40b1ab0166b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: at some point it might be nice to refactor comptime evaluation \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/moonblade/interpreter.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b11187cfef6d09d9fe358da8b59fc4d814d088451573bb119f1d6ce61f3327f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can probably be factorized lol. \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/moonblade/scrape.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a5cb4d42a9358101cd4e164a4875f3a05673f6518553d645af0343653c5168"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: NaN is gonna bite us in the buttocks at one point I\u0027m sure.. \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/moonblade/types/dynamic_number.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"915cbba8908b24671560e07583186f06416ed2b6e2c16d0d25aeeeef0916f8ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deal with lists \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/moonblade/functions/ops.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7dd83f88a3375462a09eb3696189878ea2451146e75a9e18bf44d9b9413ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deal with allocation reuse when dealing with raw Bytes \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/moonblade/functions/sequences.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4470b259d6aa1ed03ea0b73936e33d723fc72373b59b62d34382404ce7a9a4d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this pattern, and the one of concat can probably be abstracted in a method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/sequences.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ca458ffc9931584e291d369c17cba998759a6487655e8ad9990896716fad63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could leverage BoundArgument::Owned to avoid a clone. \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/moonblade/functions/temporal.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"31490855f2f1d20e7f9907d828b718d582b43a373c13ecd8f8d79e082381825b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could leverage BoundArgument::Owned to avoid a clone. \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/moonblade/functions/temporal.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a54b5fe28e2a077371a288b02bd642b7c99b3d9775fede9b7fa393430c397e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could leverage BoundArgument::Owned to avoid a clone. \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/moonblade/functions/temporal.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc4827cd4d2f17cc1a214ae7d9460f68a02ad198a8940c21ade7f17b6b0a8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: canonicalize \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/moonblade/functions/web.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a481368d3f464622680c672538f3529a055615f007953f33c5c53f4bf537050"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: canonicalize \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/cmd/scrape.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c398d936b19f421dea1d8c76569a74ab20b1eea2645112c6e9fb055cb46b5b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: canonicalize \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/cmd/scrape.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056a7b7a12c5bb5adf92686afc811eb40e99e6300203db4ea7fb4d193ed4226"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try_into_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":"src/moonblade/agg/window.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f475029ddd4024a72b1235b00b639176af71dff42db72b585cdb3742f9225323"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is hardly optimal, allocation-wise... \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/moonblade/agg/window.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfd66e90baa29554be67e5b66cd071880dbbc9266501a5e59c9b68b8af72047"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: some --pivot option, that blanks hierarchically \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/cmd/blank.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab063892354192968507c28266be743c0cdf624d004ea19b3f6ea853b63fc4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should also match by positional name... \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/cmd/cat.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc645bbcb48168d0afec8b2c37b459dc7a02eea95223022eca88f30af887b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: flatmap mode \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/cmd/explode.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66aae1a5e60a5af0440123c7fbb548b374c1cea2d19dea6b469079e6bb89b34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could coalesce \u0060push_node\u0060 \u0026 \u0060add_node\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/cmd/network.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5895c8420c96cb803cd81e33a4440810b29ea3a08d4086da4bf533bd8761aa5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could manage a pool with an index handle instead of a BTreeMap \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/cmd/parallel.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"48209a51fc25432572b9b16452d9a555c00e8a05d8123de34306ad9856d77584"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could also weight the number of allocated threads by the size \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/cmd/parallel.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a082d608b66cdde7a904aa6f3e9fcce957daf36e9b04206eb7f76e68aa77dbf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could also artificially chunk more to distribute load more evenly \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/cmd/parallel.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cb5506cb0f74dc65f1f0bdd611d15836953d80a798ec9aec35db69b6aa3667"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: apply some factor on size when file is gzipped \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/cmd/parallel.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70bf1375ad05af61e886437cad728166527e1a8d61953e1febc52424c0f8f0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize when names are known beforehand \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/cmd/pivot.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f62fd6a2ad4ecd7f65c36b2eeb48532debeb1d9239374f8648639abeffcd2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: -S/--sorted \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/cmd/pivot.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"af57f43a604f4afcf69f7ab3b054e4219f88f3187b9ee7082d2b884ad9e3487e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this function should really take the area correctly into account \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/cmd/plot.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36369b2c25b81baaa9a7227105debce025f781d5ca18194d2248a0816fe056a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Urls \u0026 Images could take a future base url if required \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/cmd/scrape.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8778956bd1c3953b4327f1ce70d458a20a701dd58538d2fb8ce561e3f8c8982"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could be lazy iterators sometimes \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/cmd/scrape.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb734958cba97c8a04de662bc4572dcb2c323a3ebdc661500197149c1965d11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: amortize allocations, fast path if sel is empty? \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/cmd/scrape.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbaca08e16192faed8237db8cbac58e7155acb87dc8582180bc0fdae8cf766a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: timestamps \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/cmd/stats.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81e14ccd06aa50282447e54e67457e4cecdfe89a6ab4241894eac3fbf747dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix some cases of mixed data \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/cmd/stats.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c42f844324f434845ef82e0099b157cdd93f80e2ce4d0ad0b48c30553c1dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could avoid setting the type when we know it is not used \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/cmd/tokenize.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1a64f4993e2a92388f00bbe92abbcc2896f3185b48385ab3e019385353d01a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: type tagging for values should happen on initial read \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/cmd/view.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc63181e8aeb167fc80e03bbae4e9130fb1f835600ab0bb1dad3b5d9b680179"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this code can be greatly optimized and early break \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/cmd/view.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b634240a8eb28220a29061c8bce1a58047618703d3788b86693aa6269ea915ae"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 37)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62992b6d8a7c204df6d3fc0b57b880448de773722c07f0e5b7b4d694f2fc06d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"865c1256b0af6cac7fabd52ec1703a6840a81e82c2cc09619e5e78e47af02756"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc3ecdd4bc3bd9bff591644d286b0b77a008095c75ccfe9c3301bcf2dd89586c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8e18d2a8f20376724197f4821264a0a9f0e273d56749195409cdb6066877285"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ddd4a3eacb5abc26b76d406ddb70aae9070bf3a368b86a2ade443eb3e11ee6d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c91376d683848a81d4e1b264bf13fc8604788e3ca6b44111d0c439859b0dda6e"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f814f99d68c2759480457d35fc42d41c7f4ce11247e748bab7b8971be44f9597"},"properties":{"dependency":{"package":"calamine","version":"0.36.1","advisory":"RUSTSEC-2026-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c99faf45650c5583d35ab90d02b7a7f366812e6b6901ba0afd35950e9e1f916"},"properties":{"dependency":{"package":"encoding","version":"0.2.33","advisory":"RUSTSEC-2021-0153","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.5.10","advisory":"RUSTSEC-2026-0186","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.14.0","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.1.0\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fc50f47bc5977d6571e15b6fb5974ce0c6d79e24149d8f6bb254276a6fd8d9e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.88: rust-toolchain.toml declares Rust 1.88 as this project\u0027s toolchain file, and Rust 1.88, superseded by 1.89 on 2025-08-07 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-08-07 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476678a1ee3431d0d7d6fee2467e49852f5ae540b5afab9dd2c9822ddc2f8ee5"}},{"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":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/moonblade/functions/utils.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aa51240d542733505dd7467c36ee81972a47cc8d8f81259647e351b3aaadfa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.flag_parallel || args.flag_threads.is_some()\u0060 appears character-identically in 6 files \u2014 src/cmd/agg.rs, src/cmd/count.rs, src/cmd/frequency.rs, src/cmd/groupby.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/agg.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"027fe4437d59d5d2499452890527614be2a38ba35548307a1246a4c80d3809e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.flag_paths.is_some() \u0026\u0026 !args.arg_inputs.is_empty()\u0060 appears character-identically in 2 files \u2014 src/cmd/cat.rs, src/cmd/merge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/cat.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede5e5df79fa8bc0e4972203e0c05a7611b521b0426d250252d5b5775781525c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.flag_sorted \u0026\u0026 args.flag_groupby.is_none()\u0060 appears character-identically in 2 files \u2014 src/cmd/complete.rs, src/cmd/window.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/complete.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"297bd452f9b583136fed476456868d5de9338b99cb3479fa80e490e050c38c8a"}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":36,"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."]}]}