{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","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-1032","CWE-732","CWE-16"],"owasp":"A02: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":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"MutateHelper::apply_child_deletion_result (cyclomatic 44): MutateHelper::apply_child_deletion_result has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 2 of the 7 functions over the threshold \u2014 including the worst \u2014 and 53 of the 77 points over it (69%), 3.5\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f424999e8b33c9e369bee13a958b16fd5727b5078cc33279387a5bf6b03ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"MutateHelper::insert_helper (cyclomatic 39): MutateHelper::insert_helper has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 2 of the 7 functions over the threshold \u2014 including the worst \u2014 and 53 of the 77 points over it (69%), 3.5\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"0053c00b1d9d9b77de3f018c4785dea74e7ed3a4e7a5d7fe101ca34d0a115c96"}},{"ruleId":"D1","level":"warning","message":{"text":"redb_bench::benchmark (cyclomatic 30): redb_bench::benchmark has cyclomatic complexity 30 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/redb-bench/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc3342d3d80c0bc386e9a7873f33a0d4d68b99c9178e6ac326a688c58c41c15"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionalMemory::lock_whole_storage (cyclomatic 18): TransactionalMemory::lock_whole_storage has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/page_manager.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4545579ff7d0dd382a776241a0f51380a03f9a197b10e783ff3a35de107891"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::check_integrity_inner (cyclomatic 17): Database::check_integrity_inner has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"daed392ab1022659c22d354140216917c17a681bc328250995bd04df715b62e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::compact (cyclomatic 17): Database::compact has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38667c0c19336a108314e69ccdaaf4aaac2f950def8bad5db0b0cdb17764da"}},{"ruleId":"D1","level":"warning","message":{"text":"PagedCachedFile::read (cyclomatic 17): PagedCachedFile::read has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/cached_file.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b3ad248ff74b61cccab9e8fbda5d0f8b8f8d85a9ff50a43a81c9539e0ae784"}},{"ruleId":"D2","level":"warning","message":{"text":"MutateHelper::apply_child_deletion_result (cognitive 138): MutateHelper::apply_child_deletion_result has cognitive complexity 138 (threshold 15). Drivers by points: if/else 40 (107 pts), loops 9 (30 pts), match/switch 1 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 5 of the 23 functions over the threshold \u2014 including the worst \u2014 and 228 of the 408 points over it (56%), 5.7\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47d020228c0990289ce418f7ba633c29af00c741456f0d859498b8446ce5225"}},{"ruleId":"D2","level":"warning","message":{"text":"MutateHelper::insert_helper (cognitive 98): MutateHelper::insert_helper has cognitive complexity 98 (threshold 15). Drivers by points: if/else 40 (85 pts), boolean chains 8, loops 2 (4 pts), match/switch 1 (nesting depth added 47). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 5 of the 23 functions over the threshold \u2014 including the worst \u2014 and 228 of the 408 points over it (56%), 5.7\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4dbaed4a4b65054f16412b505e4948100c9f1a5987ede8a1253745c5ec9e38"}},{"ruleId":"D2","level":"warning","message":{"text":"redb_bench::benchmark (cognitive 51): redb_bench::benchmark has cognitive complexity 51 (threshold 15). Drivers by points: loops 19 (28 pts), if/else 15 (22 pts), boolean chains 1 (nesting depth added 16). 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":"crates/redb-bench/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bb4f5c876ad75c370153fd85f3bf46e05f8ab7df62111f6a14d7be0e4fa797"}},{"ruleId":"D2","level":"warning","message":{"text":"MultimapTable::insert_inner (cognitive 32): MultimapTable::insert_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 1 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6614fd72695e7ee5e2f7e0d3098446c324238d00afae85d88a629c157316a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"MultimapTable::remove_inner (cognitive 32): MultimapTable::remove_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 1 (4 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":"src/multimap_table.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"3017514c0fe12bf2d535c741e2f7561c4a00309cb8a5fc6bec6a9a7154cf2a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteTransaction::process_freed_pages_nondurable_helper (cognitive 30): WriteTransaction::process_freed_pages_nondurable_helper has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (12 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transactions.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72ee2d8c3a10502586f7d6717da16198cac62151136913bc4212986a90eae6b"}},{"ruleId":"D2","level":"warning","message":{"text":"BuddyAllocator::resize (cognitive 30): BuddyAllocator::resize has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 16). 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/tree_store/page_store/buddy_allocator.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd9c937870992d35f3387e3e2799db04a779b7ac0cb945055b71f9f9d25fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"PagedCachedFile::read (cognitive 30): PagedCachedFile::read has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/cached_file.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"6decbd6c9ec5902cfb6d6f881cfc7753ebc77cfd53a10105a554c4a807936387"}},{"ruleId":"D2","level":"warning","message":{"text":"PagedCachedFile::write (cognitive 30): PagedCachedFile::write has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 1 (4 pts) (nesting depth added 17). 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/tree_store/page_store/cached_file.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f65fdca8fc5c00d60949642b1c1f942eb5c41ab8740b5f85d3c685b7e991ea"}},{"ruleId":"D2","level":"warning","message":{"text":"MutateHelper::splice_insert_run (cognitive 27): MutateHelper::splice_insert_run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (4 pts), match/switch 1 (4 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 5 of the 23 functions over the threshold \u2014 including the worst \u2014 and 228 of the 408 points over it (56%), 5.7\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bc56dea77a0360f9d35e3bc7acd9eb05f48d1b0dd87c255360967fbf6c9fba"}},{"ruleId":"D2","level":"warning","message":{"text":"MutateHelper::replace_leaf_children (cognitive 24): MutateHelper::replace_leaf_children has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 5 of the 23 functions over the threshold \u2014 including the worst \u2014 and 228 of the 408 points over it (56%), 5.7\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2709957582f8d2192f6382a35913e35ab21f29b90712a9a1bb53f197109c7e35"}},{"ruleId":"D2","level":"warning","message":{"text":"Allocators::resize_to (cognitive 23): Allocators::resize_to has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/region.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb008b31766e6e475e8ed974201e1030b6e33449aa981ec411ed04f5c2b9e91"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::check_integrity_inner (cognitive 22): Database::check_integrity_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b549a346c959d7ec7e21bba1eb6d8d338c48beb90c4dae6e3bc1ddb1bd653a0"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionalMemory::lock_whole_storage (cognitive 22): TransactionalMemory::lock_whole_storage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/page_manager.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bda6612159ce85a60c0b4dd96d3b11255bd005ac6cdc399d2ece45c4b1096c7"}},{"ruleId":"D2","level":"warning","message":{"text":"redb::table::debug_helper (cognitive 21): redb::table::debug_helper has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc9cd0276abd77445806f7315c0000992d69134b7911f2d85ebeece3c095dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::compact (cognitive 20): Database::compact has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"699eaed6ed2d8d7a39a5fcb9e54abdd7795db27b63c7ff3411e468e26728fe4e"}},{"ruleId":"D2","level":"warning","message":{"text":"redb_bench::print_results_table (cognitive 19): redb_bench::print_results_table has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/redb-bench/src/lib.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99554bd2750d58566060b1e1a6cb47cd5af69368f7890395ac9d482748d46d1"}},{"ruleId":"D2","level":"warning","message":{"text":"BuddyAllocator::debug_check_consistency (cognitive 19): BuddyAllocator::debug_check_consistency has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/buddy_allocator.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2409ba040b0c074a7ac56515bf98e66ef5ebc6d13e6b1171d211345c5c03119d"}},{"ruleId":"D2","level":"warning","message":{"text":"redb::tree_store::multimap_btree::relocate_subtrees (cognitive 18): redb::tree_store::multimap_btree::relocate_subtrees has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/multimap_btree.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6767d2d66b80a5521568078ac7ccbdde6657d5aa11ba88bca3996af3e300afc3"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteTransaction::print_allocated_page_debug (cognitive 17): WriteTransaction::print_allocated_page_debug has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 3 (nesting depth added 5). 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/transactions.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9e81bec5689ec6e65ab3e8630520e35695ea72a9bc67417f8968b257f6e4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"RawBtree::verify_checksum_helper (cognitive 17): RawBtree::verify_checksum_helper has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b1b26fb92c2cbb4b1866b1710f3ef4e0c1b7b18e7cd3ff6f833edfdb321547"}},{"ruleId":"D2","level":"warning","message":{"text":"redb::tree_store::multimap_btree::multimap_stats_helper (cognitive 17): redb::tree_store::multimap_btree::multimap_stats_helper has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/multimap_btree.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"020c8cbdfe5e6410518c3027235cd942e11087513d638c55eab629d42d5bd1ba"}},{"ruleId":"D2","level":"warning","message":{"text":"MutateHelper::build_branch_nodes (cognitive 16): MutateHelper::build_branch_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/tree_store/btree_mutator.rs holds 5 of the 23 functions over the threshold \u2014 including the worst \u2014 and 228 of the 408 points over it (56%), 5.7\u00D7 the next-largest file (crates/redb-bench/src/lib.rs at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"2273e4e581397c0821235fc53f64c4231e3b69bc3c4436738f6c76943e66ff76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: redb_bench::benchmark: FunctionTooLong \u2014 redb_bench::benchmark runs 384 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 284 over it, 3.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/redb-bench/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2adf3ba69065fff96bf4b5b4aff0b30f2ba5a10e9604f1458a4deb36084674"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transactions.rs: FileTooLong \u2014 1815 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: WriteTransaction (3 blocks, 930-2749). The bar is 500 significant lines; this is 1315 over it, 3.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transactions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f86090db8b39e69c1855620fc7dae867ed1081be13a30d3143279ad080a00ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutateHelper.insert_helper: MethodTooLong \u2014 insert_helper runs 333 significant 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 233 over it, 3.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2ee7d1b6752dd2c2709d4685a1786e3ff2e00398b03685a731d356822174e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TransactionalMemory: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/page_manager.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbedbf112fd2fdfd097ca0e6d1cf95894f0b18a2b8f81051ade019dd5aa8167"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MutateHelper: ClassTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 96-1824. The bar is 400 significant lines; this is 840 over it, 3.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b98d380f37d534e35f2fc5d8455b7842a26f41b7ee3cc07380f15b039073fdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_store/btree_base.rs: FileTooLong \u2014 1542 significant 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 1042 over it, 3.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de695558b6571c619e1851ab65b1dfa85bb70f7a594b5fe42ac3346d94b8d79d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page_store/page_manager.rs: FileTooLong \u2014 1488 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: TransactionalMemory (2 blocks, 661-2570). The bar is 500 significant lines; this is 988 over it, 2.98\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/page_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f26fc304d19e6c1b4dd73268c12ea284206845f7b5f6c04b02b2c313ac004d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_store/btree_cursor.rs: FileTooLong \u2014 1445 significant 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 945 over it, 2.89\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/tree_store/btree_cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1cd7332e86d99df637c4b133fd7cb533470592f625414536fada4925d41e80"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TransactionalMemory: ClassTooLong \u2014 1141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 99 methods, 2 blocks, lines 661-2570. The bar is 400 significant lines; this is 741 over it, 2.85\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/page_manager.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"712051806f9d9da9344409190bce1ac651f43f9766ecc5777490969d5ff28981"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WriteTransaction: ClassTooLong \u2014 1099 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 3 blocks, lines 930-2749. The bar is 400 significant lines; this is 699 over it, 2.75\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/transactions.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"334410eb96b15917fc62228a45c7138f48e7acc18dd7ab4582f808db2568936b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/db.rs: FileTooLong \u2014 1319 significant 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 819 over it, 2.64\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/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12d7bc14aa180305691c3cfc246f0b0970c8570717470c62ba74ae64d59443d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_store/btree_mutator.rs: FileTooLong \u2014 1294 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: MutateHelper (2 blocks, 96-1824). The bar is 500 significant lines; this is 794 over it, 2.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d99c8ca99452e204b9be78fbc7d82b580bcddd727231c21454bdea42501cf78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutateHelper.apply_child_deletion_result: MethodTooLong \u2014 apply_child_deletion_result runs 225 significant 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 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a7fcc9bed0a9dbfc5e7352b868e2d81ab08d4fc76b3c2c9a5ccf0ff0d70f25"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WriteTransaction: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transactions.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"20502bc03ccfabbf2c1e11b6124ef2ab28e78c329b7f26a3ad8030c24ad30cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/table.rs: FileTooLong \u2014 959 significant 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 459 over it, 1.92\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/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bf59fbbd943fd3265776c692c93a102227a3cc916a8b025c29138db8189487"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_store/btree.rs: FileTooLong \u2014 953 significant 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 453 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6f88ca0e804c714e714de2b8e69883b11773872f8250d30039adec3712056f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/multimap_table.rs: FileTooLong \u2014 936 significant 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 436 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a4d6d9d81ac3f7771fe44cdbed166b673dac333411a6fba9f5594e42d0a13e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 854 significant 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 354 over it, 1.71\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":"crates/redb-bench/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fa4e28f8a6f8214c2c371e9f449147380a7ce8daa87fb41099be37462f06e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Database: ClassTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 5 blocks, lines 811-2496. The bar is 400 significant lines; this is 272 over it, 1.68\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/db.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"2715f001656ee1b04af3dfab376f914b5267deee88f3ba923c0838a563973a4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error.rs: FileTooLong \u2014 744 significant 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 244 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2295e0a5e6ae36c3fe42167e22d325ef6bf69e3c37de40b8747dd6a322a9546a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CursorMut: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_cursor.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b1832a67990dfe5dad72d3b605d1b9a1f96c0d99da0bbfa1639348259d68c2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CursorMut: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 3 blocks, lines 701-1613. The bar is 400 significant lines; this is 149 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_cursor.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f839fe1d89b33af29c674ce5c797d36b2b87993265989ddfe0f508a3f77243ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page_store/xxh3.rs: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/xxh3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"841de46e430333bad178a7230507af1de865c4f96aea5f8de3fa032b872c88b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultimapTable.insert_inner: MethodTooLong \u2014 insert_inner runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"abab8674b11462f3ab12a87522fef281eff17bc548ddd799c855798b9ec69d30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fb8f56c8341d2b8c67f31e436861de344022da6a4abd40d80305ace391de22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page_store/cached_file.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: PagedCachedFile (2 blocks, 302-1030). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/cached_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f25cbd3c9ca8e58ca73269f4b45bb2e00924e7fc17a14edd9af3b176f403c80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PagedCachedFile: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/cached_file.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"97feec05e2ddf28b7b20103637cb632c2076be77976aba5a1731bc8701ab582b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransactionalMemory.new: MethodTooLong \u2014 new runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/page_manager.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b41b67f5fbd54a79147efacec3ff8a5a3eac291ecdf676d9c0dc22bdbac3985"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_store/table_tree.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: TableTreeMut (3 blocks, 228-818). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/table_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a145673d703d8ae623d3aa677451800f4aa5f67e2b593b7faf05f9ec5c9701a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TransactionTracker: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transaction_tracker.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e420a615ee912b479eced724842814ea16f7e35ab6457c99d7e546e8f05a0c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BtreeMut: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf6dd31e6e5f8cc7e4ddd091f2147dd70ae21e3145c7ab8a1c0fe34983ee2d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PagedCachedFile: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 2 blocks, lines 302-1030. The bar is 400 significant lines; this is 23 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/cached_file.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feab5e5f96e89ff42b13487019621a58a6a73b39503fc0c6f8fed28b343ff7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultimapTable.remove_inner: MethodTooLong \u2014 remove_inner 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/multimap_table.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c03c5e583f821dbd3e63e7baf3efc6d56d5db832075ae40d89ac358344ca2e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableTreeMut: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 3 blocks, lines 228-818. The bar is 400 significant lines; this is 3 over it, 1.01\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/tree_store/table_tree.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b2dfc09950d4a562f585eb912c1a891f4107334d8931b4a7f7e69dbdb4191"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/table.rs:328-341 | src/table.rs:497-509 | src/transactions.rs:467-480 | src/transactions.rs:498-510 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49392afaec46326b351add1dd8488e0ca9e85a5882e10c278a9196307da6a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tree_store/page_store/xxh3.rs:885-907 | src/tree_store/page_store/xxh3.rs:909-951 \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/tree_store/page_store/xxh3.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb281546298ded293a5e1bd1e1484cc24a310068e07e6473ec53c28dbf1efdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tree_store/btree.rs:1136-1158 | src/tree_store/btree.rs:1175-1198 \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/tree_store/btree.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f3d2f6ea30c29853c2647c7b880cc39c5b97af99b38e4f7cf3f8550513e081"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/tree_store/table_tree.rs:421-460 | src/tree_store/table_tree.rs:469-500 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/table_tree.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ae6ab6c8e3f0b750077603cc913f1d195d6e97e48c3b477ae35b1a1f472b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/error.rs:333-360 | src/error.rs:545-578 \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/error.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"977731af743b3af181cd13ab85353564f136b0b52c1af08c314372acb386acf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tree_store/page_store/xxh3.rs:564-584 | src/tree_store/page_store/xxh3.rs:592-611 \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/tree_store/page_store/xxh3.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bd7f81a5dccea635f2ea8608a773c658b4f9f31d12343d6a840ab241f076bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tree_store/table_tree.rs:203-225 | src/tree_store/table_tree.rs:284-310 \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/tree_store/table_tree.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d3c77896df27be0a54556cfe8ccecd8308d22380a9df9d14a905006b83d584"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tree_store/btree_base.rs:80-105 | src/tree_store/btree_base.rs:110-135 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_base.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5196ce7edeff706bc8e010ecd8dc49804933636f4bb3dc504cd4cd51beb247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tree_store/page_store/xxh3.rs:374-395 | src/tree_store/page_store/xxh3.rs:426-448 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/xxh3.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a900fc0ee4750b8bb5edc7b6068f30b4db71878aa36b2fdb21da181f0a549e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tree_store/page_store/xxh3.rs:515-533 | src/tree_store/page_store/xxh3.rs:538-556 \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/tree_store/page_store/xxh3.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"29943eba1e5b5d72381f283478a75d4277c2f88b43b9a97e64a0d1d89006d8ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tree_store/page_store/file_backend/optimized.rs:454-487 | src/tree_store/page_store/file_backend/optimized.rs:490-520 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/file_backend/optimized.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d31c8a0dc51e8739de6c8f41280400f06d9e5f0db67466fded561ec4a813e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tree_store/btree_cursor.rs:1444-1466 | src/tree_store/btree_cursor.rs:1472-1493 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_cursor.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f646cf59ad9c3499d80cb770b6f9a128325d5c785e11fe776b1d50e307c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/multimap_table.rs:258-282 | src/multimap_table.rs:286-306 \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/multimap_table.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5414542a0f54badae51e1aab74495dac371817f06bf1435da0305efbf81744b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tree_store/extract_if.rs:107-132 | src/tree_store/extract_if.rs:134-157 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/extract_if.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38dbdeb6d00afa11376de5614fa2927c4672825c640511ec5ed33911db071e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/table.rs:1562-1576 | src/table.rs:1617-1632 \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/table.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"680e462d35bc6f7bc0e8911cfbfd123948f122da40b690a055dadfb72d5cd860"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tree_store/page_store/xxh3.rs:187-211 | src/tree_store/page_store/xxh3.rs:214-238 \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/tree_store/page_store/xxh3.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"59477cd044ddb68d89911fbf05fac8ca281ea497798ceb870c76f9475f582384"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/table.rs:1903-1916 | src/table.rs:1940-1953 \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/table.rs"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c24148e9a1fa8084ccdc844886dfbc67c2944be59f0105fafb8a9f1f146939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/multimap_table.rs:184-205 | src/multimap_table.rs:214-241 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5697c68d127b0617eda53dcd995df9d4a9d7ac2bb0e2a1af57efc6aae3c83037"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/multimap_table.rs:390-407 | src/multimap_table.rs:411-428 \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/multimap_table.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c227300a6d863c3b53e5eb74283d58cc42059234e9d6570b110084ec9bea2e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/transactions.rs:2778-2794 | src/transactions.rs:2829-2850 \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/transactions.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ed142f451d7e9ffc711ceda302dec7a5b1331c44d5f4ebfbdc33510a294523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tree_store/btree_base.rs:1145-1170 | src/tree_store/btree_base.rs:2157-2180 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_base.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae424173dc034324e8022a1162b29318120fa92bd6649f5c0756ffc5385392f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tree_store/btree_base.rs:593-609 | src/tree_store/btree_base.rs:619-638 \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/tree_store/btree_base.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea53f5d9f065f919d46d6e13780b201a4809233dfd2efca2c8047fe6c5a95e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/transactions.rs:2800-2823 | src/transactions.rs:2856-2881 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transactions.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b56e119509892082854c5e1eb5bea2371404bad1d9c72c738b2d62000d7164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tree_store/btree.rs:452-470 | src/tree_store/btree.rs:877-895 \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/tree_store/btree.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"73210ec3ed790b77511be1dbb42959196ca2a1a39a970f6c5815180d0099fffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tree_store/table_tree.rs:521-537 | src/tree_store/table_tree.rs:544-560 \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/tree_store/table_tree.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"175ea647188db3a5d4f5ced938db981d70218763ac95bda0ee2a050e58eeaba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/transactions.rs:680-695 | src/transactions.rs:702-716 \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/transactions.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d679ad639e1230793a0b017c1e1a0632c38844afa452f06e1f84ea1bf4fa2d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tree_store/btree_base.rs:544-566 | src/tree_store/btree_base.rs:1865-1885 \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/tree_store/btree_base.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a916875a5445a39c0023f9f474416a8a0d7ee5a35d88593791aec8cc9970439d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tree_store/btree.rs:529-541 | src/tree_store/btree.rs:544-556 \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/tree_store/btree.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d796e81e2e5673bbc1c95a547d14074d65d7a4f3a1cd6a20f30fc7ffc3d17e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tree_store/btree_base.rs:2182-2189 | src/tree_store/btree_base.rs:2284-2293 \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/tree_store/btree_base.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a7e627c341e35a9dcddd3d1ec245fbded6c9e73110263728f867fd04efd07a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tree_store/btree_cursor.rs:802-820 | src/tree_store/btree_cursor.rs:1115-1141 \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/tree_store/btree_cursor.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ff1d40b1638a8b228b4bbbff78e4e5ee99097132c7436b309104dac3e0bcdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tree_store/page_store/file_backend/optimized.rs:388-405 | src/tree_store/page_store/file_backend/optimized.rs:431-448 \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/tree_store/page_store/file_backend/optimized.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdc81fa4527904fa4618a88ff7d132ce956b5c97ff8c55b02ef8d34e49fec31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/multimap_table.rs:975-992 | src/multimap_table.rs:1110-1127 | src/multimap_table.rs:1300-1317 \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":"src/multimap_table.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a411419ab444b973b735f401a6601e34044bf8f2421416ff2a966cee3f1a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/tree_store/btree_base.rs:1172-1185 | src/tree_store/btree_base.rs:1199-1209 | src/tree_store/btree_base.rs:2201-2213 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_base.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baa7e80c26c07790e43182f6b5eb38842df480c36bc44e6ce42bafe038350b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tree_store/btree_cursor.rs:1001-1013 | src/tree_store/btree_cursor.rs:1045-1057 \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/tree_store/btree_cursor.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8274addbcfa2dc3be8a955527fcee9dc71ffb62a6de6ed1455ae6d006ba092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tree_store/page_store/file_backend/fallback.rs:41-57 | src/tree_store/page_store/file_backend/optimized.rs:288-303 \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/tree_store/page_store/file_backend/fallback.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7c12bd3f84d3ca6f075fd3531ff69f09883916401a1f42a5f9597497698afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/db.rs:2373-2393 | src/db.rs:2397-2412 \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/db.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1154ba625bba713cf4bb3d1d8bcc1b1a250e3f6bccf054dac4ef493f3b22412f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/table.rs:1223-1232 | src/table.rs:1236-1245 \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/table.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9633baa92d2072e113dd8e06234d6dd2c0ba8deb9c665d9763279c904d33f8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): src/table.rs:1835-1850 | src/table.rs:1864-1879 | src/table.rs:1968-1983 | src/table.rs:1998-2013 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd94d2685d13c1ddedc6a28cc73262813ec389401759c0919582f42d92b962ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/redb-python/src/table.rs:316-323 | crates/redb-python/src/table.rs:326-333 \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":"crates/redb-python/src/table.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39c07d126395e4cc438550b9638afed18b30a366309c277513800da27c5db93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tree_store/btree_cursor.rs:1918-1931 | src/tree_store/btree_cursor.rs:1938-1948 \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/tree_store/btree_cursor.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6c0f6f779cc4ae022433505f5dcef82fc9acf504df42a803f7d7f3c16ff2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tree_store/page_store/page_manager.rs:994-1004 | src/tree_store/page_store/page_manager.rs:1007-1019 \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/tree_store/page_store/page_manager.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fbd96b4aad77f0c7636fe5bd7f75995a082b1f4557b4433e552a2f35990007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): fuzz/fuzz_targets/fuzz_corruption.rs:53-62 | fuzz/fuzz_targets/fuzz_corruption.rs:74-83 | src/tree_store/page_store/backends.rs:140-148 \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":"fuzz/fuzz_targets/fuzz_corruption.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a3813f414b33925d9080a00e994bea4edf23aa4f82dbb2738e989790cfd786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tree_store/btree_base.rs:1933-1944 | src/tree_store/btree_base.rs:1946-1958 \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/tree_store/btree_base.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5669c7a921f065a9d5fc8d42d7fb2e5a7b6e0d81cf279ba0f300fdf0af8d8637"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/db.rs:687-694 | src/db.rs:821-827 \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/db.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9424588ed1c9f3765e7c6ae22703b1debb256b2a9340617b96e15c52924fd9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): src/multimap_table.rs:499-508 | src/multimap_table.rs:512-521 | src/table.rs:1296-1305 | src/table.rs:1309-1318 \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":"src/multimap_table.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc9c5b5f19377236580c2c46cf4a3b5c16f5b6c723f602d662cb20ec3dea0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 6\u002B corresponding lines): src/table.rs:371-376 | src/table.rs:429-434 | src/table.rs:562-567 | src/table.rs:572-577 | src/table.rs:1051-1056 | src/table.rs:1061-1066 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"04266287c9a30dbbd7070972321105c9e637f29a268abe203671b841ea893c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tree_store/page_store/page_manager.rs:2504-2512 | src/tree_store/page_store/page_manager.rs:2514-2522 \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/tree_store/page_store/page_manager.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5954efd07b905c1efb9191e0becae5d92a080cf359ccacb36e76aaa16a47f87a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/transactions.rs:738-748 | src/transactions.rs:756-766 | src/transactions.rs:782-792 | src/transactions.rs:799-809 \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":"src/transactions.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4363ccc9feb61c4cd2df0894a12ecb879ef9fe9c0b39699e9b03bf0148db435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tree_store/btree_cursor.rs:909-922 | src/tree_store/btree_cursor.rs:924-937 \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/tree_store/btree_cursor.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9070a5b6c915ec058eb2fdc9531526c94156da1acb77459832cb37e5e7c7d1d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/transactions.rs:534-550 | src/transactions.rs:621-639 \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/transactions.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e503e0eaa23f120073f62fe3a4e5a9f68e7d0ca3811de115f3091edd30567934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tree_store/btree.rs:390-400 | src/tree_store/btree.rs:432-446 \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/tree_store/btree.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36eb34cac729e77651a12f63d6b2322f3ac17426bd99e840b3d322fb927da2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tree_store/page_store/page_manager.rs:1519-1526 | src/tree_store/page_store/page_manager.rs:1690-1697 \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/tree_store/page_store/page_manager.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea690eebb378a9bc05f539927b3f967cbbb35ac7fc517024dffa1e7402ad071"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/multimap_table.rs:132-143 | src/multimap_table.rs:166-178 \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/multimap_table.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92be3c13d72d887850a3b7c6e89b2d348bb5de7248f95a5ad8c5e0436ae7530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tree_store/btree_cursor.rs:230-235 | src/tree_store/btree_cursor.rs:240-252 \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/tree_store/btree_cursor.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f750768f3a9892a4c51f8106605a4b4bd60d2a299fa6c465553997780f927d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/table.rs:583-589 | src/transactions.rs:514-520 \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/table.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb248b02d5b30937970ec4fc31a14d48f9a24f464680f4357355febe4bdfac33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/multimap_table.rs:1031-1034 | src/table.rs:546-549 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ad9e423ce4d38decd2518cabfc0fb0c6484ecd06f5ab244935e6eeb2c4860a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/multimap_table.rs:1250-1253 | src/table.rs:958-961 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"00042f8d0a40071c082167df8f9f41006eafb7fcb43b30500900b299cb14e1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/multimap_table.rs:1361-1364 | src/table.rs:1035-1038 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0510f88b57ecbc79d02558c4fd7f59515d7c11fcacbf97e3049d055f04e4e52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/table.rs:967-971 | src/transactions.rs:444-448 \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/table.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2944b0505a5641dd871ac9e9cb1bb46a5170e6925f3e38130e8e74fae352dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/tree_store/btree.rs:726-729 | src/tree_store/btree_cursor_range.rs:67-70 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6e4061f03cf3f687b25090d1283f303e3c83ddb656a9e73e4b1a33937c422f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 3): src/tree_store/btree_mutator.rs:1640-1667 | src/tree_store/btree_mutator.rs:1702-1727 | src/tree_store/btree_mutator.rs:1775-1800 \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/tree_store/btree_mutator.rs:1640\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/tree_store/btree_mutator.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d30bf64f5cc733404f59e8122cf0cc48c0de58dc71233cc65b4cc54f5c9469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/multimap_table.rs:1209-1229 | src/multimap_table.rs:1329-1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4b255e2d67fba75274496b518555bff187883ff89afb7349ec13c170fc0bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tree_store/btree.rs:1341-1361 | src/tree_store/multimap_btree.rs:133-153 \u2014 before extracting anything, compare \u0060src/tree_store/btree.rs\u0060 and \u0060src/tree_store/multimap_btree.rs\u0060 as WHOLE FILES: this scan already matched 3 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 \u0060src/tree_store/btree.rs:1341\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/tree_store/btree.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"04aa766ca95fccfdbe9d4b42ff08627e0547aa267098ef2b0cc3cab291222997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/tree_store/btree_mutator.rs:944-963 | src/tree_store/btree_mutator.rs:978-996 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tree_store/btree_mutator.rs:996\u0060 calls \u0060get_page_number\u0060 and \u0060src/tree_store/btree_mutator.rs:963\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/tree_store/btree_mutator.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3f2785caa90513c3d3ee761fbff73c14d0aae3b3cb55efa38a202369af9ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/multimap_table.rs:392-407 | src/multimap_table.rs:413-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/multimap_table.rs:392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f73f2964513fe65541a91267cd19791f7b2fc25af2a502b305f6d7efe5122b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/table.rs:444-459 | src/table.rs:469-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ab3aa2e4af0deb5d74ada6b69bc6b484cea189d0809d731f4db96b417392b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tree_store/btree_mutator.rs:1669-1684 | src/tree_store/btree_mutator.rs:1732-1747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/btree_mutator.rs:1669\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/tree_store/btree_mutator.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30ef22197c32baddf1fa2b13e8a0d66e80b6ccebd8a5dd170377237cd3ea237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tree_store/btree_mutator.rs:759-772 | src/tree_store/btree_mutator.rs:899-912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/btree_mutator.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"0362bb6c9499dd84bc0de93175ce25aabe781d0aaec91b89445b835efeaae4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tree_store/page_store/page_manager.rs:2019-2031 | src/tree_store/page_store/page_manager.rs:2304-2316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/page_store/page_manager.rs:2019\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/tree_store/page_store/page_manager.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5f98462e4e80bf30d510be0de98f217e4a9c5dd3d1f2e1759b0c73911b58fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tree_store/table_tree.rs:763-775 | src/tree_store/table_tree.rs:783-795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/table_tree.rs:763\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/tree_store/table_tree.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"095755a3fcf74ae8e8c6565115c279926f6719901dbc9ddaf1edea16c53aeb9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tree_store/table_tree_base.rs:395-407 | src/tree_store/table_tree_base.rs:409-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/table_tree_base.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0142fd51f0ffd5069b5aefe22d437f937f57170acedf7f6b1a3bd45f3398987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/db.rs:1509-1520 | src/db.rs:1524-1535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"597fca14d0ce20362f5af684d1d3c51428742dd880a7c573eb90ecd37e344d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/multimap_table.rs:266-277 | src/multimap_table.rs:290-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/multimap_table.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b829dfa6383a8067933ec18991656e382ca34c8e950d10c7c2260aa55297880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/table.rs:329-341 | src/transactions.rs:468-480 \u2014 before extracting anything, compare \u0060src/table.rs\u0060 and \u0060src/transactions.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 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":"src/table.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf6c4325c9fbe4e5e88f4580ec951c24d2f75f8599a0a6596e6071223f5733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/table.rs:498-509 | src/transactions.rs:499-510 \u2014 before extracting anything, compare \u0060src/table.rs\u0060 and \u0060src/transactions.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 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":"src/table.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2bb7c0c2d5d776e7fffe91f70510ee207cf443185d480c6fbed194c2bef0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/transactions.rs:1901-1912 | src/transactions.rs:2002-2013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/transactions.rs:1901\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/transactions.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19b4afae15fc5de2c3fb806676cc9709e87ceb80d84ebcff337abe230e5de4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tree_store/btree.rs:1327-1338 | src/tree_store/multimap_btree.rs:118-129 \u2014 before extracting anything, compare \u0060src/tree_store/btree.rs\u0060 and \u0060src/tree_store/multimap_btree.rs\u0060 as WHOLE FILES: this scan already matched 3 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 \u0060src/tree_store/btree.rs:1327\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/tree_store/btree.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab178372f7c1e83e16b8ffb418c12d3b21752be6bc0b9863a08a81ea9e99f2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/table.rs:1402-1412 | src/table.rs:1501-1511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/table.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389556255c6c7ff2a1d361ffcae944993fc8dce7670a846b19116205020ab13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tree_store/extract_if.rs:113-123 | src/tree_store/extract_if.rs:138-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/extract_if.rs:113\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/tree_store/extract_if.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28105f4786e84f7ac0f13084bd2bced07783b5e31fb93148a1036de573b369a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tree_store/page_store/file_backend/fallback.rs:47-57 | src/tree_store/page_store/file_backend/optimized.rs:293-303 \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/tree_store/page_store/file_backend/fallback.rs:47\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/tree_store/page_store/file_backend/fallback.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6ed39eae5435e9d6ba0c71f74a6d37a8729787b49e4ede5276cb6fa843aeb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tree_store/table_tree.rs:450-460 | src/tree_store/table_tree.rs:490-500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tree_store/table_tree.rs:450\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/tree_store/table_tree.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bc2955bae37d6b467cce951063a323f059b0cb9e7e5f6ecdd8835b676bc7a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/table.rs:330-339 | src/table.rs:498-507 | src/transactions.rs:469-478 | src/transactions.rs:499-508 \u2014 before extracting anything, compare \u0060src/table.rs\u0060 and \u0060src/transactions.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ea0d37ced598c243787c2af6434e25db9995f7ff567fd40aee671ea8841b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/db.rs:1625-1634 | src/db.rs:1645-1654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/db.rs:1625\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/db.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f558f3e8e6368173d1f9baf891ecdd43a83de52aeb18e5b3d22436b0c0dcb075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tree_store/btree.rs:1137-1145 | src/tree_store/btree.rs:1176-1185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tree_store/btree.rs:1137\u0060 it does not close everything it opens, so those exact 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/tree_store/btree.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc49b6f4c22da1e6adacb48c2d6a6dcaedba7a2ede46a0a90d9642135c8d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/redb-bench/src/lib.rs:399-407 | crates/redb-bench/src/lib.rs:455-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/redb-bench/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba7934128069f61913f6b7cf5529a5669c64f6b05619d34821085df63619f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tree_store/btree_mutator.rs:1111-1119 | src/tree_store/btree_mutator.rs:1128-1136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/btree_mutator.rs:1111\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/tree_store/btree_mutator.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"096892de9d531866448289925b9447e18333112d23b47f9f12a4a2eb75eb7d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/redb-bench/src/lib.rs:399-406 | crates/redb-bench/src/lib.rs:455-462 | crates/redb-bench/src/lib.rs:550-557 \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":"crates/redb-bench/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a11b31e4dc05a1710302398024a2fc7d4c795d8154477ab1773c88468aee49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/db.rs:1432-1439 | src/db.rs:1489-1496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/db.rs:1432\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/db.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"015e9865e3c83683eb18e7aa25df7b8e0520a1c733c769f0780f8c628b72f41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/multimap_table.rs:185-192 | src/multimap_table.rs:216-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/multimap_table.rs:185\u0060 it does not close everything it opens, so those exact 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/multimap_table.rs:215\u0060 calls \u0060value\u0060, \u0060get_num_values\u0060 and \u0060src/multimap_table.rs:184\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/multimap_table.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f7d7a8e2d1487fbb386e10be65245138bfaf393d52acb1cb10d05c61839133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/table.rs:1225-1232 | src/table.rs:1238-1245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/table.rs:1225\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/table.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f608181da224cd5d31918c60c1381956538c96d7e1e4c338754774456fad72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/table.rs:1563-1570 | src/table.rs:1618-1625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"356b5825efba750c8df236c5e8b028ef3081fe8ecc374e1700561150b5e4005d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/transactions.rs:1096-1103 | src/transactions.rs:1109-1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/transactions.rs:1096\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/transactions.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e3bc0221f89791a4756745322088c3b22663c61529bbc0309c243b02bae770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tree_store/table_tree.rs:205-212 | src/tree_store/table_tree.rs:286-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/table_tree.rs:205\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/tree_store/table_tree.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"089cdd36af6a31055449cf5adb2d05641173bd214eb90e26608caaeb9afd4b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/transactions.rs:2362-2368 | src/transactions.rs:2377-2383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transactions.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"891c98f5a054721ce71d4dd6d683fa6581e22f06b17d3e8032640749b656829b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tree_store/page_store/cached_file.rs:705-711 | src/tree_store/page_store/cached_file.rs:716-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/page_store/cached_file.rs:705\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/tree_store/page_store/cached_file.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae784788b2f1208542e890525aedc01e60694b12815ec01ef6f02ac07f55dd3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/redb-bench/src/lib.rs:240-245 | crates/redb-bench/src/lib.rs:315-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/redb-bench/src/lib.rs:240\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":"crates/redb-bench/src/lib.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbe64448722e4acb7b1aec03ce2f92d77cb49761db1efa1a7a5d967c6ed1451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tree_store/btree.rs:1147-1152 | src/tree_store/btree.rs:1187-1192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/btree.rs:1147\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/tree_store/btree.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7629d13514a1f8e90e203e48a7da6e65f4eb79f33c6ff5c4fbf0f9a3aee4d22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tree_store/btree_base.rs:1446-1451 | src/tree_store/btree_base.rs:1457-1462 \u2014 both copies are in the same file, so extract the block 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/tree_store/btree_base.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"36033e402c7922e489a7224dfd3576ea34ac3a3b8f2560cb910dceba19d25959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tree_store/btree_base.rs:1751-1758 | src/tree_store/btree_base.rs:1770-1777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/btree_base.rs:1751\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/tree_store/btree_base.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5ae13638a8ccf6cafd54ee4ab7188851d25e43c79eec66ab1e35cbb840fe00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tree_store/table_tree_base.rs:487-492 | src/tree_store/table_tree_base.rs:494-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/table_tree_base.rs:487\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/table_tree_base.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad173bacfaaecf9009d9cd5a7ad11d9071d5a93283c70a7e71cfb28c58033202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tree_store/table_tree.rs:677-683 | src/tree_store/table_tree.rs:710-716 | src/tree_store/table_tree.rs:750-754 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/table_tree.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff557f93e892931307f4f0b5bac302c787bbaa58c1cb3bf899d0a121f2eb8352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tree_store/page_store/xxh3.rs:899-907 | src/tree_store/page_store/xxh3.rs:943-951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/page_store/xxh3.rs:899\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/tree_store/page_store/xxh3.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7107c6ca48c100084ae245681181165ff3daeeb2995565dbe51692e4cecd749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/db.rs:346-354 | src/db.rs:406-414 | src/transactions.rs:307-315 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"60197dd27be6af3663561457f30e5859a7c64f48fb57af5ad7fd495fe1c8698b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/multimap_table.rs:1077-1083 | src/table.rs:833-839 \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/multimap_table.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e21394e6897e763d9a91d734a86d2759ea08d7de1639ce2f17ae68bc8089b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/multimap_table.rs:1272-1278 | src/table.rs:977-983 \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/multimap_table.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9703187888ed160cca4bbdae2692a0e85a083c02c890b76ec3ea5c58f690f17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/multimap_table.rs:1290-1296 | src/table.rs:992-998 \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/multimap_table.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"89feef072cee8b9e2e99c8dfecc41a140fe25db6e5661ac549dfeb33c6d3d0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tree_store/btree.rs:1291-1304 | src/tree_store/multimap_btree.rs:28-41 \u2014 before extracting anything, compare \u0060src/tree_store/btree.rs\u0060 and \u0060src/tree_store/multimap_btree.rs\u0060 as WHOLE FILES: this scan already matched 3 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 \u0060src/tree_store/btree.rs:1291\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/tree_store/btree.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"357dd6c8e3d7da2f7229bd5bf58796ac6b9603f991009d48c9781518eee1b18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/redb-bench/src/lib.rs:382-393 | crates/redb-bench/src/lib.rs:440-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/redb-bench/src/lib.rs:382\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":"crates/redb-bench/src/lib.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a97ad0bbf64bf58e769c4915f9946db73aefcafb876c3d7955ec57ac22bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/transactions.rs:2682-2692 | src/transactions.rs:2701-2711 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/transactions.rs:2682\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/transactions.rs"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba14a8ce253ca2ce59191994efa061b7cbc99f4e810a6d9090befaedd2f79cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/redb-derive/src/lib.rs:276-286 | crates/redb-derive/src/lib.rs:298-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/redb-derive/src/lib.rs:276\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":"crates/redb-derive/src/lib.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd87ea97e10229b6ef20f68574c9e8e02f3a09cd78d20647bd4833eefb03a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/transactions.rs:1062-1071 | src/transactions.rs:1078-1087 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/transactions.rs:1062\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/transactions.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f0c0b9292b714baecd781bc02a904652251227293574945e040a710256c9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tree_store/btree_base.rs:96-105 | src/tree_store/btree_base.rs:126-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tree_store/btree_base.rs:96\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/tree_store/btree_base.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dc36dbe8d46a56c67aca3bf299b6c0c0d10b9dd52ebb2059561fee997e73d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/transactions.rs:1120-1128 | src/transactions.rs:1131-1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/transactions.rs:1120\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 after the matched lines, \u0060src/transactions.rs:1130\u0060 calls \u0060unwrap\u0060 and \u0060src/transactions.rs:1140\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/transactions.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4618c66aa88d53760059f666f12253468559717e7b198213495bdfd67265a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/redb-derive/src/lib.rs:69-77 | crates/redb-derive/src/lib.rs:123-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/redb-derive/src/lib.rs:69\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":"crates/redb-derive/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"648173ebcfab3faee808ea95057579b6fc395e3053746e794713f4df1d769207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/table.rs:604-609 | src/table.rs:611-616 | src/table.rs:620-625 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/table.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da2b577e847e025d52cac163b9b62117cb1751b1757b9d1d057a8db9611bd55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tree_store/page_store/xxh3.rs:657-661 | src/tree_store/page_store/xxh3.rs:801-805 \u2014 both copies are in the same file, so extract the block 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/tree_store/page_store/xxh3.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e2b6274997b675eb672e7983136963e348c6496e4185d90bd747d007bd8a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): fuzz/fuzz_targets/fuzz_redb.rs:167-186 | fuzz/fuzz_targets/fuzz_redb.rs:214-233 \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":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cad5e5e4dfd72901d5e5e044c9ac813f03c5f6c9658eda58f5653e81617214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): fuzz/fuzz_targets/fuzz_corruption.rs:312-328 | fuzz/fuzz_targets/fuzz_corruption.rs:330-346 \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":"fuzz/fuzz_targets/fuzz_corruption.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1597dd06036562cafc5dc537185758994aee930d3e313e81a41aeade540d2ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): fuzz/fuzz_targets/fuzz_redb.rs:895-914 | fuzz/fuzz_targets/fuzz_redb.rs:945-963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_redb.rs:895\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":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd6b486e09c710e68c13b279d81aeabf812e41f0da465801bd9cc6cc5687f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): fuzz/fuzz_targets/fuzz_corruption.rs:126-139 | fuzz/fuzz_targets/fuzz_corruption.rs:153-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_corruption.rs:126\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":"fuzz/fuzz_targets/fuzz_corruption.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"40db6c58d2a14d32f7248a22bf872f589a6af3f35cf9b6dc46cfe0c6521d5bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): fuzz/fuzz_targets/fuzz_redb.rs:272-285 | fuzz/fuzz_targets/fuzz_redb.rs:301-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 \u0060fuzz/fuzz_targets/fuzz_redb.rs:272\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":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9416627a2ccf2dbe29c5d8ca0f597fafff606bc4c66a638de2c2948f4e267901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): fuzz/fuzz_targets/fuzz_corruption.rs:317-328 | fuzz/fuzz_targets/fuzz_corruption.rs:335-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_corruption.rs:317\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060table\u0060 to \u0060\u0026impl ReadableTable\u003Cu64, u64\u003E\u0060 in one and \u0060\u0026impl ReadableTable\u003C\u0026\u0027static str, \u0026\u0027static [u8]\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":"fuzz/fuzz_targets/fuzz_corruption.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f83f60b7a3e650ebcc1f34f96772e5e6e868d0ffc7c64fed85b853a6170c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fuzz/fuzz_targets/fuzz_corruption.rs:262-271 | fuzz/fuzz_targets/fuzz_corruption.rs:298-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_corruption.rs:262\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":"fuzz/fuzz_targets/fuzz_corruption.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"660d3ef9e16cc36eadb2ed031fa6d251bf401ede2d977495708368d3a4fe98ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fuzz/fuzz_targets/fuzz_redb.rs:168-177 | fuzz/fuzz_targets/fuzz_redb.rs:216-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_redb.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a40dc305528b926584978ecf6fd946a36b842ede6e84f435920c34435a1fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): fuzz/fuzz_targets/fuzz_redb.rs:906-913 | fuzz/fuzz_targets/fuzz_redb.rs:956-962 | fuzz/fuzz_targets/fuzz_redb.rs:1025-1031 \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":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dffb37cd7b1792d57bce5d84aadd6df1fcc46b32c6e3d37eaf045a7b98d542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fuzz/fuzz_targets/fuzz_redb.rs:402-410 | fuzz/fuzz_targets/fuzz_redb.rs:782-790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_redb.rs:402\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e8a90ad21e6cb2135426798f59945fb80c310dd543ade67e3860ec874c96b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fuzz/fuzz_targets/fuzz_redb.rs:394-400 | fuzz/fuzz_targets/fuzz_redb.rs:775-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_redb.rs:775\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":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5359deb357e2d82d3725211970d9d4e5ffe0295f43f1a076e9f700c3c399066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fuzz/fuzz_targets/fuzz_redb.rs:694-699 | fuzz/fuzz_targets/fuzz_redb.rs:705-710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzz_targets/fuzz_redb.rs:694\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":"fuzz/fuzz_targets/fuzz_redb.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cde94a24038727364b0c650ad8560fd59906d055f636132b24d28af28c9690"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: redb: redb: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7da68cded476c07bde1439eeac16fbf229e9a1fb5496cf5e9aeb1a1f886cf9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/db.rs: src/db.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Database::check_integrity_inner at line 1045. 1 of those changes was a fix/bug commit, and the other 86 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:01:50 -08:00\u0027 --until=\u00272026-11-13 11:01:50 -08:00\u0027 --full-history --no-merges -- src/db.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/db.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21f617b7beae0316e46d1348aa33fb04f5c4f63b271b6f8fb99a053d0e2770"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tree_store/page_store/page_manager.rs: src/tree_store/page_store/page_manager.rs changed 74 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TransactionalMemory::lock_whole_storage at line 713. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:01:50 -08:00\u0027 --until=\u00272026-11-13 11:01:50 -08:00\u0027 --full-history --no-merges -- src/tree_store/page_store/page_manager.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/tree_store/page_store/page_manager.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fe98f4cc5ebcc64592903e683db0878791177f581d8bbddb003905118dc6f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tree_store/page_store/cached_file.rs: src/tree_store/page_store/cached_file.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PagedCachedFile::read at line 696. 1 of those changes was a fix/bug commit, and the other 20 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:01:50 -08:00\u0027 --until=\u00272026-11-13 11:01:50 -08:00\u0027 --full-history --no-merges -- src/tree_store/page_store/cached_file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/cached_file.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fc20892e7bae3b165d8779cc5d82ade5c2221143236baaaf2e0f0247055a1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tree_store/btree_mutator.rs: src/tree_store/btree_mutator.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in MutateHelper::insert_helper at line 743. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:01:50 -08:00\u0027 --until=\u00272026-11-13 11:01:50 -08:00\u0027 --full-history --no-merges -- src/tree_store/btree_mutator.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/tree_store/btree_mutator.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fe6412aaa3821dfc3c3b8d5427024b1e56990cce3f5fa122bbf6170afef607"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider implementing an optimization in which we store the number of order-0 pages that \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/tree_store/page_store/base.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d6207bc44ae00bd09b86ae9e97e86e71aa46282eba00cd1d0ed2b9f6568f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This could probably be optimized, so that multiple threads can read at once, by making \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/tree_store/page_store/page_manager.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"8465a149f25bf496823899214e07f0e1dc72230ac6940ba0082ffc82089defa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace these with wasi::FileExt when https://github.com/rust-lang/rust/issues/71213"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_store/page_store/file_backend/optimized.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d4cf5f0fb20e4bece30d385d4096f3ac7b37ff0dd5e5e9eb8784faabd9045f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Awful hack because Rocksdb seems to have unbounded memory usage for bulk writes \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":"crates/redb-bench-compare/benches/common/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b439dc10e0a132ab459447e5ad7133e36dee93561658c5dc471cc0573839849a"}},{"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 \u0060crates/redb-no-std-test/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/redb-no-std-test/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96af0d8459e8b4f17e3fad62d53794bc7f6c148790c0becbb293830bae83355b"}},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"774e84eaf65696bacc627959839c1af1927b88e5fcbe02a78f7a8b8671c240ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"311f2b1dd969a2ef73985fc36dd91e65e3d6a6cb49a0706cd68e381199f12c7c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"491309492755e678b03fb48f8d71cffa348f6001d9dc090ab40127b3c3da0a84"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bdf27ec621a6dbd99e24d985f8d1b51c89a8cfde286a8aad692d70042238e6e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65a25ddfb9bb7c1a74708000f75a0c6372f292ca517d6f9ab60c4532c462ff45"},"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":"D31","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":"18c59fa388ee4aa99f6cb9d5feeae7281ae923037cb73bc2d0a9f75d90772171"}},{"ruleId":"D31","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":"b2ed2ffa0f90bb702c47bb51c36bae59e1e95b0000bb0bb7d54e44c654d9a9c2"}},{"ruleId":"D31","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":"6c3586f6008b700e08392e02accb119243230e921ff63a69e2c337c6c2f71766"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"6cb8ff1517bc69de62c49b3bfaa28d4eb248c2a692959d04da0b083e09658a69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"61b2af27dadcd4411d947fd610c86d05e0dc7ccc21a05a1ae30b8faaeeb7cf52"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"8f0305d4a628853ab42576f6623dfdba1ceb13a8c554a93f5a8e06d44324b195"}},{"ruleId":"D31","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":"e3b454a406eb928ef59b36769c198ea56a545b41f72b187cb9842035746d9f0e"}},{"ruleId":"D31","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":"3a26bd1789e2732430005ea723af44a699d9b649edda3c85eb26b925d57f2ec8"}},{"ruleId":"D31","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":"4e2c2354404c8572a0ebe03642cb9f0a34b5ebc9c50f45e0db1c1d61c8702f54"}},{"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":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.90: rust-toolchain declares Rust 1.90 as this project\u0027s toolchain file, and Rust 1.90, superseded by 1.91 on 2025-10-30 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-10-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b39d33b2be1670c0605c9fdd37076cc021281c31b7efef7866b9af2690558"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/redb-no-std-test\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"}]}],"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":17,"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."]}]}