{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02: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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"FieldType::value_from_json (cyclomatic 42): FieldType::value_from_json 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/schema/field_type.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf259fd2676a38dec3ffffbd505860597bf0075bbc600d46062aa58bdc99cf"}},{"ruleId":"D1","level":"warning","message":{"text":"CompositeKeyVisitor::visit (cyclomatic 37): CompositeKeyVisitor::visit 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/aggregation/bucket/composite/collector.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eb346292f922d156350001f7d61ca3b668eb46b041d753a9da04c16d90fce0"}},{"ruleId":"D1","level":"warning","message":{"text":"InvertedIndexPluginWriter::index_document (cyclomatic 33): InvertedIndexPluginWriter::index_document has cyclomatic complexity 33 (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/index/inverted_index_plugin.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"27db17677ae7772488d3ffc5eba4f39275d6f49aec64987afb259d7160f0fa9c"}},{"ruleId":"D1","level":"warning","message":{"text":"SegmentTermCollector::into_intermediate_bucket_result (cyclomatic 30): SegmentTermCollector::into_intermediate_bucket_result 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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edf8be2916017c6be7099310faaf23034e2b4a14bbf0c936a938b2bc166c0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::collector::sort_key::order::compare_owned_value (cyclomatic 24): tantivy::collector::sort_key::order::compare_owned_value has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collector/sort_key/order.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7dd9a72fcd8b2c208d70c4ed154a1e15c7af3334842db0d4eed18e632d36ef"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy_query_grammar::query_grammar::aggregate_infallible_expressions (cyclomatic 23): tantivy_query_grammar::query_grammar::aggregate_infallible_expressions 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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c6c3b329c9440e3ca140109b48884f4786bebf762303fe41e748b4d98dad59"}},{"ruleId":"D1","level":"warning","message":{"text":"BooleanWeight::complex_scorer (cyclomatic 23): BooleanWeight::complex_scorer 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/query/boolean_query/boolean_weight.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"99938efaab384e0a3eab1fac09fc19ea9e07d5be846e8c48202d51dcd58f76c8"}},{"ruleId":"D1","level":"warning","message":{"text":"MoreLikeThis::add_term_frequencies (cyclomatic 22): MoreLikeThis::add_term_frequencies 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/query/more_like_this/more_like_this.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"094efec5db8309fdaf7f6ffa11e40814532ce2590d935ab8630fcd211fa43857"}},{"ruleId":"D1","level":"warning","message":{"text":"FastFieldRangeWeight::scorer (cyclomatic 22): FastFieldRangeWeight::scorer 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/query/range_query/range_query_fastfield.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dd790b3e80f4b3961cb8e13fb7b76837e07a9b860774b079156b034efae438"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::aggregation::agg_data::build_nodes (cyclomatic 21): tantivy::aggregation::agg_data::build_nodes 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/aggregation/agg_data.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"05daf7fbfabf6dc5b672db0f7cc4bb7eeed1801538cb05d62ec56fc3e8728b06"}},{"ruleId":"D1","level":"warning","message":{"text":"CompileFnBuilder::apply_literal_type (cyclomatic 20): CompileFnBuilder::apply_literal_type has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/compile/compile_fn_builder.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6c0062ab2269f66e947b232f02b91cb933e45f280413cf6cd90f417e6e8a08"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes (cyclomatic 20): tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/agg_data.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb36bce643e13b54ab19e33c4983f00962121c3ac51d342a262f9b97585cb479"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop (cyclomatic 20): tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d29a0205df3e45ee2634145e9a38b5b6968a23908392caf8576771e94fb0020"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryParser::compute_boundary_term (cyclomatic 19): QueryParser::compute_boundary_term has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/query_parser/query_parser.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6762b456844c4ab7fb7f7d579114159f8904d818c938c6f31f18634a9bea8a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryParser::compute_logical_ast_from_leaf_lenient (cyclomatic 19): QueryParser::compute_logical_ast_from_leaf_lenient has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/query_parser/query_parser.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7346d1b0e3c02f7e44e2370f40d4b873aec2ad7493b426bbc7362d20e40017d"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::core::json_utils::index_json_value (cyclomatic 19): tantivy::core::json_utils::index_json_value has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/json_utils.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25ca8ae8e1b015316a5da185ef2e04a99b2138d5b11bbe4334662555330c636"}},{"ruleId":"D1","level":"warning","message":{"text":"BitUnpacker::get_range (cyclomatic 18): BitUnpacker::get_range has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bitpacker/src/bitpacker.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"672e2572ea5748b5759754ba6c08e34a112ff0084a68fb456ce6db3645e1115e"}},{"ruleId":"D1","level":"warning","message":{"text":"CompositeSourceAccessors::build_for_source (cyclomatic 18): CompositeSourceAccessors::build_for_source 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/aggregation/bucket/composite/accessors.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fd825ffa93c29823df3b86d7fcf00c095ed886cb6438f0e34b6534e57c3971"}},{"ruleId":"D1","level":"warning","message":{"text":"FastFieldsWriter::add_doc_value (cyclomatic 18): FastFieldsWriter::add_doc_value has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fastfield/writer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9724a37fd80f3a650ed900358567b91ae50db9ca99db8de0128445e97eafe80"}},{"ruleId":"D1","level":"warning","message":{"text":"jitexpr::functions::concat::string_concat (cyclomatic 17): jitexpr::functions::concat::string_concat 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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ed3078f4b00196b397715848759ffaf95a849366dbd1b040b6918b0ec2899e"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::fastfield::writer::record_json_value_to_columnar_writer (cyclomatic 17): tantivy::fastfield::writer::record_json_value_to_columnar_writer 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/fastfield/writer.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da58e6694b973f562f46fa7c14c3921ab2cafc01d081f3d1b1113d880918f33"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::index::inverted_index_plugin::write_postings_for_field (cyclomatic 16): tantivy::index::inverted_index_plugin::write_postings_for_field 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/index/inverted_index_plugin.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"90210dc183c968e168a120b0edf271a09b69e9f8ad10bf41cbe32092bfcd70f3"}},{"ruleId":"D1","level":"warning","message":{"text":"tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection (cyclomatic 16): tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection 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/query/boolean_query/block_wand_intersection.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6117212b414ce79b4ea48a8a33818c62d3e1cd58e34e38ad68ee9faaeacdb005"}},{"ruleId":"D2","level":"warning","message":{"text":"CompositeKeyVisitor::visit (cognitive 71): CompositeKeyVisitor::visit has cognitive complexity 71 (threshold 15). Drivers by points: if/else 11 (37 pts), match/switch 7 (22 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/composite/collector.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9f5519280d6a9d7b178977ed3ff727ce2258e229b5bc74019ea670ae777462"}},{"ruleId":"D2","level":"warning","message":{"text":"InvertedIndexPluginWriter::index_document (cognitive 65): InvertedIndexPluginWriter::index_document has cognitive complexity 65 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 11 (31 pts), match/switch 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/inverted_index_plugin.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"da599f02d9726cfe66d20bb9affbdce81c30382202f30da4db8c866c9d467da3"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentTermCollector::into_intermediate_bucket_result (cognitive 60): SegmentTermCollector::into_intermediate_bucket_result has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 5 (10 pts), match/switch 3 (7 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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e948c0c60d558b2faaca6cb55edfa5349c1e28470e215e1943c0717570c28c27"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldType::value_from_json (cognitive 55): FieldType::value_from_json has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 6 (11 pts) (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/schema/field_type.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e0bba4d187f1f6cec264c604256be64cb9c8341a6fea71d9107562cb556077"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop (cognitive 50): tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 4 (12 pts), boolean chains 2 (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/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01d1d2533b2536c034509273ecc9d6953f5d65adbba51fff8a2e2a7c3cd07b1"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy_query_grammar::query_grammar::aggregate_infallible_expressions (cognitive 44): tantivy_query_grammar::query_grammar::aggregate_infallible_expressions has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 4 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"query-grammar/src/query_grammar.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d36c0eef9d3635f88488fcd2aaae091e820c90a1a98a68a72b594a2d35719ed"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::index::inverted_index_plugin::write_postings_for_field (cognitive 43): tantivy::index::inverted_index_plugin::write_postings_for_field has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 8 (17 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/inverted_index_plugin.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c8ff60bf4e72c2a33ea8536fa8cebc494e71086ee2083562b9c66bd55860c6"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection (cognitive 39): tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 6 (12 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/boolean_query/block_wand_intersection.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec919ed2c9cd2d2506fab848ce5c9982398ff63be1df3531f2a2685563cf5582"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes (cognitive 37): tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/agg_data.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d1c28bf8dff99da57869638002039be7cda21d9a7dd7085fe9a55cd9027bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"MoreLikeThis::add_term_frequencies (cognitive 36): MoreLikeThis::add_term_frequencies has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (12 pts), match/switch 2 (5 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/query/more_like_this/more_like_this.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eafe5a595011f3b5e07c1edb1e11d57d540bc33361bf36da367811a60cc21bc"}},{"ruleId":"D2","level":"warning","message":{"text":"FastFieldRangeWeight::scorer (cognitive 35): FastFieldRangeWeight::scorer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/range_query/range_query_fastfield.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"090b0652923703f429fee3db7cc5da8b8bf8523a96329cbaa2a85244e749414c"}},{"ruleId":"D2","level":"warning","message":{"text":"BooleanWeight::complex_scorer (cognitive 31): BooleanWeight::complex_scorer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (8 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/boolean_query/boolean_weight.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b188d2e28817436a2887596d6a4383d83f97c9aa71e60722e9a7b992d1102c"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentMultiTermsCollector::build_keys_from_non_full_fields (cognitive 30): SegmentMultiTermsCollector::build_keys_from_non_full_fields has cognitive complexity 30 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 5 (12 pts), boolean chains 1 (nesting depth added 19). 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/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"45221f8fab8ec380b133638f74c5db9885009e33d40f445675521822f82463c1"}},{"ruleId":"D2","level":"warning","message":{"text":"BitUnpacker::get_range (cognitive 29): BitUnpacker::get_range has cognitive complexity 29 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 7 (8 pts), boolean chains 3 (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":"bitpacker/src/bitpacker.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52ee4bdf149c1f2d629a0a316d635ab6d3e324c8831cb73c496748f66e37625"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentHistogramCollector::collect (cognitive 29): SegmentHistogramCollector::collect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). 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/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4665220225c557f2a309ecaa1a1c61f6f857b671a75a4e5d81b9a79bd01c56"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryParser::compute_logical_ast_from_leaf_lenient (cognitive 29): QueryParser::compute_logical_ast_from_leaf_lenient has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (8 pts), loops 2 (5 pts), boolean chains 1 (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/query/query_parser/query_parser.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76a48d08e13ff9c75dfc0d962093935ac0283e888e77499e709b3fec1913659"}},{"ruleId":"D2","level":"warning","message":{"text":"FastFieldsWriter::from_schema_and_tokenizer_manager (cognitive 27): FastFieldsWriter::from_schema_and_tokenizer_manager has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fastfield/writer.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf646e3f48a5710481f7a46cb5c4458a6c4b3ce281938ddfb863f2825f67917"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy_columnar::columnar::merge::is_empty_after_merge (cognitive 26): tantivy_columnar::columnar::merge::is_empty_after_merge has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (8 pts), match/switch 2 (4 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":"columnar/src/columnar/merge/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c675e02a61e46a34aa3420d3c135f3efb155d8760e096f197c7d80485ffae8e"}},{"ruleId":"D2","level":"warning","message":{"text":"jitexpr::functions::concat::string_concat (cognitive 24): jitexpr::functions::concat::string_concat has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae224b0712d92a156145409f76964e6c1e9951db3096397f784f7e2ec26d4b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::aggregation::bucket::term_agg::build_segment_term_collector (cognitive 23): tantivy::aggregation::bucket::term_agg::build_segment_term_collector has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3 (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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c24e09deac8603823aacf3d4009d94af9ebfe37ff32fc44682daa7cbca743b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompositeSourceAccessors::build_for_source (cognitive 22): CompositeSourceAccessors::build_for_source has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/composite/accessors.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e5a65f82b41548a4d11a8b02aaed4245bfeb03837ca1c6d63f44814ddb24b3"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileFnBuilder::apply_literal_type (cognitive 20): CompileFnBuilder::apply_literal_type has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 8 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/compile/compile_fn_builder.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23f700427daddedfebf80c706699cfb8a03135cd8dd5977c56536ab5f640e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"IntermediateMultiTermsBucketResult::prune_intermediate_results (cognitive 20): IntermediateMultiTermsBucketResult::prune_intermediate_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), 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/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee414fbacb6c319301d903c683257b5f644911c3ea40f7304c38d25c7e97d90"}},{"ruleId":"D2","level":"warning","message":{"text":"IntermediateTermBucketResult::prune_intermediate_results (cognitive 20): IntermediateTermBucketResult::prune_intermediate_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), 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/aggregation/intermediate_agg_result.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9b11028c4e0fccb6a1620ae12ad158ba89d7ecc2b3dae2561031f1b6075f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferedUnionScorer::seek (cognitive 20): BufferedUnionScorer::seek has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (8 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/union/buffered_union.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d87df6fcf473b6b822e989bc2da98ad77b1897e41ebec478fbb51d388d1bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::aggregation::agg_data::build_multi_terms_nodes (cognitive 20): tantivy::aggregation::agg_data::build_multi_terms_nodes has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (7 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/agg_data.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f9d3d6316267deb1969e807f48529ca0ca24673b2c8ea6213863c5a3f38edb"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::query::range_query::range_query_fastfield::search_on_json_numerical_field (cognitive 20): tantivy::query::range_query::range_query_fastfield::search_on_json_numerical_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (7 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/query/range_query/range_query_fastfield.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"14810d59a8f5f5c50de5afd4f949efe386edb8135c2b65578c9f345039a5aa42"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentMultiTermsCollector::into_intermediate_bucket_result (cognitive 19): SegmentMultiTermsCollector::into_intermediate_bucket_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc352c6a92ee0b2c5099a114a52c07ab133c8e7d1c33cc4ac04aaa35ffc255a"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnBlockAccessor::fetch_block_with_missing_ordered (cognitive 19): ColumnBlockAccessor::fetch_block_with_missing_ordered has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/value_source/block_accessor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e07d4ddd865f0d4a5f70a7b664d717013548f8d109c9fc36f5b6018ef96164"}},{"ruleId":"D2","level":"warning","message":{"text":"JitExprValueSourceProvider::open_segment (cognitive 19): JitExprValueSourceProvider::open_segment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/value_source/jitexpr_value_source/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"af57bd197640ce60674820b5e4f93ca06c6c538345caa4c2a9053e1c94676878"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDirectory::garbage_collect (cognitive 19): ManagedDirectory::garbage_collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (6 pts), loops 3 (5 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/directory/managed_directory.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b853b9cb0a583efb6b8c04e01e26ab40c8d78d3da6d184921b71d86222842927"}},{"ruleId":"D2","level":"warning","message":{"text":"TfAndPositionRecorder::serialize (cognitive 19): TfAndPositionRecorder::serialize has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 2 (5 pts), if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postings/recorder.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e4eeb9829d57b75573d7d8aa5cdebd31b14343fc3789894b3d2dc97f686cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"FastFieldExistsWeight::scorer (cognitive 19): FastFieldExistsWeight::scorer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/exist_query.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2ebe5133a95c0ec9a37a527fb6a0748500cd9af432ca2c161b383aef63f0dd"}},{"ruleId":"D2","level":"warning","message":{"text":"StorePlugin::merge (cognitive 19): StorePlugin::merge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/store/plugin.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c715903bfdd024e5f865460e691858a26aa6129c7fd3dd736452016cc2c3df3"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::aggregation::metric::cardinality::str_collector::append_to_sketch (cognitive 19): tantivy::aggregation::metric::cardinality::str_collector::append_to_sketch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/metric/cardinality/str_collector.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd6296b9b43a9329ba12beecde4c39ad02e43ddfa4649e1d35eb1aa73089a44"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::query::boolean_query::block_wand_union::block_wand_single_scorer (cognitive 19): tantivy::query::boolean_query::block_wand_union::block_wand_single_scorer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (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/query/boolean_query/block_wand_union.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5311519080e075dcb9a56d17c8ee209c35d70a642833bff6ac8b8cd9b271cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy_sstable::merge::heap_merge::merge_sstable (cognitive 19): tantivy_sstable::merge::heap_merge::merge_sstable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (4 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":"sstable/src/merge/heap_merge.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fcd2ab5b22cd5ec8b7462b37aa8cb31bff4a3fc27ff6831f6099cd46294cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"MoreLikeThis::create_score_term (cognitive 18): MoreLikeThis::create_score_term has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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/query/more_like_this/more_like_this.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffd5310add466cba8d176eeeddb40091eaaf9f8188f3c928ebeee2d2eb42359"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::aggregation::bucket::multi_terms::expand_partial_combinations_for_field (cognitive 18): tantivy::aggregation::bucket::multi_terms::expand_partial_combinations_for_field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"365c799bf7a0744243955d220e113be88e7f1ffeba38ce3f94f2b41b85a48ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"Dictionary::sorted_ords_to_term_cb (cognitive 18): Dictionary::sorted_ords_to_term_cb has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sstable/src/dictionary.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7a90e9922bedf234c3099b803429ea0504705f09b2f7d077ca32ce6bc3ec1e"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionalIndex::next_non_null_doc (cognitive 17): OptionalIndex::next_non_null_doc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/column_index/optional_index/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ae5bcaff861904046c857e024a86c6edff4f375598e96172b86a1530b98fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy_columnar::columnar::merge::merge_column (cognitive 17): tantivy_columnar::columnar::merge::merge_column has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 3 (6 pts), if/else 2 (4 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":"columnar/src/columnar/merge/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f0643ee70d61140f75dca7fe25c2d0701fbbb649404bc33c22afdbaf92710f"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy::query::phrase_query::phrase_scorer::intersection_count_with_slop (cognitive 17): tantivy::query::phrase_query::phrase_scorer::intersection_count_with_slop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c1515326ff01b7d987ce1df06e0ef85ed7d8721777f8a343fa139099563c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Dictionary::file_slice_for_range (cognitive 17): Dictionary::file_slice_for_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sstable/src/dictionary.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5cc7a89c2ecadf7156a232af07ae82b507ad92e40cb536f530d143658ba83a"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexBuilder::validate (cognitive 16): IndexBuilder::validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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/index/index.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d216da2d264a374d4940f1e0dd87ae7d41f622d34c112e335da7aa4a928e2ad"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexPhraseWeight::get_union_from_term_infos (cognitive 16): RegexPhraseWeight::get_union_from_term_infos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_query/regex_phrase_weight.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd24062e1267c61470de99910e1550dd427d7d03ae3e21057bc5f47a1642b1"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockReader::read_block (cognitive 16): BlockReader::read_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 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":"sstable/src/block_reader.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a348c433aa6ea623fa2c53ceacfdc4877c72f36513f8e490121316883bb665ce"}},{"ruleId":"D2","level":"warning","message":{"text":"tantivy_sstable::block_match_automaton::match_range_start (cognitive 16): tantivy_sstable::block_match_automaton::match_range_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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":"sstable/src/block_match_automaton.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f5a7bef1342ab65c6a6bb18b7bca87238b30060e3c1fb5600dc3da18c75679"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tantivy::tokenizer::ascii_folding_filter::fold_non_ascii_char: FunctionTooLong \u2014 tantivy::tokenizer::ascii_folding_filter::fold_non_ascii_char runs 1474 significant 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 1374 over it, 14.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/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0919819c7a9f5a2ae50011f4f8f1eb0323c9b54a0006cc0d5c0cc2aacea8f229"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tokenizer/ascii_folding_filter.rs: FileTooLong \u2014 1517 significant 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 1017 over it, 3.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a85a873ceaadf843d8c2a270ffc0267342078761f040d9d48f9d0de79225c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tantivy::aggregation::agg_data::build_nodes: FunctionTooLong \u2014 tantivy::aggregation::agg_data::build_nodes runs 208 significant 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 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/agg_data.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de998846745adb18c3e77adf0e99fca6f957566caec16659c3d7f230e13f7f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aggregation/intermediate_agg_result.rs: FileTooLong \u2014 991 significant 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 491 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/intermediate_agg_result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"accb3efdbd668582d48dcc6b5a5e467d23245ff49c599965294add534a24f544"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: multi_terms/mod.rs: FileTooLong \u2014 976 significant 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 476 over it, 1.95\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/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43914e287fcc92618abcc83a6af61aded434f1e76d35fa89fd0690f3a6dba651"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SegmentTermCollector.into_intermediate_bucket_result: MethodTooLong \u2014 into_intermediate_bucket_result runs 191 significant 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 91 over it, 1.91\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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5bb29e86d8b6108247d84bc552f23f24166e7c47ae5c98abf0e97867e6d279"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: term_agg/mod.rs: FileTooLong \u2014 892 significant 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 392 over it, 1.78\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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee3429f3092b2a9feebbe4ea9d5260f58671e584eb3b50319e8040ff4907035"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FieldType.value_from_json: MethodTooLong \u2014 value_from_json runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/field_type.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dc25dba4db7efee8f079ee6a4247817316807c1a307c16637074fa67693e3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aggregation/agg_data.rs: FileTooLong \u2014 792 significant 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 292 over it, 1.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/aggregation/agg_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db51e86b8a5b00fed0d1852b54fd02d6be55054086bb1a7576dadbf274bff772"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Index: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/index.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6952ee671c0f95f89e473ac02b70d50a44dec152bbddbaf02d75dca1b68d5f79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InvertedIndexPluginWriter.index_document: MethodTooLong \u2014 index_document runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/inverted_index_plugin.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"116c8bfe1c3311dd989d7e21246bc165d54b82d280a7cb050c43c983b3f34bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColumnarWriter.serialize: MethodTooLong \u2014 serialize runs 146 significant 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 46 over it, 1.46\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":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110afd1d6748722398ccbd176b5a429a1ddd30bb62d8f3852c6f7dacaaf67b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FastFieldRangeWeight.scorer: MethodTooLong \u2014 scorer runs 142 significant 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 42 over it, 1.42\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/query/range_query/range_query_fastfield.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7b1798a75891fc3e07b2219a8525faceafa9dfaacf9ba57f9e6cf29336da2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BooleanWeight.complex_scorer: MethodTooLong \u2014 complex_scorer runs 138 significant 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 38 over it, 1.38\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/query/boolean_query/boolean_weight.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f29113e40bb580a4e6e9d68c94e142b2f6b1ae8cbc1b5296e6bd9ec29cf3e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query_parser/query_parser.rs: FileTooLong \u2014 679 significant 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 179 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/query_parser/query_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d743f03b28a1d571b2ba5df666e5f43f8fcf225b34aca26fcb9ee016091adde9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompositeSourceAccessors.build_for_source: MethodTooLong \u2014 build_for_source runs 135 significant 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 35 over it, 1.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/aggregation/bucket/composite/accessors.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeb0c38be40d12b8090a981985523579ec86b7d6993ace2fbd21be98423ec13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: writer/mod.rs: FileTooLong \u2014 630 significant 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 130 over it, 1.26\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":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"683bdfd8aa135279bfbbf4f71c1026656c964e0ea4f24ff68cf53686b8a580fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tantivy::aggregation::bucket::term_agg::build_segment_term_collector: FunctionTooLong \u2014 tantivy::aggregation::bucket::term_agg::build_segment_term_collector runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c5091826989593eb07c439ddadb5046cf668feeaf5e3bccad666dfbb3423a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: functions/mod.rs: FileTooLong \u2014 567 significant 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 67 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":"jitexpr/src/functions/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7195fdd62696d5b80f366cc3f6a8765ae3ac489cb512709b76bf45669e4c3c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: histogram/histogram.rs: FileTooLong \u2014 561 significant 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 61 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/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d41498b7c5a7655d064ad103dfc1629eb4c18513f22bddc0cb08ec1bc28e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tantivy::core::json_utils::index_json_value: FunctionTooLong \u2014 tantivy::core::json_utils::index_json_value 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/core/json_utils.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7046734c9ac50cc726752df2b415d7ebdd0d8b73fbe06410aab49ef830e1e67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompositeKeyVisitor.visit: MethodTooLong \u2014 visit 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/aggregation/bucket/composite/collector.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41698ed4501c7f53a9f080baf707679748ec3c93966bffb94e450ef929f29b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Term: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/term.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"47445f613ccfa64187143e13c5db4616c912a83581c0764eb878267cac0dac85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes: FunctionTooLong \u2014 tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/agg_data.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4ce02d29f00724e7a7a4a1638fc55e566fafcaf13d6568f3c111a4263021c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompactDoc: 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/schema/document/default_document.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe05fa2f9ec382bbcfe003ff737a38c2f92c3c9137aa06eb012250f7878471b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: term_agg/flattened_term_histogram.rs: FileTooLong \u2014 510 significant 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 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/term_agg/flattened_term_histogram.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178318017c0aefdf989515acb755f55215f4311ba8bb279d3c47009d79ae3561"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tantivy::index::inverted_index_plugin::write_postings_for_field: FunctionTooLong \u2014 tantivy::index::inverted_index_plugin::write_postings_for_field 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/index/inverted_index_plugin.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c768f343673cd6895d39721e3d643aa81d9b54d9dd904126d0e471a4757b607"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/inverted_index_plugin.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/inverted_index_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36d888ace7a9e5a4cffb085bb7eb8065b3796b757aaaa4e3690500644606be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): jitexpr/src/functions/lower.rs:154-204 | jitexpr/src/functions/upper.rs:153-201 \u2014 These two members are variants of one another: 46 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/lower.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6eeeaf72f789065ea54ab2c48498fa5df64c56820a1fe719c434412273b9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): jitexpr/src/functions/ceil.rs:81-127 | jitexpr/src/functions/floor.rs:81-127 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5331773e92374bdc367ac88a7abde7a41122fccf5e96cd9f9b35c87ac136e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): jitexpr/src/functions/left.rs:113-134 | jitexpr/src/functions/regexp_extract.rs:153-179 | jitexpr/src/functions/regexp_like.rs:122-145 | jitexpr/src/functions/right.rs:114-141 | jitexpr/src/functions/split_after.rs:150-180 | jitexpr/src/functions/split_before.rs:149-179 | jitexpr/src/functions/substring.rs:144-168 | jitexpr/src/functions/trim.rs:167-196 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/left.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b59a1461b0445376e1d1de83f449699324c22922f68cc48077ae1429e9c864"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): jitexpr/src/functions/add.rs:69-97 | jitexpr/src/functions/max.rs:71-95 | jitexpr/src/functions/min.rs:71-95 | jitexpr/src/functions/multiply.rs:72-101 | jitexpr/src/functions/subtract.rs:73-102 \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":"jitexpr/src/functions/add.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd2a4288e353e5ef50055a25c40255fc2897bc50f0bb9a50aadf603e0c0761e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): jitexpr/src/functions/left.rs:25-45 | jitexpr/src/functions/right.rs:26-46 | jitexpr/src/functions/round.rs:40-69 | jitexpr/src/functions/split_after.rs:36-59 | jitexpr/src/functions/split_before.rs:35-58 \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":"jitexpr/src/functions/left.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"73963e31219f7b1b55c65c89ab408909ae92fa7996a49fc68cfd547b6e5d4fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jitexpr/src/functions/concat.rs:204-272 | jitexpr/src/functions/lower.rs:90-111 | jitexpr/src/functions/regexp_extract.rs:153-179 | jitexpr/src/functions/upper.rs:90-110 \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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2629aee92368482e38ea391ad0f9e7aa152d05e78962cc7b4f904c9b5780c44c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jitexpr/src/functions/concat.rs:283-297 | jitexpr/src/functions/lower.rs:122-133 | jitexpr/src/functions/regexp_extract.rs:190-201 | jitexpr/src/functions/upper.rs:121-132 \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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f405ff4f7568f7a227bcc162336cedd612f94f52ff7e4d2ba21008626d8c6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jitexpr/src/functions/divide.rs:59-80 | jitexpr/src/functions/int_mod.rs:65-81 | jitexpr/src/functions/pow.rs:64-80 | jitexpr/src/functions/substring_count.rs:59-74 \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":"jitexpr/src/functions/divide.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"98714bfeb8978259bc69ac3020ef23a49229187b7d5601d8df8425682cd8f947"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jitexpr/src/functions/left.rs:113-134 | jitexpr/src/functions/right.rs:114-141 | jitexpr/src/functions/round.rs:157-223 | jitexpr/src/functions/substring.rs:144-168 \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":"jitexpr/src/functions/left.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e09569c4c9dd0834c6630a6238494cf3dcf40507d7d5c5071f2566ca0a377"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): jitexpr/src/functions/split_after.rs:191-205 | jitexpr/src/functions/split_before.rs:190-204 | jitexpr/src/functions/substring.rs:179-192 | jitexpr/src/functions/trim.rs:206-220 \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":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3d03d341a782e275543d5796610bf65511842c742903ea516b2c7bb89266a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/schema/document/existing_type_impls.rs:41-74 | src/schema/document/owned_value.rs:414-448 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/document/existing_type_impls.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"38548ea0047bcd6b13c92b848a9ae232a7b982a741b5040eaa9aa176dcc004bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): jitexpr/src/functions/add.rs:112-139 | jitexpr/src/functions/max.rs:110-143 | jitexpr/src/functions/min.rs:110-141 \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":"jitexpr/src/functions/add.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f80456e81d74e73f631e663f72b1864ca19a15827b3eda2f07df018f2d5061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/query/boolean_query/boolean_weight.rs:603-630 | src/query/boolean_query/boolean_weight.rs:636-665 \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/query/boolean_query/boolean_weight.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"43326382ac530413e3b9e5e6ae197d383369ea33533bdb639ef31e8ae2e3f3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/aggregation/mod.rs:240-282 | src/aggregation/mod.rs:286-318 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef36789fe40c393efb3fdfc16131aa65d67d4116196b1b7fe8682298d7d8daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): jitexpr/src/functions/divide.rs:95-116 | jitexpr/src/functions/int_mod.rs:96-115 | jitexpr/src/functions/pow.rs:95-118 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/divide.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9415b8565425670c855b06e4b364b94aa840698cea7629f6cda51bd0c3222195"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): jitexpr/src/functions/split_after.rs:108-133 | jitexpr/src/functions/split_before.rs:107-132 \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":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a213532dfffd947e3343bda056d2a1acb1f67374cbcb8208e6b5921b64e217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): columnar/src/column_values/mod.rs:65-79 | columnar/src/column_values/mod.rs:89-102 \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":"columnar/src/column_values/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13f0d2b895c17e63d4592a1b8b8c861ab92dc67e88ae48d5963f6ca5154c6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): columnar/src/columnar/writer/mod.rs:728-762 | columnar/src/columnar/writer/mod.rs:772-811 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce14f28afc2fcdfb6b0b4853c98eaeb258459e497561469071190becce69224"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/query/phrase_prefix_query/phrase_prefix_query.rs:94-126 | src/query/phrase_query/phrase_query.rs:104-132 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_prefix_query/phrase_prefix_query.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd9ac73852c2387894aa124f7377ccf06b95c69274d6f15cdeb125597a43f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): jitexpr/src/functions/comparison.rs:280-307 | jitexpr/src/functions/round.rs:241-285 \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":"jitexpr/src/functions/comparison.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fa17562882985d812b8105ac4899f192d18adc115fbcf7e8c1951d262ed510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/query/automaton_weight.rs:88-112 | src/query/range_query/range_query.rs:220-251 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/automaton_weight.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"763c39eec2ca8b8aa6a0670c85b36d80c51b0970ba0c1299b74883162129feb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): jitexpr/src/functions/and.rs:86-107 | jitexpr/src/functions/or.rs:88-107 \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":"jitexpr/src/functions/and.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ecb61bb5e426152ea0058902d009f46058306592efed99b08e4c430cfb4baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/index/index_meta.rs:116-130 | src/index/segment_reader.rs:489-503 \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/index/index_meta.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c78adae445a87e8574e735102178dbebabb3c78a9ce526073335471ec6c1c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 27\u002B corresponding lines): jitexpr/src/functions/abs.rs:35-61 | jitexpr/src/functions/max.rs:33-65 | jitexpr/src/functions/min.rs:33-65 | jitexpr/src/functions/multiply.rs:34-66 | jitexpr/src/functions/subtract.rs:35-67 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/abs.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3b543cb43488e591f8a3b474344b925e4de658e8f5dd0c9c8ecaf0277234a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): jitexpr/src/functions/split_after.rs:235-253 | jitexpr/src/functions/split_before.rs:234-252 \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":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52ba11f4a46412243c2c762224c15d1c0f693257cbd39f52b9976cfcf86acfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): columnar/src/column_index/multivalued_index.rs:120-144 | columnar/src/column_index/multivalued_index.rs:312-342 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/column_index/multivalued_index.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f252199dadadb8baaa0c5f236296e8c88ad8736ef2dfb8f6e0f71ba73f41796"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/aggregation/bucket/composite/numeric_types.rs:8-46 | src/aggregation/bucket/composite/numeric_types.rs:48-84 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/composite/numeric_types.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"109118dcde4d79e650b0b5547e81a0764350c92d133b08ec5c2faa42c1bf7ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/termdict/fst_termdict/term_info_store.rs:102-121 | sstable/src/index/v3.rs:270-290 \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/termdict/fst_termdict/term_info_store.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84c99db264983078e0388a2088c7354d8acaf5ba9306431787256bfb9abdc45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): sstable/src/dictionary.rs:106-134 | sstable/src/dictionary.rs:141-161 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sstable/src/dictionary.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4feb9533712bd84ad545eab5a525bcc195461943f05953556f9f3d16b80177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 19\u002B corresponding lines): jitexpr/src/functions/left.rs:61-79 | jitexpr/src/functions/regexp_extract.rs:68-89 | jitexpr/src/functions/right.rs:62-80 | jitexpr/src/functions/split_after.rs:81-102 | jitexpr/src/functions/split_before.rs:80-101 | jitexpr/src/functions/substring.rs:80-99 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/left.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a0a25c5cf467d07700849f4dc31abf9c4df071aa9f3d7b5aa4cfd6f1aa347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/aggregation/agg_result.rs:448-465 | src/aggregation/intermediate_agg_result.rs:134-150 \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/aggregation/agg_result.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80034c908c15c33d916a29bebe44827c53c1dd5d804d5e55f64b88ac383da90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/aggregation/value_source/jitexpr_value_source/input_column.rs:77-89 | src/aggregation/value_source/jitexpr_value_source/input_column.rs:98-110 \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/aggregation/value_source/jitexpr_value_source/input_column.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9b619906210a69356a027e021ea51ac53674b590080197d72039215709ebe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/schema/field_type.rs:268-282 | src/schema/field_type.rs:306-321 | src/schema/field_type.rs:324-341 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/field_type.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8cc4e75a07fddce46e3a42c1910d8a238227bd9d178d10eddafb1639bc3929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): columnar/src/columnar/writer/mod.rs:279-298 | columnar/src/columnar/writer/mod.rs:300-319 \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":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"daea46be62a14acb9237ecb5686faaf6d3800f0b9a3920dce02861172a28c6eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jitexpr/src/ast/presence.rs:54-71 | jitexpr/src/ast/presence.rs:75-92 \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":"jitexpr/src/ast/presence.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f05bcbaf7b73f22ca1a4abd170486f7dc396a7d002ce07d2946507541d8129a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/aggregation/agg_result.rs:435-445 | src/aggregation/mod.rs:381-391 \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/aggregation/agg_result.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138c0c2bb1f3cdabbd380a892c5e4a904f5cccd85f39bbbe4936895cb55b00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): common/src/vint.rs:32-54 | common/src/vint.rs:201-223 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/vint.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d102022009317b1ea492302feb9d88b1dd265448bfa8db6940b2f308631d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/aggregation/bucket/multi_terms/mod.rs:764-784 | src/aggregation/bucket/term_agg/mod.rs:1029-1049 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a937ea0086de52a11169227f649f20897e5c7684e22a2554fb0923e941c9645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jitexpr/src/ast/serde.rs:127-144 | jitexpr/src/compile/typed_expr_serialize.rs:66-83 \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":"jitexpr/src/ast/serde.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8679143d467e57f860bde0ac19b41d77d6f65e3676e25425ec2da232c17d539"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): jitexpr/src/functions/lower.rs:41-58 | jitexpr/src/functions/upper.rs:41-58 \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":"jitexpr/src/functions/lower.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e180ca53dc7e4b5fcb0508ae2831dbcc6c5fcfb72610c6f440daf727102d825e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): bitpacker/src/filter_vec/avx2.rs:26-46 | bitpacker/src/filter_vec/neon.rs:22-40 \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":"bitpacker/src/filter_vec/avx2.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed9fc36e2fa8038b6be21d52c02a338e9b95b2e78d4191f14dbabebe83850ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tokenizer/simple_tokenizer.rs:42-55 | src/tokenizer/whitespace_tokenizer.rs:41-54 \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/tokenizer/simple_tokenizer.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ca94a499b5555e1b832c62c99260838860006cc1c89526a8d2eb49ef1b4e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): jitexpr/src/functions/ceil.rs:32-49 | jitexpr/src/functions/floor.rs:32-49 | jitexpr/src/functions/sqrt.rs:30-47 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a86c0f6d3eb1e742b845f42acbfc0a198c2cab7cea00e58bbbc4254f7d25d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/query/phrase_query/phrase_scorer.rs:85-107 | src/query/phrase_query/phrase_scorer.rs:114-139 \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/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1d8655f5e4698580ee70a03035baf1d682eca6a70e8c4430c1214dd7db87f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): jitexpr/src/functions/and.rs:57-71 | jitexpr/src/functions/eq.rs:72-92 | jitexpr/src/functions/neq.rs:60-78 | jitexpr/src/functions/or.rs:59-73 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/and.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe1da175d8e1846eedcd091f1498c1ecd84e73043cc09594f36a8034e008e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/fastfield/readers.rs:304-319 | src/fastfield/readers.rs:331-347 \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/fastfield/readers.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e722cf9084d71cb315f034e5681d71ad67ff92df66cd2e023c3f7f971c522f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 20\u002B corresponding lines): jitexpr/src/functions/concat.rs:114-133 | jitexpr/src/functions/divide.rs:33-53 | jitexpr/src/functions/eq.rs:45-66 | jitexpr/src/functions/int_mod.rs:40-59 | jitexpr/src/functions/neq.rs:35-54 | jitexpr/src/functions/pow.rs:39-58 | jitexpr/src/functions/substring_count.rs:35-54 | jitexpr/src/functions/trim.rs:81-100 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/concat.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"951436aecdb483fcff992f373ca70f0b9339a12c98839943ca1133b538917a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): jitexpr/src/functions/left.rs:85-98 | jitexpr/src/functions/right.rs:86-99 \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":"jitexpr/src/functions/left.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6859859debde02240fdc400be0e4d4bb0ec63d3850ae451ee7320c341653d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 19\u002B corresponding lines): jitexpr/src/functions/and.rs:31-51 | jitexpr/src/functions/is_not_null.rs:31-49 | jitexpr/src/functions/is_null.rs:30-48 | jitexpr/src/functions/not.rs:34-52 | jitexpr/src/functions/or.rs:33-53 | jitexpr/src/functions/regexp_like.rs:57-75 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/and.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d1c2fd6d9a02878a7f6c8568b68f09fc3fd19dbe5df0335f84ed355291c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jitexpr/src/ast/serde.rs:116-125 | jitexpr/src/compile/typed_expr_serialize.rs:43-52 \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":"jitexpr/src/ast/serde.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0489b837aeaaf760378570eadc9f4dbd79ffb5146b45ebc3859190cdba906af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): columnar/src/columnar/merge/term_merger.rs:75-91 | src/termdict/sstable_termdict/merger.rs:72-86 \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":"columnar/src/columnar/merge/term_merger.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a0b8c618266df2c9e031216866f949f076a09c7665544044d3106958d75ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): common/src/bounds.rs:65-78 | common/src/bounds.rs:85-98 \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":"common/src/bounds.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e27deb1a725403398eabe90ba8de56d6bdde5d08556dc18e15b5865a01568a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/postings/compression/vint.rs:2-21 | src/postings/compression/vint.rs:24-42 \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/postings/compression/vint.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bae59ca038ceec500594064b64a7fa8869877d9c0afb5170950ed47d86d1561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/query/phrase_prefix_query/phrase_prefix_query.rs:47-64 | src/query/phrase_query/phrase_query.rs:48-64 \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/query/phrase_prefix_query/phrase_prefix_query.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc4e9a0e8808beffae28d2994826992f08ce3ccabd35175e05b8dd5813a8618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): columnar/src/column/serialize.rs:70-85 | columnar/src/column/serialize.rs:90-105 | columnar/src/column/serialize.rs:113-128 | columnar/src/column/serialize.rs:130-140 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/column/serialize.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3edde712c55a53b693a548c101e3dd5094acebabd84ea9714ae66999827b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jitexpr/src/functions/is_null.rs:80-89 | jitexpr/src/functions/neq.rs:93-102 \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":"jitexpr/src/functions/is_null.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7486eed3a3bae834623228ad4911754299f70479feca2cb191a341816ec56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sstable/src/dictionary.rs:379-390 | sstable/src/dictionary.rs:394-406 \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":"sstable/src/dictionary.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ce34e11ad3c45ae55584173028ae314559011fce8e653564076b66050058e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): jitexpr/src/functions/ceil.rs:55-66 | jitexpr/src/functions/floor.rs:55-66 | jitexpr/src/functions/lower.rs:64-75 | jitexpr/src/functions/sqrt.rs:53-64 | jitexpr/src/functions/upper.rs:64-75 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc44c9ff8f4902ece8485c2aa19f50e62ce043228f2fd0f178c85c975ba86bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): jitexpr/src/functions/comparison.rs:328-343 | jitexpr/src/functions/comparison.rs:345-360 \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":"jitexpr/src/functions/comparison.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f0bf4f09f58200471d0d8e70d04fed0e52b28c64da84c392e11fc92bace7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/postings/compression/vint.rs:65-82 | src/postings/compression/vint.rs:88-108 \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/postings/compression/vint.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc367604a803809947d9816b90dc78773bdc680f606bc1d47960898e4b7bc367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): columnar/src/column_index/optional_index/mod.rs:197-213 | columnar/src/column_index/optional_index/mod.rs:218-230 \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":"columnar/src/column_index/optional_index/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"946b71333aae1ec0c00c19ad3adf9c2cce15c55557445093f5b90b5bda78d4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): jitexpr/src/functions/is_not_null.rs:55-66 | jitexpr/src/functions/is_null.rs:54-65 | jitexpr/src/functions/not.rs:58-69 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/is_not_null.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9213ac6702ef95620cbd5c6396cf042ab3a8fc345e85093a372074a73fdfea0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/store/compressors.rs:152-168 | src/store/decompressors.rs:70-82 \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/store/compressors.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03e0d01e20643ede0dcf128d60feca27b65d3ebb6e161c6fa7296cfff762b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/query/boolean_query/boolean_query.rs:157-169 | src/query/disjunction_max_query.rs:93-106 \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/query/boolean_query/boolean_query.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1c0adf8e40e13867f0bb8bfba3f381d3b45e82ca7b49da5380ca1e0ffad40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): query-grammar/src/infallible.rs:49-57 | query-grammar/src/infallible.rs:65-79 \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":"query-grammar/src/infallible.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"037d94f85dfbd073577585e21a9a2c22ef60bf996128f0afd313ec26ba345564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sstable/src/streamer.rs:45-53 | sstable/src/streamer.rs:61-69 \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":"sstable/src/streamer.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b491182ec038426e08fbe30f47c92682a1ed6d7076ed002ac35a3eaadb09cb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): query-grammar/src/infallible.rs:127-134 | query-grammar/src/infallible.rs:145-154 \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":"query-grammar/src/infallible.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe84d4a4a55baa69a8e598be521254bff77628be3c914142c11038b1741e7838"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tokenizer/ascii_folding_filter.rs:46-56 | src/tokenizer/lower_caser.rs:55-67 \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/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"734503d51216ce5ed653d37770116781b7d8fb6f9f955b3c4d454b15ff71524d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sstable/src/value/range.rs:20-33 | sstable/src/value/u64_monotonic.rs:19-31 \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":"sstable/src/value/range.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d22cf45485fc0bc36243f68c0c3922908bcdb4146d3f0fedfd9994b8f3e01ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): query-grammar/src/query_grammar.rs:319-337 | query-grammar/src/query_grammar.rs:339-357 \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"099ffcb5c19239006f062d9791ee583f7e73f411d5d1e41a2394058ef7ea2d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/query/union/bitset_union.rs:34-47 | src/query/union/bitset_union.rs:49-66 \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/query/union/bitset_union.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc36cf55c7c1c1aaddc940daddb89c0136c74cba354c53887e6c7c536ad0192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): query-grammar/src/query_grammar.rs:861-871 | query-grammar/src/query_grammar.rs:873-884 \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99371005f4ab3331c215972054f25cc4b3f3a31185de4e8cfc14e92c5394c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): columnar/src/columnar/writer/mod.rs:227-237 | columnar/src/columnar/writer/mod.rs:239-249 | columnar/src/columnar/writer/mod.rs:251-261 | columnar/src/columnar/writer/mod.rs:263-277 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"077ac424ee0ae5095354464bd5b12ea228bdfdfec04574e9d293324963ae60a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/aggregation/bucket/histogram/histogram.rs:760-772 | src/aggregation/bucket/range.rs:354-366 \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/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf634b6c4adc9a78e606751f8e7ccc32f837929a54c5097a297846285c1be93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/collector/filter_collector_wrapper.rs:117-131 | src/collector/filter_collector_wrapper.rs:291-305 \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/collector/filter_collector_wrapper.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b40696a3cc85faae3d65515564628ffc9523ca2c6cc97ddf2e5da5236e06875"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): jitexpr/src/functions/int_mod.rs:125-133 | jitexpr/src/functions/pow.rs:128-136 | jitexpr/src/functions/regexp_like.rs:154-164 | jitexpr/src/functions/substring_count.rs:120-131 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/int_mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f4765edd4aedf9be2e9001cd82983c4d6dc2daf7b13b527c0dce77dd824ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/collector/sort_key/order.rs:142-149 | src/collector/sort_key/order.rs:213-220 \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/collector/sort_key/order.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c501c5f9597d85fabf7bec2b573fc00a52d658781915b6390d3e04ce2ec9ab1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sstable/src/dictionary.rs:456-471 | sstable/src/dictionary.rs:545-558 \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":"sstable/src/dictionary.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b68bc20185d989e64887446f7352797e568718f77519516f0cb5a0db52da74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): jitexpr/src/functions/concat.rs:70-79 | jitexpr/src/functions/text_join.rs:48-57 \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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"51df5d8306d799f591059c71ad2c622ec52d1f5f54a18028c180b91bf4253e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/aggregation/bucket/histogram/histogram.rs:518-527 | src/aggregation/metric/extended_stats.rs:395-407 | src/aggregation/metric/percentiles.rs:268-283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a482ec4b25000735ed7ed2e18305391295b8df3678a40390020849f3a9c2f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/vint.rs:177-190 | sstable/src/vint.rs:3-15 \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":"common/src/vint.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c587e58b6cb6936c549f77e382fff4e9e35339515d8330d6e05e7f7b8eafe8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): jitexpr/src/functions/gt.rs:42-51 | jitexpr/src/functions/gt_eq.rs:42-51 | jitexpr/src/functions/lt.rs:42-51 | jitexpr/src/functions/lt_eq.rs:42-51 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/gt.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a81131170dae603e2c6f643662093450d37f93eae7fd707220fd8c3d54ea1d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/schema/term.rs:430-440 | src/schema/term.rs:445-452 \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/schema/term.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f80f38016062023b86c537328a43c9d5a4a74ef57661e591a72e4fdc9738423"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jitexpr/src/functions/round.rs:82-90 | jitexpr/src/functions/substring.rs:66-74 \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":"jitexpr/src/functions/round.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"636223aee31ef02f96862810f56437f075746e59463e0b202d5989a6e5ab1d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/schema/json_object_options.rs:179-187 | src/schema/text_options.rs:287-295 \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/schema/json_object_options.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc61cc7144f9bf96bba639e6e32e7975d1323bf5817b7e615f94d4124c5b87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/termdict/fst_termdict/term_info_store.rs:275-285 | sstable/src/index/v3.rs:528-535 \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/termdict/fst_termdict/term_info_store.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"194be353600cd19ee2a66377fc72f94412fe210c56fb6c411ecddd359a3cceca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sstable/src/value/range.rs:65-73 | sstable/src/value/u64_monotonic.rs:46-54 \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":"sstable/src/value/range.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace3d3922a8255cd8a755b624f6f03b43c4340f4424a6312142a281b5fbbcb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/aggregation/bucket/histogram/histogram.rs:357-373 | src/aggregation/bucket/term_agg/mod.rs:1185-1201 \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/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e679984a6ced82cdd9a5ba990c205b7d583165fa0f99464d50cb5483eea72201"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/aggregation/collector.rs:172-186 | src/aggregation/collector.rs:187-202 \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/aggregation/collector.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c43ff4c317b2a6c388a2df2e8406a5aa4f8b27433d69cc796ae70c2a8d2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/schema/bytes_options.rs:109-117 | src/schema/date_time_options.rs:148-157 | src/schema/numeric_options.rs:191-200 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/bytes_options.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f62c38d4814d97d3d0305f68ce487e77b99e3b671cba9035ed6df9d136b0c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/collector/sort_key/sort_by_string.rs:60-71 | src/collector/sort_key/sort_by_bytes.rs:58-69 \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/collector/sort_key/sort_by_string.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c547aa2b0cd1c1e552414460908bd40025d7b77ee6c05a243cbc9c4283997f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/query/const_score_query.rs:74-84 | src/query/range_query/range_query_fastfield.rs:244-254 \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/query/const_score_query.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab51c048b3d50b9490747df6a006ca9c314caa8490b909ea3708162f0caf9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/query/phrase_prefix_query/phrase_prefix_weight.rs:35-43 | src/query/phrase_query/phrase_weight.rs:33-41 | src/query/phrase_query/regex_phrase_weight.rs:48-55 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_prefix_query/phrase_prefix_weight.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ad299f952a8a94902e710ba01343f60800e08a2b17e04e21ffc7ade89820f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tokenizer/simple_tokenizer.rs:32-38 | src/tokenizer/whitespace_tokenizer.rs:31-37 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/simple_tokenizer.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ee73914d7b35dd4df27dd849569bc12ae15e55bf0baa78a463d2b6fe2508e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): columnar/src/columnar/merge/term_merger.rs:62-70 | src/termdict/sstable_termdict/merger.rs:59-67 \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":"columnar/src/columnar/merge/term_merger.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f279fb0b4facef32edf2cbcf9d2de047c9f7f6c6fe788a3b6f6f33036bef131c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/aggregation/metric/cardinality/numeric_collector.rs:183-189 | src/aggregation/metric/cardinality/str_collector.rs:315-323 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/metric/cardinality/numeric_collector.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc29d7fa52eeceb61c62ca43d90371fa1624a3b84d172b58dc83cfc5f74f04aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/query/exist_query.rs:176-182 | src/query/range_query/range_query.rs:253-259 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/exist_query.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"873cfd6c3be875cad8710f35436c7578e162c515e4d4799dd7d2741ac50d2b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/aggregation/bucket/filter.rs:649-658 | src/aggregation/bucket/term_missing_agg.rs:146-155 \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/aggregation/bucket/filter.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc59c16746bbb417abb92fe89444254e687c9338fba739fb52666c971c6f400"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/indexer/indexing_term.rs:83-87 | src/schema/term.rs:218-223 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/indexer/indexing_term.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a16b4eae2eb36f38a2a6af64b31ad27950517c6535017e21729e7ce89464230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/aggregation/agg_result.rs:36-45 | src/aggregation/intermediate_agg_result.rs:275-283 \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/aggregation/agg_result.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b2695b999de4602ed2b910cc430d53ae2b9c59fc301d6e9b8a674502ab6213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): columnar/src/column_values/u64_based/blockwise_linear.rs:30-38 | columnar/src/column_values/u64_based/linear.rs:65-72 \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":"columnar/src/column_values/u64_based/blockwise_linear.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cc985fe16a574a125e891d1b5863b4046d7201957764db9160b865ca9dd479"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): jitexpr/src/functions/split_after.rs:139-143 | jitexpr/src/functions/split_before.rs:138-142 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fd9774ec1a27f0485db45d52f00285acb13716be8ea81a321565e69ca483fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bitpacker/src/bitpacker.rs:325-335 | columnar/src/column_values/mod.rs:137-145 \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":"bitpacker/src/bitpacker.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2b50c6d4f4d2707e8bc41f8e7716e784b336ebe6e2a044108ac31001c72334"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/schema/bytes_options.rs:31-38 | src/schema/numeric_options.rs:43-51 \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/schema/bytes_options.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba64f274aebaceadd001b4de227025cef230d9f727c92d6a904515c09dea7af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/directory/composite_file.rs:30-34 | src/schema/document/default_document.rs:517-521 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/directory/composite_file.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7562243dcbe8a48e46d047f16d366d164521d6007d7139b150ff03757b0a47b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/aggregation/bucket/histogram/histogram.rs:620-625 | src/aggregation/bucket/multi_terms/mod.rs:857-865 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0c27066703d91c5cab13318b37e63f38aefbeae9afff3c0065ddb989903789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/query/disjunction.rs:164-170 | src/query/union/simple_union.rs:94-101 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/disjunction.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1592bd039026b6f4ed7177f71e3c0fccda75b4a2e2348817dd74cc6756c7f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): common/src/vint.rs:156-160 | stacker/src/expull.rs:79-83 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/vint.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9cfc5bb7623091cb50d9a2302c00a767f4811d0e39a4310a977e5f5f1657de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): jitexpr/src/functions/lower.rs:168-188 | jitexpr/src/functions/upper.rs:167-186 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/lower.rs\u0060 and \u0060jitexpr/src/functions/upper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/lower.rs:168\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":"jitexpr/src/functions/lower.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c410ca3912e05ee4fa550ddc4fdc38e4d91c386ccf7d9a29211ec3429c1b569e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/aggregation/bucket/multi_terms/mod.rs:1307-1327 | src/aggregation/intermediate_agg_result.rs:1126-1145 \u2014 before extracting anything, compare \u0060src/aggregation/bucket/multi_terms/mod.rs\u0060 and \u0060src/aggregation/intermediate_agg_result.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/bucket/multi_terms/mod.rs:1307\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/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2f3c0030f2fd4824a177ab1e08166093fb4dbfba324d855b5fa32685c4d298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): columnar/src/column_index/multivalued_index.rs:129-143 | columnar/src/column_index/multivalued_index.rs:321-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060columnar/src/column_index/multivalued_index.rs:341\u0060 calls \u0060select_batch\u0060 and \u0060columnar/src/column_index/multivalued_index.rs:144\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":"columnar/src/column_index/multivalued_index.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bfabc509267d58ad6c43bced34ddc50a02326d2df9e66d48618026195efd60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/aggregation/bucket/composite/collector.rs:560-578 | src/aggregation/bucket/composite/collector.rs:606-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/aggregation/bucket/composite/collector.rs:560\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/aggregation/bucket/composite/collector.rs:559\u0060 calls \u0060floor\u0060 and \u0060src/aggregation/bucket/composite/collector.rs:605\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/aggregation/bucket/composite/collector.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"196275ea00d8b36635b2ef213a6b9706eb27d7b669bb50b061fd60d5210df765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): src/query/phrase_prefix_query/phrase_prefix_query.rs:99-113 | src/query/phrase_query/phrase_query.rs:106-123 | src/query/phrase_query/regex_phrase_query.rs:201-218 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_query.rs\u0060 and \u0060src/query/phrase_query/phrase_query.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/query/phrase_prefix_query/phrase_prefix_query.rs:99\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/query/phrase_prefix_query/phrase_prefix_query.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bfa21c6bffe8f6ff26cc49cbe26277f2807c6cab542ab5f46b626c2cb60dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/aggregation/bucket/composite/accessors.rs:201-218 | src/aggregation/bucket/composite/accessors.rs:243-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/aggregation/bucket/composite/accessors.rs:201\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/aggregation/bucket/composite/accessors.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5d5739977eee157798515f632317cecb949cbbc1564c5aba0029ca0185878b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): jitexpr/src/functions/split_after.rs:164-180 | jitexpr/src/functions/split_before.rs:163-179 | jitexpr/src/functions/trim.rs:180-196 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/split_after.rs\u0060 and \u0060jitexpr/src/functions/split_before.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/split_after.rs:164\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":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c6bc85420667c863dda011b826ecd1594b558ea35718119bd10bfd1c862918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jitexpr/src/functions/ceil.rs:85-101 | jitexpr/src/functions/floor.rs:85-101 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/ceil.rs\u0060 and \u0060jitexpr/src/functions/floor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/ceil.rs:85\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":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa950777ea53b4daa85f3d1528a39e66dd3b9a9f4660430f78f96d3275b2031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 3): jitexpr/src/functions/divide.rs:60-75 | jitexpr/src/functions/int_mod.rs:66-76 | jitexpr/src/functions/pow.rs:65-75 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/divide.rs\u0060 and \u0060jitexpr/src/functions/int_mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/divide.rs:60\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":"jitexpr/src/functions/divide.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"06022088c05a3c551b9ab1b43fb01315404f60228928720fda6aba3165dab413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): columnar/src/columnar/writer/mod.rs:729-744 | columnar/src/columnar/writer/mod.rs:773-787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060columnar/src/columnar/writer/mod.rs:729\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":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1174a4bfcd6d92a6eb8caf9af375622eaf04fcb8a6ed9f958740ffb51b8a2a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): jitexpr/src/functions/eq.rs:73-87 | jitexpr/src/functions/neq.rs:61-71 \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 \u0060jitexpr/src/functions/eq.rs:73\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":"jitexpr/src/functions/eq.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04736b216b7a9853264dfaacb407e342269e32dce019940a439ae710b71e484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): jitexpr/src/functions/lower.rs:190-204 | jitexpr/src/functions/upper.rs:188-201 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/lower.rs\u0060 and \u0060jitexpr/src/functions/upper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/lower.rs:190\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":"jitexpr/src/functions/lower.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fdbb7327f143149b0fafa00aaa5ecd26fd86944ed0606467137208f9eb423a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): jitexpr/src/functions/max.rs:44-58 | jitexpr/src/functions/min.rs:44-58 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/max.rs\u0060 and \u0060jitexpr/src/functions/min.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/max.rs:44\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/max.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b88a611e173974e80f27f1b1a96b502c7fbec66391a43dcf655bf73e870b692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): jitexpr/src/functions/split_after.rs:109-125 | jitexpr/src/functions/split_before.rs:108-124 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/split_after.rs\u0060 and \u0060jitexpr/src/functions/split_before.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/split_after.rs:109\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":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7555fb712080cc844137e9c67a2248a14d60535e25a09235c90ba7bbd7450f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/postings/compression/vint.rs:7-21 | src/postings/compression/vint.rs:28-42 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/postings/compression/vint.rs:7\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/postings/compression/vint.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9174c7ea8ab8ebb87f24c5e0c9b3e8febbb29848e0b549ba34f7d48925c85c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 4): jitexpr/src/functions/max.rs:81-90 | jitexpr/src/functions/min.rs:81-90 | jitexpr/src/functions/multiply.rs:83-96 | jitexpr/src/functions/subtract.rs:84-97 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/max.rs\u0060 and \u0060jitexpr/src/functions/min.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/max.rs:81\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":"jitexpr/src/functions/max.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2219eb325f6aef2fe32d920b2a16c4b5fb5594bad182e8d239332afcb8dbc22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jitexpr/src/functions/concat.rs:140-153 | jitexpr/src/functions/trim.rs:112-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/concat.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0711fcd28d12ff156feb28207d1c4759c6f32bc345e488009b4b72514d5008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/aggregation/agg_data.rs:875-888 | src/aggregation/agg_data.rs:940-952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/agg_data.rs:875\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/aggregation/agg_data.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb69eae746bf4a2ab417fc3a29315c972849f71a5d4f1e4c300e9fb9622145be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/postings/compression/vint.rs:68-81 | src/postings/compression/vint.rs:94-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/postings/compression/vint.rs:68\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/postings/compression/vint.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e0f6f5cfcd6d7d61b6d9f53a5d380ffde14ee3d01837690788956ceb6e6220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): jitexpr/src/functions/left.rs:26-38 | jitexpr/src/functions/right.rs:27-39 | jitexpr/src/functions/round.rs:44-56 | jitexpr/src/functions/split_after.rs:40-52 | jitexpr/src/functions/split_before.rs:39-51 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/left.rs:26\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 \u0060expression\u0060 to \u0060\u0026UntypedExpr\u0060 in one and \u0060Option\u003C\u0026UntypedExpr\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/left.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2acd978823f7d3e1f9cac70d1aa7518eba398ba77fe1d78cfaa75484e7fa80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): jitexpr/src/functions/concat.rs:260-272 | jitexpr/src/functions/lower.rs:100-111 | jitexpr/src/functions/regexp_extract.rs:168-179 | jitexpr/src/functions/upper.rs:99-110 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/concat.rs\u0060 and \u0060jitexpr/src/functions/lower.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/concat.rs:260\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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a989578a79052377de3b766ea4437ba33353254b6478b6ef1cbea46574b66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): jitexpr/src/functions/split_after.rs:192-205 | jitexpr/src/functions/split_before.rs:191-204 | jitexpr/src/functions/substring.rs:180-192 | jitexpr/src/functions/trim.rs:207-220 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/split_after.rs\u0060 and \u0060jitexpr/src/functions/split_before.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5617be829d3c510740b3d77656097a24661e5d1484d7785dc395012d36e7fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): jitexpr/src/functions/add.rs:45-56 | jitexpr/src/functions/multiply.rs:47-59 | jitexpr/src/functions/subtract.rs:48-60 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/multiply.rs\u0060 and \u0060jitexpr/src/functions/subtract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/add.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/add.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3d63f66248cc5aa63aefcf9c78e76d348ac8a314a939348f66346b32355f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): bitpacker/src/filter_vec/avx2.rs:34-46 | bitpacker/src/filter_vec/neon.rs:28-40 \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 \u0060bitpacker/src/filter_vec/avx2.rs:34\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":"bitpacker/src/filter_vec/avx2.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b307a9f3d565c1b3cc5b64063520978c0c9cac5eb247023a08f2d9dbe5aa1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): jitexpr/src/functions/ceil.rs:103-115 | jitexpr/src/functions/floor.rs:103-115 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/ceil.rs\u0060 and \u0060jitexpr/src/functions/floor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/ceil.rs:103\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":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a739d4cd7d637140235c1030478f6998d53f2343af0eee1b1a1c1682c9967458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/aggregation/bucket/multi_terms/mod.rs:1326-1338 | src/aggregation/intermediate_agg_result.rs:1187-1198 \u2014 before extracting anything, compare \u0060src/aggregation/bucket/multi_terms/mod.rs\u0060 and \u0060src/aggregation/intermediate_agg_result.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/bucket/multi_terms/mod.rs:1326\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/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1e9606b683d8e6b48309b31ad015d8cf200451f765b74d916db6e631ae89c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/index/index_meta.rs:118-130 | src/index/segment_reader.rs:491-503 \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/index/index_meta.rs:118\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/index/index_meta.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b388a50402bb35f0cd7aad3dcd5fb0f67e8e6af8db7ee2af283b0429c50de749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): jitexpr/src/functions/concat.rs:284-295 | jitexpr/src/functions/lower.rs:123-131 | jitexpr/src/functions/upper.rs:122-130 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/concat.rs\u0060 and \u0060jitexpr/src/functions/lower.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/concat.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"584d6466a5ed2426c0b0eafaca350ee9268e678cec8350e11e3a85c1717466e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): columnar/src/columnar/writer/mod.rs:282-293 | columnar/src/columnar/writer/mod.rs:303-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060columnar/src/columnar/writer/mod.rs:282\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":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f28bf83760101d547d3ad514237ed97225a1020cf8e7d63191321cfe5e32b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): jitexpr/src/functions/lower.rs:155-166 | jitexpr/src/functions/upper.rs:154-165 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/lower.rs\u0060 and \u0060jitexpr/src/functions/upper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/lower.rs:155\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":"jitexpr/src/functions/lower.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bef023a5968204f88ec247427b8ce8892b382c487d3965534d30fd556b405a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/query/phrase_query/phrase_weight.rs:125-136 | src/query/phrase_query/regex_phrase_weight.rs:283-294 \u2014 before extracting anything, compare \u0060src/query/phrase_query/phrase_weight.rs\u0060 and \u0060src/query/phrase_query/regex_phrase_weight.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/query/phrase_query/phrase_weight.rs:125\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/query/phrase_query/phrase_weight.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc43ca0a42ed7e0f3b49fe85a834f7138504dd49725b161f86b7746321118f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 4): jitexpr/src/functions/left.rs:126-134 | jitexpr/src/functions/right.rs:133-141 | jitexpr/src/functions/round.rs:213-223 | jitexpr/src/functions/substring.rs:160-168 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/left.rs:126\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":"jitexpr/src/functions/left.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f056bf2fa3cf3ab46f17f833f3fcb192439cc3dc8467e13dbd3f4d103349d49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): jitexpr/src/functions/add.rs:70-80 | jitexpr/src/functions/multiply.rs:73-83 | jitexpr/src/functions/subtract.rs:74-84 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/multiply.rs\u0060 and \u0060jitexpr/src/functions/subtract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/add.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d08b0e3109f04d722e737b4f0899ba35ab362a5c50a9062a03ba5fb5200665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/query/phrase_prefix_query/phrase_prefix_weight.rs:126-142 | src/query/phrase_query/phrase_weight.rs:120-136 | src/query/phrase_query/regex_phrase_weight.rs:278-294 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_weight.rs\u0060 and \u0060src/query/phrase_query/phrase_weight.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/query/phrase_prefix_query/phrase_prefix_weight.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1236b934aa209b488e8990ecd60c500b754197b4a65266e5266c74196e22002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/query/range_query/range_query_fastfield.rs:97-107 | src/query/range_query/range_query_fastfield.rs:164-174 | src/query/range_query/range_query_fastfield.rs:183-193 \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/query/range_query/range_query_fastfield.rs:97\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/query/range_query/range_query_fastfield.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ffb9a2edef2108f0f87fad4949da3754f72623420b5a9c332ab27675de8fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jitexpr/src/ast/serde.rs:132-142 | jitexpr/src/compile/typed_expr_serialize.rs:71-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/ast/serde.rs:132\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":"jitexpr/src/ast/serde.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cd01fb5bcb26157a8687b6bf1f43d3446c550cb09e44eab0e2f1411b96d646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jitexpr/src/functions/ceil.rs:117-127 | jitexpr/src/functions/floor.rs:117-127 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/ceil.rs\u0060 and \u0060jitexpr/src/functions/floor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/ceil.rs:117\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":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"52886f9674e5c158860fbea85791d2a8b763f58d63ddb94e77e51948be04a494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jitexpr/src/functions/max.rs:133-143 | jitexpr/src/functions/min.rs:131-141 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/max.rs\u0060 and \u0060jitexpr/src/functions/min.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/max.rs:133\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":"jitexpr/src/functions/max.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace3e08df172075bc6f921d10b2525403abe20ab8065992e702076257a79b936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jitexpr/src/functions/split_after.rs:65-75 | jitexpr/src/functions/split_before.rs:64-74 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/split_after.rs\u0060 and \u0060jitexpr/src/functions/split_before.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4ef54bad394ea2413fed568d29ae44b85f1e880b141d41be88c336c340a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): jitexpr/src/functions/split_after.rs:236-246 | jitexpr/src/functions/split_before.rs:235-245 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/split_after.rs\u0060 and \u0060jitexpr/src/functions/split_before.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/split_after.rs:236\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":"jitexpr/src/functions/split_after.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd1d95c4788927156ca74f8d3e6f714197f5707dcf706284c7f442136e5b64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): query-grammar/src/query_grammar.rs:670-679 | query-grammar/src/query_grammar.rs:692-701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060query-grammar/src/query_grammar.rs:670\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"query-grammar/src/query_grammar.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ab80ca2d54758d31610a90543133a43024e1a804c51509d1c6de96bf2fd465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/core/json_utils.rs:185-194 | src/core/json_utils.rs:306-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/core/json_utils.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/json_utils.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9daef86179aa02bc18c0ab033e280e1204ccb0c33a5350893aeccc53208d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/query/phrase_query/phrase_scorer.rs:65-74 | src/query/phrase_query/phrase_scorer.rs:87-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/query/phrase_query/phrase_scorer.rs:65\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/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2815e457f1e335fda804add28183a2dbed7c96d4ace92ab7f0edceacea29bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/query/phrase_query/phrase_scorer.rs:155-164 | src/query/phrase_query/phrase_scorer.rs:201-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/query/phrase_query/phrase_scorer.rs:155\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/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"116d6b111ac2045fbb0d7d973d5605613a5128077901ff5b1cdd5d85cfe3d4bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): columnar/src/column/serialize.rs:71-79 | columnar/src/column/serialize.rs:91-99 | columnar/src/column/serialize.rs:114-122 \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":"columnar/src/column/serialize.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89219b315a04882352567c8939134950543db0582487edc3a5cc4cd60bafe68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jitexpr/src/functions/and.rs:58-66 | jitexpr/src/functions/or.rs:60-68 \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 \u0060jitexpr/src/functions/and.rs:58\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":"jitexpr/src/functions/and.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd77a021f3a87715f847bfeb052e6a5d10959759e026ad70cbba533852a6bb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 8): jitexpr/src/functions/left.rs:115-117 | jitexpr/src/functions/regexp_extract.rs:157-162 | jitexpr/src/functions/regexp_like.rs:130-132 | jitexpr/src/functions/right.rs:116-118 | jitexpr/src/functions/split_after.rs:154-162 | jitexpr/src/functions/split_before.rs:153-161 | jitexpr/src/functions/substring.rs:146-148 | jitexpr/src/functions/trim.rs:168-170 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/split_after.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jitexpr/src/functions/regexp_extract.rs:157\u0060 calls \u0060ins\u0060, \u0060iconst\u0060, \u0060pointer_type\u0060 and \u0060jitexpr/src/functions/left.rs:115\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/left.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3235219e9f18bff86d5ccef1921aef98f576fc36524015663f9e5a5a5f871a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): query-grammar/src/query_grammar.rs:984-991 | query-grammar/src/query_grammar.rs:1000-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060query-grammar/src/query_grammar.rs:984\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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58ff3726f477126520405697fdf8498b4df6bf31d069f695187f359b5fc73e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/aggregation/agg_data.rs:466-473 | src/aggregation/agg_data.rs:495-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/agg_data.rs:466\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/aggregation/agg_data.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"6248b76c5519e73900ce3a4d3a80a860acb38d3fddffdf46ca550494ac4126ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/aggregation/intermediate_agg_result.rs:690-698 | src/aggregation/intermediate_agg_result.rs:718-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/aggregation/intermediate_agg_result.rs:690\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/aggregation/intermediate_agg_result.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89656c7cdf3f22168f3a470a2ced2b10951117435a37dcace0922c9ec4da6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jitexpr/src/functions/left.rs:72-79 | jitexpr/src/functions/right.rs:73-80 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/left.rs:72\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":"jitexpr/src/functions/left.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20a2523e361ed48741f3424a19ab8006c3988f33c57c42f7a39ad38632a2649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 3): jitexpr/src/functions/left.rs:118-125 | jitexpr/src/functions/right.rs:129-132 | jitexpr/src/functions/substring.rs:152-159 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/right.rs:129\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jitexpr/src/functions/substring.rs:150\u0060 calls \u0060ins\u0060, \u0060iconst\u0060, \u0060pointer_type\u0060 and \u0060jitexpr/src/functions/left.rs:117\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":"jitexpr/src/functions/left.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7a257cda69453b90c3ea4f0abe1a65511c4a78c3723ad6ced4cb534a93b163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jitexpr/src/functions/lower.rs:65-72 | jitexpr/src/functions/upper.rs:65-72 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/lower.rs\u0060 and \u0060jitexpr/src/functions/upper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/lower.rs:65\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":"jitexpr/src/functions/lower.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9d67dbaa9edce58ab7a31eda6624d55848229c4bf86cb3b93bd6e72984298a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/aggregation/intermediate_agg_result.rs:1147-1152 | src/aggregation/intermediate_agg_result.rs:1162-1169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/aggregation/intermediate_agg_result.rs:1147\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/aggregation/intermediate_agg_result.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bef532e8975f101ec2d645db311f6e3e91578c423231fba81b074ba687ab5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/query/boolean_query/boolean_weight.rs:66-73 | src/query/boolean_query/boolean_weight.rs:416-423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/query/boolean_query/boolean_weight.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/boolean_query/boolean_weight.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db0614b739bac6be60d93f738fd62b8b86041ad4f6e6f22a0eaf36b3eb8604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/query/phrase_prefix_query/phrase_prefix_weight.rs:36-43 | src/query/phrase_query/phrase_weight.rs:34-41 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_weight.rs\u0060 and \u0060src/query/phrase_query/phrase_weight.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/query/phrase_prefix_query/phrase_prefix_weight.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5009b4abe4eb28fc41cf896ddfdd0a3eb3853623fead41762d014777d16a6da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/query/phrase_query/phrase_scorer.rs:115-122 | src/query/phrase_query/phrase_scorer.rs:154-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/query/phrase_query/phrase_scorer.rs:115\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/query/phrase_query/phrase_scorer.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4def8deca4dd9067dad3b95d53e8d3db13bf64e5dee0792d7f518a8b6ea5c933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/query/phrase_query/regex_phrase_weight.rs:241-248 | src/query/phrase_query/regex_phrase_weight.rs:251-258 \u2014 both copies are in the same file, so extract the block 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/query/phrase_query/regex_phrase_weight.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"890aee545858788b4b9083107c5fd0c720dbea7608ef150d187c37d26199e4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): jitexpr/src/functions/regexp_extract.rs:79-85 | jitexpr/src/functions/split_after.rs:92-98 | jitexpr/src/functions/split_before.rs:91-97 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/split_after.rs\u0060 and \u0060jitexpr/src/functions/split_before.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/regexp_extract.rs:79\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":"jitexpr/src/functions/regexp_extract.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"151a74f0d8a8cc8cc426d25b1c57fed9e27c7cde549b415e1a3b59a5e66c5632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jitexpr/src/functions/ceil.rs:56-63 | jitexpr/src/functions/floor.rs:56-63 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/ceil.rs\u0060 and \u0060jitexpr/src/functions/floor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/ceil.rs:56\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":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4009c5a84d022247fa9be6eb059950064b7d48785ff1b2cf650edd819d6aa78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jitexpr/src/functions/left.rs:86-92 | jitexpr/src/functions/right.rs:87-93 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/left.rs:86\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":"jitexpr/src/functions/left.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c66b87a6dcf8fc4cceb2d330909ff230eabc35b1ca1ea9e6ba3694ea0bb0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/aggregation/bucket/composite/collector.rs:428-435 | src/aggregation/bucket/multi_terms/mod.rs:1191-1197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/composite/collector.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaa647c79239157a905a9884d784686ee2519ea27f6693fe455fe49b7316e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/query/phrase_prefix_query/phrase_prefix_query.rs:51-57 | src/query/phrase_query/phrase_query.rs:52-58 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_query.rs\u0060 and \u0060src/query/phrase_query/phrase_query.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/query/phrase_prefix_query/phrase_prefix_query.rs:51\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/query/phrase_prefix_query/phrase_prefix_query.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e1c69fecb0b39a429f9add4613930218a67be552a369988928b9a1be89220d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/query/phrase_prefix_query/phrase_prefix_weight.rs:50-56 | src/query/phrase_query/phrase_weight.rs:65-71 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_weight.rs\u0060 and \u0060src/query/phrase_query/phrase_weight.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/query/phrase_prefix_query/phrase_prefix_weight.rs:50\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/query/phrase_prefix_query/phrase_prefix_weight.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5350896c0db81eb90d707c225c9318e3e226b70d9b9a2b6f4bef90794765da02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jitexpr/src/functions/and.rs:87-92 | jitexpr/src/functions/or.rs:89-94 \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 \u0060jitexpr/src/functions/and.rs:87\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":"jitexpr/src/functions/and.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96145c64a16e5d39905a01332da04f699e2a5d7ab448bfeb62c70ca17723263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): jitexpr/src/functions/int_mod.rs:126-133 | jitexpr/src/functions/pow.rs:129-136 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/int_mod.rs\u0060 and \u0060jitexpr/src/functions/pow.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/int_mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b1de90e1534102405e6de9139bf17185194a5cd83e47911e890771f42d3dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/aggregation/mod.rs:246-251 | src/aggregation/mod.rs:292-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/mod.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/aggregation/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"12477ed6f05eb9886cefb464d159b0b9bbb3f4285c05e310d2615c5abc1da2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/aggregation/value_source/jitexpr_value_source/input_column.rs:79-85 | src/aggregation/value_source/jitexpr_value_source/input_column.rs:100-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/aggregation/value_source/jitexpr_value_source/input_column.rs:79\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/aggregation/value_source/jitexpr_value_source/input_column.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac14b300a1afbe6c2579559d97104bdf562e00e7d94ae366b65c8c47effd880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/fastfield/writer.rs:65-70 | src/fastfield/writer.rs:81-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/fastfield/writer.rs:65\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/fastfield/writer.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3836e4ac5f96b040a01fce101b49c2aad48af4467d566220da5ed37d6238811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/postings/recorder.rs:226-231 | src/postings/recorder.rs:333-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/postings/recorder.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/postings/recorder.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ec98930b840c9a1b3a9260118cd2e280d9496f7e3bdc4156585348cd523a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/query/boolean_query/boolean_weight.rs:617-622 | src/query/boolean_query/boolean_weight.rs:652-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/query/boolean_query/boolean_weight.rs:617\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/query/boolean_query/boolean_weight.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d9fa462691341c934e4076f648d33e2949fa953e12fadbd6ffec95bceb70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/schema/document/existing_type_impls.rs:234-240 | src/schema/document/owned_value.rs:168-174 \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/schema/document/existing_type_impls.rs:234\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/schema/document/existing_type_impls.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b962c81ae795c4cf49c1241ae0576411de9e7dc6648066fdd5caec95d1414a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): jitexpr/src/functions/concat.rs:293-297 | jitexpr/src/functions/lower.rs:129-133 | jitexpr/src/functions/regexp_extract.rs:197-201 | jitexpr/src/functions/upper.rs:128-132 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/concat.rs\u0060 and \u0060jitexpr/src/functions/lower.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/concat.rs:293\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":"jitexpr/src/functions/concat.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f41a1b04988be3b5122cdd0beac797b03eb14a0b5e6bfe03d4b4a8ccc103909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): jitexpr/src/functions/divide.rs:66-74 | jitexpr/src/functions/int_mod.rs:71-75 | jitexpr/src/functions/pow.rs:70-74 | jitexpr/src/functions/substring_count.rs:64-68 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/divide.rs\u0060 and \u0060jitexpr/src/functions/int_mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/divide.rs:66\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":"jitexpr/src/functions/divide.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec1e749bf1aa9f24b037443104f2f7ee221375cc65e116042e1b9c2313ca900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): jitexpr/src/functions/left.rs:38-45 | jitexpr/src/functions/right.rs:39-46 | jitexpr/src/functions/split_after.rs:52-59 | jitexpr/src/functions/split_before.rs:51-58 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/left.rs:38\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":"jitexpr/src/functions/left.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"605555f80892871d54804571f92d18800cad99401cd359ebb2f42314bcbc7c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): jitexpr/src/functions/ceil.rs:105-110 | jitexpr/src/functions/eq.rs:216-220 | jitexpr/src/functions/floor.rs:105-110 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/ceil.rs\u0060 and \u0060jitexpr/src/functions/floor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/ceil.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e25162b398ad170ec4df8aee83ea6643b563cc0ff8318990bd6e18a53f160e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): jitexpr/src/functions/max.rs:121-127 | jitexpr/src/functions/min.rs:121-125 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/max.rs\u0060 and \u0060jitexpr/src/functions/min.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/max.rs:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060jitexpr/src/functions/min.rs:126\u0060 calls \u0060ins\u0060, \u0060icmp\u0060 and \u0060jitexpr/src/functions/max.rs:127\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":"jitexpr/src/functions/max.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7bc3baac1d1626808603718ee222872f3f6c260438d2352b31f42d24a5d06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/aggregation/bucket/multi_terms/mod.rs:1413-1417 | src/aggregation/intermediate_agg_result.rs:1063-1067 \u2014 before extracting anything, compare \u0060src/aggregation/bucket/multi_terms/mod.rs\u0060 and \u0060src/aggregation/intermediate_agg_result.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/bucket/multi_terms/mod.rs:1413\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/aggregation/bucket/multi_terms/mod.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0fc69258213180bcd21b74fae0a78e52a7b5b376299a74d7c9b2fed4ce40ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): jitexpr/src/functions/multiply.rs:116-135 | jitexpr/src/functions/subtract.rs:117-136 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/multiply.rs\u0060 and \u0060jitexpr/src/functions/subtract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/multiply.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/multiply.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab38b6e68d892ca7c191e176da9962f89bfbdc844253b7872583a7b9290693f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): columnar/src/column_values/u64_based/blockwise_linear.rs:24-28 | columnar/src/column_values/u64_based/linear.rs:59-63 \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":"columnar/src/column_values/u64_based/blockwise_linear.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ba646c3bf09a76abc8c18e9de58df34d25af9040bf49414f4a6e54fc97394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jitexpr/src/functions/left.rs:50-55 | jitexpr/src/functions/right.rs:51-56 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/left.rs\u0060 and \u0060jitexpr/src/functions/right.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jitexpr/src/functions/left.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf93184c213c047cbdadd48236da193d17fbe248d1977f7a1a70519c913e33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/aggregation/bucket/range.rs:318-323 | src/aggregation/bucket/term_missing_agg.rs:157-162 \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/aggregation/bucket/range.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"866231ed6194204b574d696df23396b3f0524fe68033cadcb9759fa4595d5652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/docset.rs:215-223 | src/query/intersection.rs:288-296 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docset.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa51f02fca9c4322f42db5f1a6107cb9561caa367a307fac24005426679b2177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/indexer/indexing_term.rs:114-118 | src/postings/json_postings_writer.rs:139-143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/indexer/indexing_term.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b3557c2d2ad461500092ede078387a16109059ffca4868f8687c0c11887ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/query/phrase_prefix_query/phrase_prefix_query.rs:77-83 | src/query/phrase_query/phrase_query.rs:90-95 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_query.rs\u0060 and \u0060src/query/phrase_query/phrase_query.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_prefix_query/phrase_prefix_query.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec2df13bd89c070e9cba17e6c7582bb124cd02503ef04c7b8039c0441b811ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/query/phrase_prefix_query/phrase_prefix_weight.rs:117-123 | src/query/phrase_query/phrase_weight.rs:96-102 | src/query/phrase_query/regex_phrase_weight.rs:269-275 \u2014 before extracting anything, compare \u0060src/query/phrase_prefix_query/phrase_prefix_weight.rs\u0060 and \u0060src/query/phrase_query/phrase_weight.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/phrase_prefix_query/phrase_prefix_weight.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f476df204ff97164c92c901ba639ff11337ceb0a4fc5a0733e47913889bb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/termdict/fst_termdict/streamer.rs:169-175 | sstable/src/streamer.rs:490-496 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/termdict/fst_termdict/streamer.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a908e97d5dfc9336f89cc590f9a8d189495dd00c926dd65714096ff539bf5bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tokenizer/alphanum_only.rs:63-71 | src/tokenizer/remove_long.rs:74-81 | src/tokenizer/stop_word_filter/mod.rs:114-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/alphanum_only.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f917339905d1dd00ad0dbcc5f4c1772d7c4363817148aaf6b063f229192a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jitexpr/src/functions/gt_eq.rs:66-74 | jitexpr/src/functions/lt_eq.rs:66-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/gt_eq.rs:66\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":"jitexpr/src/functions/gt_eq.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c25f191104725cf7a683a7a3f0861809d2145ec3aefea5a58d537a472b1f95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tokenizer/simple_tokenizer.rs:20-27 | src/tokenizer/whitespace_tokenizer.rs:19-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/simple_tokenizer.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"154ff746458913e008a0906e356b9868197f764152892c22fdc7fd54797095a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 6): src/tokenizer/ascii_folding_filter.rs:104-131 | src/tokenizer/ascii_folding_filter.rs:285-312 | src/tokenizer/ascii_folding_filter.rs:318-345 | src/tokenizer/ascii_folding_filter.rs:488-516 | src/tokenizer/ascii_folding_filter.rs:742-769 | src/tokenizer/ascii_folding_filter.rs:1028-1055 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f3110391d21bfb936828c32e90bf343446e8e1c1293417d2cd617513555f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 6): src/tokenizer/ascii_folding_filter.rs:102-129 | src/tokenizer/ascii_folding_filter.rs:316-343 | src/tokenizer/ascii_folding_filter.rs:486-513 | src/tokenizer/ascii_folding_filter.rs:740-767 | src/tokenizer/ascii_folding_filter.rs:869-897 | src/tokenizer/ascii_folding_filter.rs:1026-1053 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3484d1459875f4c6770d283033dbdcd73462aed3674d4ff686cd4f705b920b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 14): src/tokenizer/ascii_folding_filter.rs:96-123 | src/tokenizer/ascii_folding_filter.rs:243-270 | src/tokenizer/ascii_folding_filter.rs:310-337 | src/tokenizer/ascii_folding_filter.rs:432-459 | src/tokenizer/ascii_folding_filter.rs:480-507 | src/tokenizer/ascii_folding_filter.rs:581-608 | src/tokenizer/ascii_folding_filter.rs:660-687 | src/tokenizer/ascii_folding_filter.rs:734-761 | src/tokenizer/ascii_folding_filter.rs:863-890 | src/tokenizer/ascii_folding_filter.rs:903-930 | src/tokenizer/ascii_folding_filter.rs:948-975 | src/tokenizer/ascii_folding_filter.rs:1020-1047 | src/tokenizer/ascii_folding_filter.rs:1146-1174 | src/tokenizer/ascii_folding_filter.rs:1180-1207 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea899e23fcfd7032bba84b03de722c4a95c65866068ee61b9c72ac2f7ec76f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 14): src/tokenizer/ascii_folding_filter.rs:94-121 | src/tokenizer/ascii_folding_filter.rs:241-268 | src/tokenizer/ascii_folding_filter.rs:308-335 | src/tokenizer/ascii_folding_filter.rs:399-427 | src/tokenizer/ascii_folding_filter.rs:478-505 | src/tokenizer/ascii_folding_filter.rs:579-606 | src/tokenizer/ascii_folding_filter.rs:658-685 | src/tokenizer/ascii_folding_filter.rs:732-759 | src/tokenizer/ascii_folding_filter.rs:861-888 | src/tokenizer/ascii_folding_filter.rs:901-928 | src/tokenizer/ascii_folding_filter.rs:946-973 | src/tokenizer/ascii_folding_filter.rs:1018-1045 | src/tokenizer/ascii_folding_filter.rs:1144-1171 | src/tokenizer/ascii_folding_filter.rs:1178-1205 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tokenizer/ascii_folding_filter.rs:944\u0060 calls \u0060Some\u0060 and \u0060src/tokenizer/ascii_folding_filter.rs:900\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ee11fb94d99f8cddf533e761377daf33e0bfbed881d4b2c1460bcc8534c514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/tokenizer/ascii_folding_filter.rs:431-457 | src/tokenizer/ascii_folding_filter.rs:543-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ecdf7c4c74b09a753d4027a8f3c3a92ed5308969b6d5176a9926ac40e94b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 7): src/tokenizer/ascii_folding_filter.rs:107-134 | src/tokenizer/ascii_folding_filter.rs:288-315 | src/tokenizer/ascii_folding_filter.rs:321-348 | src/tokenizer/ascii_folding_filter.rs:700-727 | src/tokenizer/ascii_folding_filter.rs:745-772 | src/tokenizer/ascii_folding_filter.rs:995-1022 | src/tokenizer/ascii_folding_filter.rs:1031-1058 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tokenizer/ascii_folding_filter.rs:994\u0060 calls \u0060Some\u0060 and \u0060src/tokenizer/ascii_folding_filter.rs:700\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/tokenizer/ascii_folding_filter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4c40a2d0ae335f1fa07d1919cf27f9c99b58a6c717f3a09f83e4aee41a1708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/aggregation/bucket/term_agg/mod.rs:1468-1482 | src/aggregation/metric/cardinality/numeric_collector.rs:77-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/aggregation/bucket/term_agg/mod.rs:1468\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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bc33d031902b83b80247b79b0961ac6de39d0564bd9a6d16ae9336e0146c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/query/query_parser/query_parser.rs:860-866 | src/query/query_parser/query_parser.rs:888-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/query/query_parser/query_parser.rs:860\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/query/query_parser/query_parser.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"3224a821b8a83e491882411f1db3a1be53b2267bac56ac396bbfac90d3732c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jitexpr/src/functions/divide.rs:106-111 | jitexpr/src/functions/int_mod.rs:105-110 \u2014 before extracting anything, compare \u0060jitexpr/src/functions/divide.rs\u0060 and \u0060jitexpr/src/functions/int_mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jitexpr/src/functions/divide.rs:106\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":"jitexpr/src/functions/divide.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"10372b9ed42944e5ed80f65b810a5ebc3b59274a0e6ebb690977ad681cb3ca45"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ownedbytes: ownedbytes: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"854e62f0a9dc5c6479d5e13f386c7040abb2e3af5f30fa0994a8009576e07624"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: tantivy-bitpacker: tantivy-bitpacker: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"393de5dd95ba00401c75c559863197699279c0e626d81ab86ff478e1ab48b623"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: tantivy-stacker: tantivy-stacker: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8eb18b87ccc85b2b10b13a623cae98e6a8aff02425468d6cb25b35e747e75488"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: jitexpr: jitexpr: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4e55ea43f897752e1e19a2929bc78975b05b1c9570c90aaed0a515844205fa08"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SegmentUpdater (LCOM4 4): SegmentUpdater\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/indexer/segment_updater.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3091d8665114ed4cca297347a98d110fec4906f858f248d614378b880642d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/aggregation/bucket/composite/map.rs: 43.4% line coverage (86/198)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/composite/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6aaeac5789b796c12b4bd07870fbd91f23c253738b8a4e2fdadf1ab1e2dceb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/collector/top_collector.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collector/top_collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4bab0693b732ca2f68932d7e688d42c33f83ebfb5e0c88768bed84adf7bf2c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/directory/error.rs: 0.0% line coverage (0/38)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/directory/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee491e549f3c780d72a8b2e9c1a56d7247015051bfb25beddc2940ddbc8166c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/error.rs: 5.1% line coverage (3/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dea73955afd46544b478c735472cb4705d6b3761d96222a413d7f5305e851c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/fastfield/error.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fastfield/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ffc2ac656f4d9ff766e1cb737e5e2972404a21e4aa99bb8f45ed51e092df58"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/index/segment_component.rs: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/segment_component.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25632395f51a5fe6b27582ca4440e487019b1e6b44e29fb61b83831f9836ade3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/plugin.rs: 0.0% line coverage (0/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366cb2df6e660e12ebf2e63d1ba0c6ae1508c74dedecfa13d94f05b8fea43ff"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sstable/src/index/v2.rs: 28.8% line coverage (19/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sstable/src/index/v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf2f029dcd176db9043ca5578bbb6edaafe9c6d429fdf4735f1156107c9c7ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/aggregation/bucket/term_agg/mod.rs: src/aggregation/bucket/term_agg/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SegmentTermCollector::into_intermediate_bucket_result at line 1253. 1 of those changes was a fix/bug commit, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 15:29:40 -05:00\u0027 --until=\u00272026-11-10 15:29:40 -05:00\u0027 --full-history --no-merges -- src/aggregation/bucket/term_agg/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"933ab8a2033c4ec64160e92eb4341972b2727104a75c52db28eb7798e99ba300"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/schema/field_type.rs: src/schema/field_type.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in FieldType::value_from_json at line 401. 1 of those changes was a fix/bug commit, and the other 4 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 15:29:40 -05:00\u0027 --until=\u00272026-11-10 15:29:40 -05:00\u0027 --full-history --no-merges -- src/schema/field_type.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/schema/field_type.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7653645635b22f7451a0f28d94e7de25d80cdcef3566e7d5b795ab6acfeb6ed1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/aggregation/agg_data.rs: src/aggregation/agg_data.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in tantivy::aggregation::agg_data::build_nodes at line 335. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 15:29:40 -05:00\u0027 --until=\u00272026-11-10 15:29:40 -05:00\u0027 --full-history --no-merges -- src/aggregation/agg_data.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/aggregation/agg_data.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"300cbccd88cf6945568f4cfb8c33efbe87fdaea0b8c831f91227641b1a30bb0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bitpacker/src/bitpacker.rs: bitpacker/src/bitpacker.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in BitUnpacker::get_range at line 118. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 15:29:40 -05:00\u0027 --until=\u00272026-11-10 15:29:40 -05:00\u0027 --full-history --no-merges -- bitpacker/src/bitpacker.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":"bitpacker/src/bitpacker.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60f38ca9eb18795fee60b9bb25ddd4f60057cc980987126540c3fa7cfd4ee76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/query/query_parser/query_parser.rs: src/query/query_parser/query_parser.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in QueryParser::compute_boundary_term at line 433. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 15:29:40 -05:00\u0027 --until=\u00272026-11-10 15:29:40 -05:00\u0027 --full-history --no-merges -- src/query/query_parser/query_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/query_parser/query_parser.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeca1259f695038737390b1020cd7ac50d503dd1ba6181fb40a3e33db81b3afa"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 39 significant file(s) lose their only recent owner: jitexpr/src/functions/mod.rs, jitexpr/src/ast/presence.rs, jitexpr/src/ast/serde.rs, src/query/doc_predicate_query/jitexpr_predicate.rs, src/query/doc_predicate_query/mod.rs, src/aggregation/metric/cardinality/mod.rs, jitexpr/src/compile/compile_fn_builder.rs, jitexpr/src/functions/add.rs (\u002B31 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b2ee92fe235fbec6b561da290b0a5f75219c9cbb6bb695f1f72833b2ab8fad67"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 10 significant file(s) lose their only recent owner: src/directory/ram_directory.rs, src/directory/footer.rs, src/directory/tests.rs, src/aggregation/segment_agg_result.rs, src/fastfield/alive_bitset.rs, src/fastfield/plugin.rs, src/postings/block_search.rs, columnar/src/column_values/monotonic_mapping.rs (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"806ffca49600ce781457600b5035c835a2f4fa10f6d75cba740b737ca45760c4"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 10 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (63 single-owned of 400 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 400 of the 463 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)) (\u002B4 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/query/phrase_query/regex_phrase_weight.rs, src/query/phrase_query/regex_phrase_query.rs, src/core/tests.rs, src/indexer/single_segment_index_writer.rs, src/query/more_like_this/query.rs, src/query/query.rs, src/schema/document/existing_type_impls.rs, common/src/datetime.rs (\u002B6 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Would be more consistent to return last_term id \u002B 1 \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":"sstable/src/dictionary.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2d78d9ff941d1f00bb753c02054b57909279af2e2659b7ea1e865683d2e0cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO remove this function. (See Issue #1727)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sstable/src/lib.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac994ad0bea9c483faf9ad0079fc842d3ad5f0ca658bf1f19bb776069c173a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we could detect when we reach a !can_match, and skip both state and key \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":"sstable/src/streamer.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5f9c307cadb206eaf0ebda72abc3043767ee686514b0d5f564c9b30d0d4423"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO there is an idea where we only look at the upper bound when our delta_reader \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":"sstable/src/streamer.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c866027327590380afec30d2af9527bb60c813bccab39c73e5bf22891233a926"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add test for sparse search with a block of poison (starts with 0xffffffff) =\u003E such a \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":"sstable/src/streamer.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a213ca2efc4d2dfeef5901fb92190589a86e6845cb0ee20550c7211aceb0b3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use array_windows when it gets stabilized \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":"sstable/src/value/index.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"49478ec988b7d22aed784e639a2c002a0175065fca867ebe64815488b7e84511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we iterate over the entire Map to find matching blocks, \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":"sstable/src/index/v3.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7315eae1216954b853c20f8b17b1e2b218a00ee4dbcb900ce7cb0e2fbd773cec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move this function to tantivy_common? \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":"sstable/src/index/v3.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ad4c4f14219319d08ce9bde3c53ac59d3e4fe5ab15185e58285d9f31f41545"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO in the future this should become an enum of supported dictionaries \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/termdict/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"91afbc4a514ad5a565e059d0ff9a87175fce07cee0cf9e22e261729f1a45031c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: understand why the following fails \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/space_usage/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2c7354d9fa36f1c68fe255f57c69d0db46d96642b9bafaf899ca0878d97990"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: understand why the following fails \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/space_usage/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb16b3143224c74802d265bf37265b57c256f6db52d70c4dd1441a62cbd7eeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO pretty print these types too. \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/schema/term.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"101457b43965a82753f42353def4efcb8f2bf5add18b25d09bb564b0adb217e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve docs \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/schema/document/de.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac6027cecb03d0494a825e3ad1dbe69d3c6c9e44e6c73ef897755251939bc3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve docs \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/schema/document/de.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b1dc077c74d65a967fb1b8c5cf6c9d18e2f424b7a595d550fbf93c0ace3cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve docs \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/schema/document/de.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c3e888e2b866a25cd28d95dba08597a2140969d07384af7d9f7600128a314"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve docs \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/schema/document/de.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe0c2dd68bee67192ced4672d0d44c8ddf7f3a4e780392ec2bc46c7499653cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve docs \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/schema/document/de.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7c05220ae8858d9d324afca5311f71ffd92c248c99d688509081d860a61883"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve docs \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/schema/document/de.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e94a1936cb6b902f2e3593003a67998f2d7e4c831134d4580a1834d37be6bbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Switch to slice instead? \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/schema/document/de.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e173a5fe93eca67dde2bd8f6e4487d81bb4092a4e174b4f8b76a5b6a7e07a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deserializing into OwnedValue is wasteful. The deserializer should be able to work \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/schema/document/default_document.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a46c0b5c4b9d07a09c223a12673a7e20bbb7ca329ccbf9da6aefb6d78f7478"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this be re-added with the serialize 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/schema/document/default_document.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61f3c1abe7cee0aade362fefcf864d35de343aa73b4f959512ef961fb5bf4b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Complete this section... \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/schema/document/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2c42663b5a5cb11de4b1321e8edd76ab40d42289473509146507e8804d4297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add NEAR_REAL_TIME(target_ms) \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/reader/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c57bd1f60d5d64df2bbf7e8c7a07c3257fd3f55b26d145c24c8a0678e7e4e08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Also implement \u0060count\u0060 with deletes efficiently. \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/query/union/buffered_union.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58cc5e7608e0522e9216495926a91d215ac404d20f682059b75c3c98328ef16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use estimate_union \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/query/union/simple_union.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc9a1a2f823f61a7d60f913a02f864bfb90b9520d2de5e61f81648708dabc5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The range query would gain from having a single-value optimization \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/query/term_query/term_query.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9ac3de30ae3cfeb15a745c2fd26aa521c4b0d03316f6d8d4f65b928f7489e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/term_query/term_scorer.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb1b5b94ce1cc84f2741c0f62ed9d560a2f236c046fce74ef7ca7b53eb1827"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/column_values/monotonic_mapping.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f040b0186bfdb1d39c646db66a23f44f6e215552bd6e337d9bc289756c7e28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement a better size hint \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/query/range_query/fast_field_range_doc_set.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7db2ee10e5011037c33d8eb04606970bf4a8c3f246e472d434085a7d7c3fa58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is this correct? \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/query/range_query/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ba59e310e7b3d535a1e94d78624f629d7fb2fcaeb594e8389ed5124f39384c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Make it a field presence request for that specific column \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/query/range_query/range_query_fastfield.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b63d9f6fdbcd39c114ddcd9bc0e265693d6dbce7419e287d56599f2adca4165"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move to rewrite_ast in query_grammar \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/query/query_parser/logical_ast.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7927a60466e6ce812152dae6b413aea4f1d486661412965542285826a0b05c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we include the last term too? \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/query/phrase_prefix_query/phrase_prefix_query.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9aa87216b79797beaa76c60519201875e900991d24e5c3c30919ce585a845"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO modify score?? \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/query/phrase_prefix_query/phrase_prefix_scorer.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c343b23f5f2e99c83512c4acd0ff0976ee4a1ff886acb87bb9444742c8ede600"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Validate these changed align with the HEAD branch. \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/query/more_like_this/more_like_this.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bdc6d50549e3a09bd7b05dce26eea6d8d43986443c76cadef141867ce4124e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use drain_filter when available. \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/query/boolean_query/block_wand_union.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfeea181d7e97e154bad6ec8923d753b1e405bb9d46f3bf37c86bc841c5948f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Consider implementing a \u0060BitTreeSet\u0060 in order to advance faster \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/query/bitset/mod.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b947d9cabd65a1302bdd744826ec478cae1aa9fcd7360eea4ef551f596e0810"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// we need popcount for that to be fast though (TODO). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postings/block_search.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e134345ff12916a7e940c80908a6a9b2e0bfeac7ea8aaae773298ecc15d20e03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO avoid reading twice. \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/postings/recorder.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"016dd2a469bdb07fcd6b6201522c959c8ee538b1d1d64a6f04cc73b5fbb726cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead of zeroing the output, we could use MaybeUninit or similar. \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/postings/segment_postings.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b54ed41288786652c43529bbdc2aede2e4aaa39365ded0b125b8517258a209"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add serialize/deserialize test for terminfo \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/postings/term_info.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"914da611000b27d8c4a0df0b728162faff37987471cc65e412db65a7f68e1cef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Can be optimize as we work with block. \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/indexer/delete_queue.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"949c25bb4acb6d7aa1add486dce219e16904fff33d6643cea4da63d79b6f8394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO detect if field is already sorted and discard mapping \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/indexer/doc_id_mapping.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebcd295ee07d23724888fc2241596ca91bb9e6757106f051be135c43fa88468"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add context to the error. \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/indexer/segment_updater.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a28edb29c1f77517d684a19caf0ea004024134dc2ed3f7fb8ef3e05e0d00ac0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There are cases where this limit causes a \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/index/inverted_index_plugin.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49be23d3415a67a867384037509a9780f1c20d158b71b293d366f0e328d3943"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move to sstable to use the index. \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/index/inverted_index_reader.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdebffab3d100ff26219e2dfe0ee31c75e92e332b623b5e1bf9cd204d4f9828e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove allocation \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/index/segment_reader.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9070ec90801e47636a2ef82bfc21b747a9808486c8b046565e2e2a050fec8478"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO uncomment once merging is available \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/fastfield/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bb76538bc4b8329db48ee012cc975ab7c58b05a0159fd238e2001b3d402735"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //\u003C TODO see if we can hash the field name hash too. \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/fastfield/writer.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc253d29a878d1ca8d9e08a6f61d00a6550b110f471c21c8eff4bba10669dda5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO see other types \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/fastfield/writer.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"304d91520c6b7dbbcee7a5c8acdf86cace8fd62d5aaa48d651609717360a494f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check this is the correct behaviour we want. \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/fastfield/writer.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"93878396c652f0ae5dd0d72d43b2e28302d43b8fcbf1f2a5d6c0bac3290fd3aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle null \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/fastfield/writer.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f50fbe8fb98bd40fdd2526ee1b4a6695ae96cfa29cda9f99e87ca3b1e50a10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be re added once it is added to the JSON Utils section as well. \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/fastfield/writer.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"319bbdce70674c077990ddcda7ef843595837b2dec8c4906eb1685c9087d35a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make a more useful error message \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/directory/error.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de3749d13f49908d0007fc717ab3570a94ecaf07d58c08312ad8faffcc8d336"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make sure the chain position works out. \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/core/json_utils.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffc1102fe03e199a54f86570cb78151b596f9f598fbc5ee7fcddb4ea7081380"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle errors. \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/collector/facet_collector.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a97a23186c8ac4ad2b3fadab72e038bd35e48ddfcd684cf7e54ff7f58ad4afb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060accept_document\u0060 could be further optimized to do batch lookups of column \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/collector/filter_collector_wrapper.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fec3ec56bd970901e527066548589c9720674fee62051b614c69eeb5ab9cce6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060accept_document\u0060 could be further optimized to do batch lookups of column \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/collector/filter_collector_wrapper.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59369578dd48d4a0e646e2a598c9b52b3c1dd6988d9e8534650a3923c3bdba6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Individual lookups to the dictionary like this are very likely to repeatedly \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/collector/sort_key/sort_by_bytes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d347325c12d97ab5f71d8f9e23a830d1e069f1ec87a242eaa336ed9a03872436"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Individual lookups to the dictionary like this are very likely to repeatedly \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/collector/sort_key/sort_by_string.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"489fda731238fbcd16dd3a0c7b3dc8803bb822c5456d317a7006925047cf25e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We currently double-open the column to avoid relying on the implementation \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/collector/sort_key/sort_by_erased_type.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8995cfc7c577cf43cb6214fd21a4ebeb8032dd740f57a5ba1b52f28b5117b32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is an extreme edge case that would be better handled by a collector that does \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/aggregation/agg_data.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"345ca6df67044d72c2f4edad8e6bda418163c8f95fad46216c2a105614aeb940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we can handle patterns like \u0060^prefix.*\u0060 more efficiently \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/aggregation/agg_data.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec42d6bea73c04c1c28d18afba7db6d6ea0f74a68591c4d3e9985dd2e6596ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should list valid values \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/aggregation/agg_tests.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d29411577504711b20d9de5b218b2e3069299a9c7412697272dab36b727a105"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should return an error \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/aggregation/agg_tests.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d834b37acd230aa2c2736ebacd6b33d4799fbd03e480eb3fd0aff1e4d4631ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should return an error \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/aggregation/agg_tests.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"813034c282149bc596ef3a8cac386cbfc3e693775768f17fa5c15a6e44ab33de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: consider using a more advanced data structure for high cardinality \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/aggregation/buffered_sub_aggs.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0806a3186d8b1f719e3c48abd1da7d3a24eaa3210202bf0bd8f9602992192df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is our top-of-the-chain fruit merge mech \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/aggregation/intermediate_agg_result.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a794540f4d652ae565b64e29ead881d653bd3e421d6152f43714d7a690a9e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO optimize me. It could work with run length and branch-free. \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/aggregation/value_source/block_accessor.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd970000987b56f6a85385bc55ccaca0a2c3ed4c39bfda4c36f70bb82d547aa8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once we fetch all values for all bucket ids in one go \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/aggregation/metric/stats.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b91032eaed16852b8b37ebdcfdd91d55c3bc4e4ce0ec861dbf1e2f56256375d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Consider a caching layer to reduce the call overhead \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/aggregation/metric/top_hits.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46e4fd7de2dc74110d84435883c8e3b92619fbba3ea6ee86e9df3b6267763ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is terrible, a new vec is allocated for every doc \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/aggregation/metric/top_hits.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba746ad650fcd097acadfc575c7e049328088ca042f8281e8c7fbb2bde5cec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fix me! Although we do not have control over this, these values are likely \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/aggregation/metric/cardinality/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd30c91dd32a344f62822d5b17a7724f2567b9ce54f796735b5856eef3c2b24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: forward into the inner \u0060sub_agg\u0060 for nested order paths (\u0060filter.metric\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/aggregation/bucket/filter.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3278d65c037af4aa60d491eb281342a2951b8b1b06a675aeecd868e2133c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Bad naming, there\u0027s also SegmentRangeAndBucketEntry \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/aggregation/bucket/range.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"419c4f822feecd1de68aea172bebb0a817db8ad40049bbb5491ddf12d8847bda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A better metric instead of is_top_level would be the number of buckets expected. \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/aggregation/bucket/range.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecaabd8d05686b344ef7c1b9d528e612b0896d2146245bae3883cf1240d48c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A better metric instead of is_top_level would be the number of buckets expected. \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a1f5e39f0797e0d1827f9ed53094dc34db35d64cc0d2c46c6b97572420443"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: forward to \u0060sub_agg\u0060 for nested order paths (\u0060missing_agg\u003Emetric\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/aggregation/bucket/term_missing_agg.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33de72ac72325b5fee476bbec5d3d26d4b76845c883f0ab086140edf3969706"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can easily support this \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/aggregation/bucket/term_agg/flattened_term_histogram.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e790cf41f4e52045a1b81ba838f87ef2d84b3fe2fcb8c23ec2ea1169719bb6a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Benchmark to validate the threshold \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"04206b34f0f4e9fb0dec72aeff44ffd641b6758d7b9abba30ad4523f368be310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Benchmark this threshold. \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"893ffd90576b6df822a8a45c87966916ac2d97ee0187e3b910b09bed635cc60b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: pass expected number of buckets from parent instead of strict is_top_level flag. \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48843e53923ff5538c39fa505f36b0cb1626b2c94d4f51e9bc46673929a0511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid prepare_max_bucket here and handle empty buckets. \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"506113c7e4eed3479bb1f7e2dc0b459ead0ee7ca990f24e2f0cf1d8f32b9cd1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid prepare_max_bucket here and handle empty buckets. \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/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b5116e97e038100aa538362789beeaadec87659e1626c0c87fb1e01d6202e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle rev streaming for descending sorting by keys \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6474dc55957a045fde40d4d934bc8f7808ebc54171421af4125fab475850663b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could have a special collector, that keeps only TOP n results at any \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb751ceccf91ab527eeece5d08a935b590e6465b1b43bb3e03efaf1ba34a78f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO sum_other_doc_count with \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dd7376636e7975b9c27bec38749c3d55900f3da537fb3f6f8af479012f74fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this if after fixing exclude \u002B missing bug \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/aggregation/bucket/term_agg/mod.rs"},"region":{"startLine":3942}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf50d9faedb1e0d433b119366c4ec4c511c1a10dce18af1c8c2c58a5053225a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should support escape sequences \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2622f9f799d91b852471dfa60c5ac82656fcafffa4a5bb9e2b055aeab4eae305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO push error about missing ] \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c1f6a7083408622462f2b5ef06e6f89513e7c39af29b569f69121fe1b58151"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is actually dangerous if the number is actually not representable as a f64 \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e131f447a140e3a4b367c5b8854746a3cf91793142b679fbd8be60534da82b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO maybe this should support multiple chained AND/OR, and \u0022fuse\u0022 them? \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5033c82f9224489e7f573c63792fc5b1a39ae951fa97b0e90ecc1eb918b4126b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO test as part of occur_leaf \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5995d5fa017bce306ece790d920fa070fe240c77128e45f1a476be6bd7b27966"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO trinity-1686a: I disagree that it should fail, I think it should succeed, \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd87b5dbeaa1441d3c95d8c57049f1dd376f5d439f109c8f3ef247f79a1013c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO strict parser default to parsing a normal term, and parse \u0022\u0027www-forme-encoded\u0022 (note \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6b835e8156ccbd818d0068e3afead52e00ece4b197da72ef0fd103dc616906"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO maybe support these too? \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e149769318fa5e230d006a832d2416c64489ae919903d7a04d7526b5afb5f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO not entirely sure about this one (it\u0027s seen as a NOT \u0027-abc:toto\u0027) \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":"query-grammar/src/query_grammar.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7303e47be5c55d5b7acd27f6ecfe1cb38687c03227455bef0fac37e67660c1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape field (in case of \\\u0022) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db257d000ed63e6e24d152b7f0ef49e2756144beca65980a8db3c30f847536"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape field (in case of \\\u0022) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9134010fe12e3a19d60c0aad1458e97060e39393d81ae4c5a6f07bd2743427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape field (in case of \\\u0022) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13fc38ca174e209adf558fc57763330f9c05d649693e6610b0da5f53b602de5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape field (in case of \\\u0022) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c91e610e6b975c6f654d1eb0537973220cce70d3b6e41b811ae7116f9970782"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape element \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6563ed5d20cd1efe89a75c7dbc23443c0c611d6de166f9e441ccc67d69192607"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape element \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3c896c92ef455442c53becff7f7cfbdecd9587e2f431f51d58ba0b463eb1d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape pattern (in case of \\\u0022) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"68137089101dd97effb8a862a6e1ab0e7d3a849e19da507d700cf168e38e668a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape element (in case of \\\u0027) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"454d6d3be449086660b258eff4b5f5733a22c98d22e58dd2dd80b862484b8e81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape element (in case of \\\u0022) \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b45065fc737ef46e970b21d02dc531c635c0548d3314377c365fc3818d85ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape word 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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cff2c678357bd651dcf9acc1dd87e6f1bd8d19a5cd09dcadd9b98fce797ce35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly escape word 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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbe05eab2a85591c3d94b732b1ff408c326756c3ebfa996c6fd8f858773663c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this will break ast reserialization, is writing \u0022( )\u0022 enough? \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":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ed9f8200a2726219ddd1e783f2060e1ea7c0fce09fb179c612e99c5b1d9f93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO actually we probably want to be stricter here, so that we pick the right column in \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":"jitexpr/src/functions/eq.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7824e474dd657027b85b27c74e0e0f14d40719fe30e43b90d60b903c2b264245"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo implement async \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":"common/src/file_slice.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ecc0c7366961646b0895d4b80eeb8c773ea0029a20e463c725eec2a18f1bcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove the allocation. \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":"columnar/src/dictionary.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d730474945889753fe1edcad30c389a172800a397941eb261a69fb327727ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rename load \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":"columnar/src/dynamic_column.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1343360ee3800d12f9d2b2d2bf533fa5e3c84d70332e7bcbd2e1659af456b45f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add non trivial remap and merge \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":"columnar/src/tests.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef63a786bdf3b9cb08a50826ce12d6f82f2b6a6adac7237714bb6068aa120e6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO test required_columns \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":"columnar/src/tests.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa649fb26b032c4b85320567b98c2bfe67a06d76013e24d4d31452f9d0570509"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO document edge case: required_columns incompatible with values. \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":"columnar/src/tests.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89747c38788cc16b902b97a62f2e652e174d8b0b02257710fd27c81831592cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove if possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"columnar/src/columnar/column_type.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be870c744e4050f570791ea166493eb224e708767131f56fe4fbf8f67e7b6d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO avoid the extra deserialization / serialization. \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":"columnar/src/columnar/writer/column_writers.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"662f666d9f9c39cb8fda9f6b65bcfbe94008b3f20a924bf45f60e904cf2ea88d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: split index and values \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":"columnar/src/columnar/writer/mod.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"371e4826b1b855f76bfd3e2b1e2984bd1819236a5ff13ef2e4b68539945e681c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Error Handling. The API gets quite ugly when returning the error here, so \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":"columnar/src/columnar/reader/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad397b6d97ba143505603f6b1f3fc544430329b6c6cb4efa37492aac76783108"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Add unit tests \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":"columnar/src/columnar/reader/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"851ab1811e3dcadccdd4f386b2fbe2174fe87095f76ae95467b97ae5b1aa4bbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO !!! Remove useless terms. \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":"columnar/src/columnar/merge/merge_dict_column.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9d5c1a65b7185ebdb36b86fd9e155e69992207c2d3c0808669a44aace45aea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove me. \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":"columnar/src/column_values/monotonic_mapping.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50e9d98f551858d1ee1d74f6ab91e0441bdfc1fe2710845e9b1821bb57b9a50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize me! the line parameters could be tweaked to include the multiplication and \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":"columnar/src/column_values/u64_based/blockwise_linear.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13f8704f53e483371e46fb47989b4e0e7cc390ae72d34ab548450c9edb3597c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO replace with let else \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":"columnar/src/column_values/u64_based/line.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"72768145b0619946ed4db9fe80fdb3a1d7eefde8e386bc4a82a19e7978c965e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO USE array \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":"columnar/src/column_values/u64_based/line.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca85e0121cd419ba56fca49ee0ef1611522a636d49e65bd7d3d596149bbf86e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. f64::MIN would be better! \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":"columnar/src/column_values/u64_based/tests.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be3648769e931dc873890898bdd9f635d96413ebebbeba981b138696c38dac5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO put the header as a footer so that it serves as a padding. \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":"columnar/src/column_values/u128_based/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7955acecac4600416b65d4c7b83ce11227e85f612cfbe1189554f0c16eccd588"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe calculate exact cost of blanks and run this more expensive computation only, \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":"columnar/src/column_values/u128_based/compact_space/build_compact_space.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbb9c406a6a53d78e4f4eb9f3d847a95048918a2f23897f1af6aac7464a613c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Performance. It would be better to iterate on the ranges and check existence via \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":"columnar/src/column_values/u128_based/compact_space/mod.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30f151ca9be6961f31ed33e35efe349f65ed6f93ecfeb000ffdef10017ebd71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Instead of a linear scan we can employ a exponential search into binary search to \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":"columnar/src/column_index/multivalued_index.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af4096eee4d5a9b7400f96320673770b1937dcf2fb47a68506e0afbe52fa3fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Instead of a linear scan we can employ a exponential search into binary search to \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":"columnar/src/column_index/multivalued_index.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dfa8973a6e9e94fd82cae35f9b11846aa6e76b7c1238365d401fc94266cd85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Instead of a linear scan we can employ a exponential search into binary search to \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":"columnar/src/column_index/multivalued_index.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f7ec1ae0e8d96598b81992376f2ffeb289a300294a078a136d13ca0d4970ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO unit tests \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":"columnar/src/column_index/serialize.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d4ae2465f9d7de6094be13248fdf27657e035abde575a3e3133c7871e6f49a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO unit tests \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":"columnar/src/column_index/optional_index/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8ef77eb69837a0ed58c5e729fe102d85440aa479bc7994271cdbc68f85924"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change the API to require sorted input, and remove the fallback. \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":"columnar/src/column_index/optional_index/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c674d1f40d9781b51bf75c0b0bca2bf234c4307df402994cb1a1d5ee3d35f94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize. We could iterate over the blocks directly. \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":"columnar/src/column_index/optional_index/mod.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0579a7a95edd64527a40444e71a8d9ecb2e2ed1ea81a6b4ca05c22b614d9bd4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Add a good API for the codec_idx to original_idx translation. \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":"columnar/src/column_index/optional_index/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b1e88f4288196ed43ab3f05dc75e2bde2c631559edfabefea5194dc8a640d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO test the following solution on Intel... on Ryzen Zen \u003C3 it is a catastrophy. \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":"columnar/src/column_index/optional_index/set_block/dense.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2739229ed0c0fd5460a67519ee7b206054935434158b6a11eac6b1c095120a04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO actually, the shuffled code path is a bit too general. \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":"columnar/src/column_index/merge/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2495de4e7e84937c2e4212a065596e02a9a9d183f73cec51efdaf474ffc2d66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO simplify or optimize \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":"columnar/src/column/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6134e3133e89d261cfd288b24caaae2cb18c4430825f164d868967716b4fd5f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lift this temporary i32 limit once downstream consumers support the full i64 range. \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":"columnar/src/column/serialize.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82e331fbd4fa804ae1db1b1743a2bbf2fd22e2ee8332ab296b3843a9c502d9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add a batched version \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":"columnar/src/column/plain/block/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c556c5b3e83f9fe80db0e8bbfd70a6f920940fc5adc3b874df39e6937cd415"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO does this make sense for IPv6 ? \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":"columnar/benches/bench_values_u128.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef035cdf70a3813c8cbefa80b86c304411f27d8110d2b50a6d387325c6b96305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo performance: the padding handling could be done better, e.g. use a slice and \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":"bitpacker/src/blocked_bitpacker.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51f60e4fc3d898a5b21f2bc97f8401c81b55807a6aeff1625ae56e6d34cf57b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo performance: for some bit_width we \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":"bitpacker/src/blocked_bitpacker.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c033dd81e7e4e2824a72c76bea1c855b9ee9fef8e2ce5d2e86d5923ebd73da53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo performance: we could decompress a whole block and cache it instead \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":"bitpacker/src/blocked_bitpacker.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a1874414d4c9ce831931dbfc596e8fdbbb573629ba440f6ec5451f4a4fbb38"}},{"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 \u0060stacker/fuzz_test/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stacker/fuzz_test/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a18d5af9efd3368ba64bc1b4aad87bc1804f6e6c907f4eff7eaa4d262aa9207"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 12 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is \u0060(repository root)\u0060 (110790 LoC, 604 module-visible types across 46 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"478467f10526e02b3a7053bc4f1c9f8fc36038d929abffdfd39676ce6e1bfa5f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8bee8b3c04775d3ac4ccfb4f646f198a0b94ec45ca6a651f74e49af40000975e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7719f853b0e3ee04c8c5efae102eb49140f6f199974db4ece9e2c79e37137814"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0897fcd78a91ca095e30b98d5a994ed78846fa8ad6048a901d65a1a93a7cb7b9"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c9120c03eff3877b0cad12d3710aa4d397f09dd0b357f6706f02a55221b89b07"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/document/de.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5c0d5953debaec257f145680d97694997064ce9d7ecdaa16b137b4332f9c42"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/document/se.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da98e2c6682e126eae6e955a5b2b0a71aa77182500f779e4e2ddaeccfac988a"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 12 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/collector/sort_key/sort_by_erased_type.rs, src/tokenizer/ngram_tokenizer.rs, src/query/more_like_this/more_like_this.rs, src/collector/filter_collector_wrapper.rs, src/reader/warming.rs, src/tokenizer/split_compound_words.rs, src/collector/sort_key/sort_by_score.rs, src/schema/date_time_options.rs (and 4 more) (14 orphaned of 400 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 400 of the 463 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collector/sort_key/sort_by_erased_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f1f15817a4af6638d06a25622e85f453dbb0542b2177d4e45e59ce1d5f0131"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/ngram_tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe7ac1f9de2728d70973ef3e28d0bc60b0e5be215d21d83ffaf6d64040f441b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/more_like_this/more_like_this.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be261f1337e7df946e7d4450bf614b3ce8978150a1d6187bbb42bb27753dd89"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collector/filter_collector_wrapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54f1bc2a36a321c186413740218ec2c2085b1f229168df0667b7ae4ed04b272"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reader/warming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20de0f13185bd1276ccd2839d27b8277a05780d45929645444d66823ce5d448c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/split_compound_words.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6959c4a64a011c7554ad8035bd0982d36a9a709e7bb75530e892437cd65dcc7b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collector/sort_key/sort_by_score.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50566fa706ddd3f5ba202909ffcc11e89efe3a52398ce4c573658fc19c97b1da"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/date_time_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c63d08698fd1a20220b5b3e423b1efe2d18f0b89d90e340b0d9d3a6c3c1b93"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collector/sort_key/sort_by_bytes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c1de90104b1d693cdb6903da05c4b3d36ae56f3b9fb8de0b4ab08e080560ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/regex_tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b0df3a67d749e900dddb992e10b23f5f40c505a77493af9ac4474cce8bb24"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schema/document/erased.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"687d282919fe57bdacc6792c162e6481137ad5340ac7a56f722f735ee27496dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tokenizer/whitespace_tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e555507f80e4650a45c2e4c47582e14509ec1e3bb0844534b0e07762aea47ff4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: json_postings_writer.rs \u2194 term.rs: \u0060src/postings/json_postings_writer.rs\u0060 (context postings) and \u0060src/schema/term.rs\u0060 (context schema) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060618e3bd1\u0060 Term and IndexingTerm cleanup (#2750); \u0060842fe929\u0060 split Term in Term and IndexingTerm (#2744); \u00600f4c2e27\u0060 Fixes bug that causes out-of-order sstable key. (#2445) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postings/json_postings_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3116e01a7b5dbfb7a53b71f19b9a0185f0b4ca2e2b1372e76c01860d3cbe4b28"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: segment_writer.rs \u2194 json_postings_writer.rs: \u0060src/indexer/segment_writer.rs\u0060 (context indexer) and \u0060src/postings/json_postings_writer.rs\u0060 (context postings) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060618e3bd1\u0060 Term and IndexingTerm cleanup (#2750); \u0060842fe929\u0060 split Term in Term and IndexingTerm (#2744); \u00600e9fced3\u0060 remove JsonTermWriter (#2238) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/indexer/segment_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583231e49e7cccf4ac4198ce0b4ae6643833b3bb3c65a63c5a1fb59d7b261c4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: user_input_ast.rs \u2194 logical_ast.rs: \u0060query-grammar/src/user_input_ast.rs\u0060 (context query-grammar) and \u0060src/query/query_parser/logical_ast.rs\u0060 (context query) sit in DIFFERENT parts of the tree yet change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006070da310b\u0060 perf: deduplicate queries (#2698); \u0060f4b37411\u0060 feat: Regex query grammar (#2677); \u0060b325d569\u0060 Expose phrase-prefix queries via the built-in query parser (#2044) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"query-grammar/src/user_input_ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c628977b5fdfdffd17c8699eacfd3c9a4ac896e2ee120eb103c4bb963beaf6ba"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: query_grammar.rs \u2194 logical_ast.rs: \u0060query-grammar/src/query_grammar.rs\u0060 (context query-grammar) and \u0060src/query/query_parser/logical_ast.rs\u0060 (context query) sit in DIFFERENT parts of the tree yet change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006070da310b\u0060 perf: deduplicate queries (#2698); \u0060f4b37411\u0060 feat: Regex query grammar (#2677); \u0060b325d569\u0060 Expose phrase-prefix queries via the built-in query parser (#2044) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"query-grammar/src/query_grammar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4169f2a050284fc13f050add900d9aa64d00e0937942a2d335f62046ddd2da"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: json_utils.rs \u2194 json_postings_writer.rs: \u0060src/core/json_utils.rs\u0060 and \u0060src/postings/json_postings_writer.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060618e3bd1\u0060 Term and IndexingTerm cleanup (#2750); \u0060842fe929\u0060 split Term in Term and IndexingTerm (#2744); \u00600f4c2e27\u0060 Fixes bug that causes out-of-order sstable key. (#2445) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/json_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c6bc9dbde406de676f070709454b272ebcbc3e6d6a73a5cfda4fb73c02f7ea"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: index_writer.rs \u2194 segment_register.rs: \u0060src/indexer/index_writer.rs\u0060 and \u0060src/indexer/segment_register.rs\u0060 change together 67% of the time (24 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 24 shared commits counted here, the most recent 3 are \u00607ce950f1\u0060 add method to fetch block of first vals in columnar (#2330); \u0060c431cfcf\u0060 extend proptests, fix race condition (#1107); \u0060f27ce641\u0060 Made the SegmentMeta inventory out of static. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/indexer/index_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fc36e70eb9092c6bb9fbdcd71188b40e567df21307d071ac302d1dc1880fe2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: reqopt_scorer.rs \u2194 buffered_union.rs: \u0060src/query/reqopt_scorer.rs\u0060 and \u0060src/query/union/buffered_union.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060b86caeef\u0060 Major bugfix in intersection; \u0060923f0508\u0060 seek_exact \u002B cost based intersection (#2538); \u006033835b6a\u0060 Add DocSet::cost() (#2707) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/query/reqopt_scorer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2b3d06c4f6485642e30f6d570ee9ff32174b0294d51ad5089042cc1f119fad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: infallible.rs \u2194 user_input_ast.rs: \u0060query-grammar/src/infallible.rs\u0060 and \u0060query-grammar/src/user_input_ast.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060f4b37411\u0060 feat: Regex query grammar (#2677); \u0060e5638112\u0060 all json should be snake_case; \u0060da2ff571\u0060 fix fmt nightly \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"query-grammar/src/infallible.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34722461068157bd5c5975c7531aa9c63153964587e2faad732716b12d88e104"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060columnar/columnar-cli\u0060, \u0060columnar/columnar-cli-inspect\u0060, \u0060stacker/fuzz_test\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!literal.is_none() \u0026\u0026 !literal.types().contains(VarType::I64)\u0060 appears character-identically in 6 files \u2014 jitexpr/src/functions/left.rs, jitexpr/src/functions/right.rs, jitexpr/src/functions/round.rs, jitexpr/src/functions/split_after.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":"jitexpr/src/functions/left.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dbd7c165916d7d9bb95eb2b530fb2ba6984a74d9655a8dcf8936f9f60fb6ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060SOURCE_CONTAINS_MULTIVALUES \u0026\u0026 accessor.is_batch_multivalued()\u0060 appears character-identically in 2 files \u2014 src/aggregation/bucket/histogram/histogram.rs, src/aggregation/bucket/range.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/aggregation/bucket/histogram/histogram.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d011b2a227f0fea1f80618ace7eb34032515b1c889af3d373ef4509d499eabac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input_ptr.is_null() || string_arena.is_null()\u0060 appears character-identically in 2 files \u2014 jitexpr/src/functions/lower.rs, jitexpr/src/functions/upper.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":"jitexpr/src/functions/lower.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0012b418d8d8ab5a16caf6a45144419b7c706e46ed8ae781ac11dddae9d9c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integral \u0026\u0026 value \u003E= 0.0 \u0026\u0026 value \u003C u64::MAX as f64\u0060 appears character-identically in 2 files \u2014 jitexpr/src/ast/literal.rs, jitexpr/src/compile/compile_fn_builder.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":"jitexpr/src/ast/literal.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d671873a1a1d62561712fcb09e8efad66457aa43a824a996bb9133ba775380f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integral \u0026\u0026 value \u003E= i64::MIN as f64 \u0026\u0026 value \u003C -(i64::MIN as f64)\u0060 appears character-identically in 2 files \u2014 jitexpr/src/ast/literal.rs, jitexpr/src/compile/compile_fn_builder.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":"jitexpr/src/ast/literal.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5953b2d0a3e426599d410f391997e8f077d5044bb4055ee0fae4030d0c8f9a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.string \u0026\u0026 left.i64 \u0026\u0026 left.u64 \u0026\u0026 left.f64 \u0026\u0026 !left.boolean\u0060 appears character-identically in 3 files \u2014 jitexpr/src/functions/gt.rs, jitexpr/src/functions/gt_eq.rs, jitexpr/src/functions/lt_eq.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":"jitexpr/src/functions/gt.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b4aced4d6046d057a20a4b2041b11ae055ce8816d2d1cef5941297076ed0b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_type == VarType::None || rhs_type == VarType::None\u0060 appears character-identically in 2 files \u2014 jitexpr/src/functions/comparison.rs, jitexpr/src/functions/eq.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":"jitexpr/src/functions/comparison.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfa34bd769807f9535ed3ba8cb1ca52760977c1c55f3d809de15971b55b46be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_type == VarType::Str \u0026\u0026 rhs_type == VarType::Str\u0060 appears character-identically in 2 files \u2014 jitexpr/src/functions/comparison.rs, jitexpr/src/functions/eq.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":"jitexpr/src/functions/comparison.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"531528257f8015100e6a463b08f1a25c6d45733c0fc6741db5482be716125451"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060literal.is_none() || literal.types().contains(VarType::I64)\u0060 appears character-identically in 6 files \u2014 jitexpr/src/functions/left.rs, jitexpr/src/functions/right.rs, jitexpr/src/functions/round.rs, jitexpr/src/functions/split_after.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":"jitexpr/src/functions/left.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dbbf3161aed831a68c54dcee6e01f8db9e668d338343ab464080fc251c31b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.0.requires_scoring() || self.1.requires_scoring()\u0060 appears character-identically in 2 files \u2014 src/collector/mod.rs, src/collector/sort_key/sort_key_computer.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/collector/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3821a750791314c9ce59d5cd7ecda8caed5766765370e230b77b7f07b4c44a6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.0.requires_scoring() || self.1.requires_scoring() || self.2.requires_scoring()\u0060 appears character-identically in 2 files \u2014 src/collector/mod.rs, src/collector/sort_key/sort_key_computer.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/collector/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2d669f03f8dee9dd582ffae0b593e51f98d903c8d4f20c8c05815e303c7298"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.0.requires_scoring() || self.1.requires_scoring() || self.2.requires_scoring() || self.3.requires_scoring()\u0060 appears character-identically in 2 files \u2014 src/collector/mod.rs, src/collector/sort_key/sort_key_computer.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/collector/mod.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60060fbf736352eb3f17ea34701068637782b0fe9fd1a53c86e5c9e35590fca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.get().fract() == 0.0 \u0026\u0026 value.get() \u003E= i64::MIN as f64 \u0026\u0026 value.get() \u003C -(i64::MIN as f64)\u0060 appears character-identically in 2 files \u2014 jitexpr/src/compile/typed_expr.rs, jitexpr/src/functions/round.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":"jitexpr/src/compile/typed_expr.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"83714574e8b5523a7c9297cb6ec3ae3addff18749a202ef73cb398b97d8eb15f"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060segment_len\u0060 is read from the bytes being parsed at line 28 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 32 \u2014 and nowhere in its scope is \u0060segment_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060segment_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sstable/src/value/vec_u32.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cde705ca16a0926039954c07b1aba1c2743419e8bba6f1693dff2929428873"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-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-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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"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":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-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"}]}],"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":8,"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."]}]}