{"$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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"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":"mini_lsm_starter::bin::compaction-simulator::main (cyclomatic 38): mini_lsm_starter::bin::compaction-simulator::main has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1509806701c86d43db9316695c1746d35e6ff01818277fd334d7decbc734d7"}},{"ruleId":"D1","level":"warning","message":{"text":"LsmStorageInner::open (cyclomatic 17): LsmStorageInner::open 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":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e3ea5211fd5e1b72dab1b5fc68f1cce5e23d135d72b6821d870bdbfcdfea9"}},{"ruleId":"D1","level":"warning","message":{"text":"LsmStorageInner::open (cyclomatic 17): LsmStorageInner::open 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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83257de87d11f023642abf882969b4aed88f1242d16726efba00468385a5a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"LsmStorageInner::get (cyclomatic 16): LsmStorageInner::get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838979907e45c95eb41c5ec3482827c1b23b79a4aad7ce09ec424ee62dc516e"}},{"ruleId":"D1","level":"warning","message":{"text":"LsmStorageInner::compact_generate_sst_from_iter (cyclomatic 16): LsmStorageInner::compact_generate_sst_from_iter has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d4b3885564806b5067e0e7973b8612592a44e33c2ceb77c38e4b6ececfadc"}},{"ruleId":"D2","level":"warning","message":{"text":"mini_lsm_starter::bin::compaction-simulator::main (cognitive 113): mini_lsm_starter::bin::compaction-simulator::main has cognitive complexity 113 (threshold 15). Drivers by points: if/else 31 (72 pts), loops 13 (40 pts), match/switch 1 (nesting depth added 68). 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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"657f3a418a517df9e94c821f81ed79ec8c5693596a8d256e05082fec0d526ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::compact_generate_sst_from_iter (cognitive 38): LsmStorageInner::compact_generate_sst_from_iter has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (5 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 22). 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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d752626d4a6bb1edf92d8c055cf7e11bc941228e726a95b4bf747de7262eb89"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::open (cognitive 33): LsmStorageInner::open has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (10 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":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"82af0d7901c8ce48d6aaa56f83d78cbc8bd9c069b73850c1dcb9c4bcb4a486b2"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::open (cognitive 33): LsmStorageInner::open has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (10 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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be793ec816774addcf708d3e882705751ed49a5b5931aa919b23a98a25547bc"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::get (cognitive 27): LsmStorageInner::get has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (5 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":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4dd4af1029bfac205797f0b3e52f9ed92240c50ac5f85ed9790de79f5a0fba"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::commit (cognitive 26): Transaction::commit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mvcc/txn.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c824efd83268e44e416c7bab9c006c5e991d848e5ba73a84125aaa4125f81bc"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::compact (cognitive 24): LsmStorageInner::compact has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm/src/compact.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afa966e53ae154941778a712a8ce9ec3b6cb69448b16c82431fe300d77b048d"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::scan (cognitive 24): LsmStorageInner::scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 2 (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":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ddfe2a446fbeecc4ef295de12fefaa405d5d576d68438df1ad19a537c69df"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::compact (cognitive 24): LsmStorageInner::compact has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a805c14fa5fa342fe1b19a6d43a8f17f547281ed5e6f76d3b1fafd7b9f354a"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::scan_with_ts (cognitive 24): LsmStorageInner::scan_with_ts has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 12). 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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5e823a015b124ae2dc4a734eceb75ddf51c38bff57d1ef9427371ce04e3a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"LsmStorageInner::get_with_ts (cognitive 19): LsmStorageInner::get_with_ts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5def7ffba527db621a900d8a76bfd649b82ab0d495efa106a460d231f0502268"}},{"ruleId":"D2","level":"warning","message":{"text":"Wal::recover (cognitive 18): Wal::recover has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm/src/wal.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec509ae62b193417fe89b0990769b713f6599e89efc75c1bb26346d55663ebef"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleLeveledCompactionController::generate_compaction_task (cognitive 16): SimpleLeveledCompactionController::generate_compaction_task has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/simple_leveled.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"871402380f0974adece8f2c82f2ecc25c364ac1c333acc5b5714be7352424549"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mini_lsm_starter::bin::compaction-simulator::main: FunctionTooLong \u2014 mini_lsm_starter::bin::compaction-simulator::main runs 349 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 249 over it, 3.49\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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"19beb989f8f66186f393e94e9bcf8e44297a70da03ce49363731716f13cf922f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsm_storage.rs: FileTooLong \u2014 619 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 66% of them inside a single declaration: LsmStorageInner (2 blocks, 202-923). The bar is 500 significant lines; this is 119 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f749e8d33b12f4d0cf82f87e679803951983caa75442e0d3ff9f720e0cfafd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LsmStorageInner.open: MethodTooLong \u2014 open runs 112 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 12 over it, 1.12\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6860866a7ab60436c0088e85ea6a2c1173969dbf9d596315b375422124fec81a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsm_storage.rs: FileTooLong \u2014 551 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 64% of them inside a single declaration: LsmStorageInner (2 blocks, 189-845). The bar is 500 significant lines; this is 51 over it, 1.10\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":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7eae35e1043e64793efda631fde5d69802ebf213939922d8ecb95e12d72ddc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/compaction-simulator.rs: FileTooLong \u2014 535 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 35 over it, 1.07\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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be47b99cbacd8a73cc8ed48339d1a4de83f1c3e788f42ce4df50a26075ff8661"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LsmStorageInner: TooManyMethods \u2014 31 methods, declared across 2 files: src/lsm_storage.rs (24), src/compact.rs (7). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2241c1b88066036199f2cf9215aad63242fcf4e74a494a8aa5892d3199e6408"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LsmStorageInner.open: MethodTooLong \u2014 open runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18493cef26c235f798b406a58804ed911eaad7a154506355a5a70f7d8339ccd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LsmStorageInner: ClassTooLong \u2014 411 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), 31 methods, 2 blocks, lines 202-923. The bar is 400 significant lines; this is 11 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6add1a9110fb138ee9391d298bba5bfa5df424ad6b35e5a900ab9a857fe72167"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (125 shared lines): mini-lsm-mvcc/src/lsm_storage.rs:361-507 | mini-lsm/src/lsm_storage.rs:346-483 \u2014 These two members are variants of one another: 125 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa162f6a4353e17730a3d8a150ea23cbb02149446096d5f11daf10670146787"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): mini-lsm-mvcc/src/compact.rs:440-460 | mini-lsm-mvcc/src/compact.rs:477-491 | mini-lsm-starter/src/compact.rs:141-161 | mini-lsm-starter/src/compact.rs:170-184 | mini-lsm/src/compact.rs:396-416 | mini-lsm/src/compact.rs:433-447 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf742763fb7a01b34fe2bed8cbcfab6ba27e1df8cf10bbc228bea7a6e00eb777"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): mini-lsm-mvcc/src/lsm_storage.rs:525-602 | mini-lsm-mvcc/src/lsm_storage.rs:831-922 | mini-lsm/src/lsm_storage.rs:496-571 | mini-lsm/src/lsm_storage.rs:758-844 \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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54563b89a9001dcec834627917832f1522ccfc1e955153fe83583219405fa39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): mini-lsm-mvcc/src/block.rs:48-123 | mini-lsm/src/block.rs:48-119 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3ff2a1244be5d2dd5bb68f3ac5366172266d03a163f486b921f9246e0fcf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): mini-lsm-mvcc/src/table.rs:236-302 | mini-lsm/src/table.rs:212-278 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bc92286e94df46b6d13fb0bf86cb8aa1f3a363472f900420a5b357f86716b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): mini-lsm-mvcc/src/compact.rs:381-435 | mini-lsm/src/compact.rs:335-391 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"be08b1374822c0ef7acfb5d9dce952474a0c22332b5b8b9ce9256c92b2b90877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): mini-lsm-mvcc/src/table.rs:116-171 | mini-lsm/src/table.rs:96-147 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ae8c18c21a3fe7928b601a10784f74e5441cd7c7d65b954dcffd39b15f03d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): mini-lsm-mvcc/src/lsm_storage.rs:762-814 | mini-lsm/src/lsm_storage.rs:692-746 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd46bf2dc8209f658b2e226c91f4e47518d87306fb391f549a82d7c9e9b2ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): mini-lsm-mvcc/src/block/builder.rs:65-110 | mini-lsm/src/block/builder.rs:65-108 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/builder.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313503ef148c16961e2cf09e83bc80175c3702ef67594e5e3177a84c488d1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): mini-lsm-mvcc/src/table.rs:74-113 | mini-lsm/src/table.rs:63-93 \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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d316d589c67f9bb90851e7d9453a710193ea2e706db0d73fe8bdbd78e2cd86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): mini-lsm-mvcc/src/compact/simple_leveled.rs:53-104 | mini-lsm/src/compact/simple_leveled.rs:53-99 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/simple_leveled.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffbe7198910690c5cd666fbf75bf8c4a5e8d7b2607d5d34e04d0bce0c4abf86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): mini-lsm-mvcc/src/table/builder.rs:103-128 | mini-lsm/src/table/builder.rs:98-123 \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":"mini-lsm-mvcc/src/table/builder.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6851fe5719ee8ea930c6d6947f0e2256233f37b7d8498f42f185044ebd554684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): mini-lsm-mvcc/src/table/bloom.rs:100-121 | mini-lsm/src/table/bloom.rs:100-121 \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":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7713f66f5df605947101fc2eb29955f52bcc5a56f703f4c64cf5e1801ec5b404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mini-lsm-mvcc/src/block/iterator.rs:118-138 | mini-lsm/src/block/iterator.rs:117-133 \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":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3138b39543c76ad30bd5ea64164f3c07e99aead7768e19cb8b34ed08adc11090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): mini-lsm-mvcc/src/lsm_storage.rs:737-759 | mini-lsm/src/lsm_storage.rs:667-689 \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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbbf27f56f273155aeb7bef3899b181c74942e7fe32210d6ad4a8a200d1110b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): mini-lsm-mvcc/src/table/builder.rs:55-77 | mini-lsm/src/table/builder.rs:53-72 \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":"mini-lsm-mvcc/src/table/builder.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca0f191d189e592ae2e5358d708812ab5ae147a1da1a208757f2e61d343628c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): mini-lsm-mvcc/src/lsm_storage.rs:170-190 | mini-lsm/src/lsm_storage.rs:157-177 \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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbd0d9501c63de64c55325ec99f93882e6a3be9d7c719f0e6c708e776fdc150"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): mini-lsm-mvcc/src/mvcc/txn.rs:88-99 | mini-lsm-mvcc/src/mvcc/txn.rs:101-112 \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":"mini-lsm-mvcc/src/mvcc/txn.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30f11542f9114ba175f2d41bb6627d1c9a4ca37d0e19e840612bce1b2515844"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mini-lsm-mvcc/src/lsm_iterator.rs:59-68 | mini-lsm/src/lsm_iterator.rs:51-60 \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":"mini-lsm-mvcc/src/lsm_iterator.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"247cc379fefa5d769435d0b5d172fa137d67e5f7fa67d129ad1b25aad4edee09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): mini-lsm-mvcc/src/mem_table.rs:187-197 | mini-lsm/src/mem_table.rs:137-147 \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":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e88d197756d50bd5661a35a9cbd4283968bac85a40206f8254b9f403e600e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mini-lsm-starter/src/bin/compaction-simulator.rs:208-226 | mini-lsm-starter/src/bin/compaction-simulator.rs:228-242 \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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439b026602e49cb088f8ebc129ff1d4b7f986dce7554df323c9b5603602cec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mini-lsm-mvcc/src/lsm_storage.rs:663-672 | mini-lsm-mvcc/src/lsm_storage.rs:675-684 \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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"9106702f3b5a9532e9e6750c1c1ca52f9ca67561439669063b98fdf0071e789c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mini-lsm-mvcc/src/mvcc.rs:49-56 | mini-lsm-starter/src/mvcc.rs:47-54 \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":"mini-lsm-mvcc/src/mvcc.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c883b8e3ad4ccc3fcbe683a27083eb3f1a7f16274aba59412d00ed3b4e708df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): mini-lsm-mvcc/src/table.rs:198-205 | mini-lsm-starter/src/table.rs:84-91 | mini-lsm/src/table.rs:174-181 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b584ec91b1a02a7e8486fbe5ebc66857739ac8cbf15ca93925d00b98b5e3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mini-lsm-mvcc/src/mem_table.rs:113-121 | mini-lsm/src/mem_table.rs:73-81 \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":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3894117ba1c3b63ee6ecc7779179293217baa9445bba0cec748e064462ec17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): mini-lsm-mvcc/src/table/builder.rs:41-52 | mini-lsm/src/table/builder.rs:40-50 \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":"mini-lsm-mvcc/src/table/builder.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec6b61cb693f9e115f3d5242f82b5f1f350e4dab704aa9411f5ad2e240ec801"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): mini-lsm-mvcc/src/table.rs:46-49 | mini-lsm/src/table.rs:46-49 \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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"823a24392cbd6b4ee85546de14e8c062bf81021a8b8a13355b52f5ba7fad756d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mini-lsm-mvcc/src/block/iterator.rs:41-48 | mini-lsm/src/block/iterator.rs:41-47 \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":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3ffff8af0ff3b33a6f18e0b5218e145889ff92866f68a0ee1790b26eba945d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): mini-lsm-mvcc/src/mem_table.rs:247-251 | mini-lsm-mvcc/src/mvcc/txn.rs:207-211 | mini-lsm/src/mem_table.rs:192-196 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"459ec5bf132761ba65641295c38ab2b00b5c587a83b4d7a9c570ce81373bcbb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): mini-lsm-mvcc/src/table.rs:41-44 | mini-lsm/src/table.rs:41-44 \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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c909a4d4f1b58bf88244ff52d3f9801ffe3a87438fa4e188f151bb3f0473ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): mini-lsm-mvcc/src/mem_table.rs:200-205 | mini-lsm/src/mem_table.rs:150-155 \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":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8559b86c1299fd740b7e04dfc5c25c8a795f6cd38c66d1ea2abfd2e5f4c406"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mini-lsm-mvcc/src/lsm_iterator.rs:46-57 | mini-lsm/src/lsm_iterator.rs:40-49 \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":"mini-lsm-mvcc/src/lsm_iterator.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d28efb0f207634e3587115ef431280521efce60ea5e4ad7335e497ec0247a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): mini-lsm-mvcc/src/block/iterator.rs:83-86 | mini-lsm/src/block/iterator.rs:82-85 \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":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb95e9e1ebda0315634fa2db5209b46e2c2c431538663fc31e52fb1968c236a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): mini-lsm-mvcc/src/lsm_storage.rs:229-232 | mini-lsm-starter/src/lsm_storage.rs:164-167 | mini-lsm/src/lsm_storage.rs:218-221 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97664c7d96b374b79ddee8de49892aaaa3c43cfd2994778841a0d2d8e1eb491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:230-319 | mini-lsm/src/compact.rs:184-273 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"15690b4eaca21fe67bc0f73fc9b53d2abd83c9368af64492cd9ff91f5a25b92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): mini-lsm-mvcc/src/manifest.rs:53-124 | mini-lsm/src/manifest.rs:53-124 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/manifest.rs\u0060 and \u0060mini-lsm/src/manifest.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/manifest.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"886a588d1aff6a84c55f9322fad9780e8443a764176af34fa187923f3d2eb0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (87\u201388 lines \u00D7 2): mini-lsm-mvcc/src/compact/leveled.rs:83-170 | mini-lsm/src/compact/leveled.rs:83-169 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/leveled.rs\u0060 and \u0060mini-lsm/src/compact/leveled.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 180 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/leveled.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb75514920369ffd9c9074af951d753f52142894e002b2efea41fa5488dbe6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): mini-lsm-mvcc/src/compact/leveled.rs:179-247 | mini-lsm/src/compact/leveled.rs:178-246 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/leveled.rs\u0060 and \u0060mini-lsm/src/compact/leveled.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 180 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/leveled.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c295c492f81b7b85e9f5549417f11b8e5d20828df40c33f749f7ccd00f803a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:386-436 | mini-lsm/src/lsm_storage.rs:370-420 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:386\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bafce8085724a5f3e5783e55d619a1e5168130c29fdf595807663664359ca0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): mini-lsm-mvcc/src/iterators/merge_iterator.rs:113-154 | mini-lsm/src/iterators/merge_iterator.rs:113-154 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/merge_iterator.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc6718ba8bb163c1f05449cc37fd9696659878a6a1f0f589b5b32b7d919622b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201342 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:763-802 | mini-lsm/src/lsm_storage.rs:693-734 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f97256c4050e49f3885cbccc7a20db0385353f3b541a3d0445656d828e80cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:237-277 | mini-lsm/src/lsm_storage.rs:226-266 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8036df4c1c75995b79981e5a40219ee4fe2b5ef1b7a696d35fc7a067127187a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): mini-lsm-mvcc/src/block.rs:50-103 | mini-lsm/src/block.rs:50-103 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block.rs\u0060 and \u0060mini-lsm/src/block.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/block.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mini-lsm-mvcc/src/block.rs:104\u0060 calls \u0060checked_add\u0060, \u0060context\u0060 and \u0060mini-lsm/src/block.rs:104\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":"mini-lsm-mvcc/src/block.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98f17badca9b565b1d9e954ee08a88b85b308395ec63a17591001a2aad22132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): mini-lsm-mvcc/src/compact/tiered.rs:49-113 | mini-lsm/src/compact/tiered.rs:49-113 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/tiered.rs\u0060 and \u0060mini-lsm/src/compact/tiered.rs\u0060 as WHOLE FILES: 99% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"mini-lsm-mvcc/src/compact/tiered.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b8a7f4cd68b3e97ceb34ba6e59c8fb6f12525f023c975e676a95935c44906d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 3): mini-lsm-starter/src/bin/compaction-simulator.rs:361-395 | mini-lsm-starter/src/bin/compaction-simulator.rs:462-496 | mini-lsm-starter/src/bin/compaction-simulator.rs:663-697 \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 \u0060mini-lsm-starter/src/bin/compaction-simulator.rs:361\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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdd1f10deaea50de31ac84d82286e8414135a03995d44ef67fccdb7c9f3dc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): mini-lsm-mvcc/src/compact/simple_leveled.rs:119-153 | mini-lsm/src/compact/simple_leveled.rs:114-148 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/simple_leveled.rs\u0060 and \u0060mini-lsm/src/compact/simple_leveled.rs\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"mini-lsm-mvcc/src/compact/simple_leveled.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5f72ac1eee3d2a8bb501ee461c35e36c05b3e05313433a2f7bbc45d73fbae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:322-379 | mini-lsm/src/compact.rs:276-333 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a42f7f66c2f19f9b0c09f02de4c48671eb536dd9268f30d0d5dd653836916f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): mini-lsm-mvcc/src/compact/tiered.rs:121-154 | mini-lsm/src/compact/tiered.rs:121-154 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/tiered.rs\u0060 and \u0060mini-lsm/src/compact/tiered.rs\u0060 as WHOLE FILES: 99% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"mini-lsm-mvcc/src/compact/tiered.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a922fa82bcc42fe01e7c9930af677d5d9463a21ab596c78549b120dd5651504d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:237-268 | mini-lsm/src/table.rs:213-244 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd236571c4cef483a3395271f1c9171db053725906e0a97e611fc7437fbb903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): mini-lsm-mvcc/src/iterators/merge_iterator.rs:60-89 | mini-lsm/src/iterators/merge_iterator.rs:60-89 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/merge_iterator.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaab4924b2ebc43006cc3d84064a578367811581d3e01f50542e3af0756a91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:867-896 | mini-lsm/src/lsm_storage.rs:790-819 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:867\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"e598faea1e8f5945479dc506c90236a1e1474849220267a63e667cf0aac51af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:270-299 | mini-lsm/src/table.rs:246-275 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table.rs:270\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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"10181b9e8b238b9c31a489af8300d0365d243d87f9d36d6be4c6f88f6fe78efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:326-353 | mini-lsm/src/table.rs:302-329 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4f56b3b9a95a4f61de15cf07462e1f65dcc18b5748c22ef5736f883ad6b0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:474-500 | mini-lsm/src/lsm_storage.rs:450-476 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:474\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1434e40a3048b8c4dc21f62d51b5c91eb3b68bb29a980eb4d6da55604e36e1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:382-418 | mini-lsm/src/compact.rs:336-373 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact.rs:382\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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"39da079de0e1e0f1bfe64ef69e1025fde48a1e60b336e7472cbc2585ef032aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): mini-lsm-mvcc/src/compact/simple_leveled.rs:54-76 | mini-lsm/src/compact/simple_leveled.rs:58-81 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/simple_leveled.rs\u0060 and \u0060mini-lsm/src/compact/simple_leveled.rs\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact/simple_leveled.rs:54\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":"mini-lsm-mvcc/src/compact/simple_leveled.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"051ff75fed64d1121bf054baa420e5874ac09a6e850ae8dfe1e757ef5af79269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:440-463 | mini-lsm/src/lsm_storage.rs:423-446 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:440\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"368ff9d82ee51e2a6349acd34d5ff1fdf2bc7d176c854c860f8bf542419699f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:544-567 | mini-lsm/src/lsm_storage.rs:522-545 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:544\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11e00b269d29042529a2a53d1c1a12a82fe86fbd51db85609eb6419cdf7dfda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): mini-lsm-mvcc/src/compact/leveled.rs:54-76 | mini-lsm/src/compact/leveled.rs:54-76 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact/leveled.rs\u0060 and \u0060mini-lsm/src/compact/leveled.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 180 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/leveled.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"390bf2ed53cd287e646cd2e21f9183ffad0d704d8f657a8fcbf145fb34fdc686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:362-384 | mini-lsm/src/lsm_storage.rs:347-369 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ba9752cacc82c4b42955140e88975dfbd611293284506627e2e65f816bb73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): mini-lsm-mvcc/src/iterators/concat_iterator.rs:67-88 | mini-lsm/src/iterators/concat_iterator.rs:67-88 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/concat_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/concat_iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/concat_iterator.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a4bca9adcd784cecd354f44ae1f5e6316299e7034e34823ba23046f8ba5520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): mini-lsm-mvcc/src/compact.rs:441-460 | mini-lsm-starter/src/compact.rs:142-161 | mini-lsm/src/compact.rs:397-416 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm-starter/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e1685b713ae39e2ef627ec0a364b50fa9a4dcfc4db7fbc0d77db8d27107518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): mini-lsm-mvcc/src/table/bloom.rs:103-121 | mini-lsm/src/table/bloom.rs:103-121 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/bloom.rs\u0060 and \u0060mini-lsm/src/table/bloom.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table/bloom.rs:103\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":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c1c4d5063ee3c37dd2cbd35590c734ee913c3cb83dabed7f677bc674fe576e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): mini-lsm-mvcc/src/block/builder.rs:75-95 | mini-lsm/src/block/builder.rs:75-95 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/builder.rs\u0060 and \u0060mini-lsm/src/block/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/block/builder.rs:75\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":"mini-lsm-mvcc/src/block/builder.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"674414e12ec0b557f469c095fc0a43f6d3cc0355c0b4c77c074ea8f11cd6a0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): mini-lsm-mvcc/src/iterators/concat_iterator.rs:47-64 | mini-lsm/src/iterators/concat_iterator.rs:47-64 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/concat_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/concat_iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/concat_iterator.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d829b84cfd8c268b835a58c2113939c0ca933e6ad788f87d24b1d777d0e1ad36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): mini-lsm-mvcc/src/table/bloom.rs:64-81 | mini-lsm/src/table/bloom.rs:64-81 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/bloom.rs\u0060 and \u0060mini-lsm/src/table/bloom.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table/bloom.rs:64\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":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a60d80d50af875098528cd7cc6d880c62f23ce327e8dbc0798b25f66b5dc582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): mini-lsm-mvcc/src/lsm_storage.rs:98-114 | mini-lsm-starter/src/lsm_storage.rs:64-80 | mini-lsm/src/lsm_storage.rs:85-101 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm-starter/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b76e554fa1ef22ac88600cea9d7728ae50da5844c3e28a51c5c20f744e0558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): mini-lsm-starter/src/bin/compaction-simulator.rs:589-604 | mini-lsm-starter/src/bin/compaction-simulator.rs:609-624 | mini-lsm-starter/src/bin/compaction-simulator.rs:628-643 \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 \u0060mini-lsm-starter/src/bin/compaction-simulator.rs:589\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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"147c66869ba12187d6c8def61fcc718c459f2fd6b205b8696de1e9da7d9e6ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:420-435 | mini-lsm/src/compact.rs:376-391 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact.rs:420\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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e092acf230f304e261baebe4717b351dca7b71a9be0729c0c8bc73ad58f08487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:120-135 | mini-lsm/src/table.rs:99-113 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e436e33b207672e33d0a811a8a2feb9da6fe12c6fb09492c65830cd556b7eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mini-lsm-mvcc/src/table/bloom.rs:125-140 | mini-lsm/src/table/bloom.rs:125-140 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/bloom.rs\u0060 and \u0060mini-lsm/src/table/bloom.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3196f1ccb8e4ab19d661178bea56502749717f9fe804cfa7e77c4cff6585384e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mini-lsm-mvcc/src/table/builder.rs:108-123 | mini-lsm/src/table/builder.rs:103-118 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/builder.rs\u0060 and \u0060mini-lsm/src/table/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table/builder.rs:108\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":"mini-lsm-mvcc/src/table/builder.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd11bca751314109a57b578ed0ae79717e8e354e33c6ad4e57228fb5627a6464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): mini-lsm-mvcc/src/iterators/concat_iterator.rs:91-105 | mini-lsm/src/iterators/concat_iterator.rs:91-105 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/concat_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/concat_iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/concat_iterator.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"803adf43e1c68ddf79b4f3c6fca1c258802882f4fad5ce1cd7a57cf3be41b718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:839-854 | mini-lsm/src/lsm_storage.rs:765-780 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:839\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, \u0060mini-lsm-mvcc/src/lsm_storage.rs:838\u0060 calls \u0060map_key_bound_plus_ts\u0060 and \u0060mini-lsm/src/lsm_storage.rs:764\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee20f997bb1917670551aaf2bc134070890ada9dc46ddcfea79d04bc25beb0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:905-919 | mini-lsm/src/lsm_storage.rs:828-842 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:905\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fff0a17044d14f38d05e4bd040fc7fbc74b2c02286ef77948a2b9d7190b13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mini-lsm-mvcc/src/block/iterator.rs:142-155 | mini-lsm/src/block/iterator.rs:137-150 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/iterator.rs\u0060 and \u0060mini-lsm/src/block/iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddcd6b009d794a776d43f693df395f1fef83f71ba86ade31c0dbd56881405fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:721-734 | mini-lsm/src/lsm_storage.rs:651-664 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf4b075771f619df030a13de45cc276c3953db5697f560dfc65bdbbef439902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): mini-lsm-starter/src/bin/mini-lsm-cli.rs:91-103 | mini-lsm-starter/src/bin/mini-lsm-cli.rs:108-121 \u2014 both copies are in the same file, so extract the block 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 \u0060mini-lsm-starter/src/bin/mini-lsm-cli.rs:91\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":"mini-lsm-starter/src/bin/mini-lsm-cli.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bac9ad5eb854a02cf641243ef6798de1b79815e216e1f26a48079b1e097410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): mini-lsm-mvcc/src/compact.rs:71-83 | mini-lsm-starter/src/compact.rs:67-79 | mini-lsm/src/compact.rs:71-83 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm-starter/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06f03a37237ce53a98bfa16392b806571cccaeaecd6c6cd9a51a1a55ec7cdbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): mini-lsm-mvcc/src/compact.rs:92-104 | mini-lsm-starter/src/compact.rs:88-100 | mini-lsm/src/compact.rs:92-104 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm-starter/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a7f2bd9fc1d13d33c060fbf4dfe6859c9a71ae751578569f3f64aa0cccb2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): mini-lsm-mvcc/src/compact.rs:479-491 | mini-lsm-starter/src/compact.rs:172-184 | mini-lsm/src/compact.rs:435-447 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm-starter/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact.rs:479\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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abf54e5073a7791a4da95fd1bafd6834975f1f142e09256d76ad0a43d68a398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:215-227 | mini-lsm/src/compact.rs:169-181 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact.rs:215\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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9e314b3f3483eccf41a1deb3433e18b763e96325f009c338b84648f913c8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:738-750 | mini-lsm/src/lsm_storage.rs:668-680 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c93ba3e0b548e9a5bcc5064575afaf624c6b5a167aeb0d6e696195e9bfd153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:179-191 | mini-lsm/src/table.rs:155-167 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6822c963eeaa71580f196d1b22a2259280806e368d85ffe023b2406a44ccd6f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mini-lsm-mvcc/src/table/builder.rs:65-77 | mini-lsm/src/table/builder.rs:60-72 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/builder.rs\u0060 and \u0060mini-lsm/src/table/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table/builder.rs:65\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":"mini-lsm-mvcc/src/table/builder.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e1e0e20d18ea52968fc2deb716dbebde874b2317cd36975a4f502e2bca9226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): mini-lsm-mvcc/src/lsm_storage.rs:282-294 | mini-lsm-starter/src/lsm_storage.rs:178-190 | mini-lsm/src/lsm_storage.rs:271-283 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm-starter/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c6ed7880efb27ae3ca435d672f0b55421074d3af9f4a6b5ec7dd4ed956c21e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): mini-lsm-mvcc/src/lsm_storage.rs:368-379 | mini-lsm-starter/src/lsm_storage.rs:261-272 | mini-lsm/src/lsm_storage.rs:353-364 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm-starter/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c879de50364acfe6afad12d2381fad181e854f902433d827f1d4ab2ae5092f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): mini-lsm-mvcc/src/block.rs:112-123 | mini-lsm/src/block.rs:109-119 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block.rs\u0060 and \u0060mini-lsm/src/block.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/block.rs:112\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":"mini-lsm-mvcc/src/block.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"21502955a0a8db41421b454a404f824c07c2182697de3f1091a6f121f4e5f239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:68-80 | mini-lsm/src/lsm_storage.rs:66-78 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:68\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e563a9954dedd694e281174ec209f63f91fa540aab94a88a8b1ffe56646e486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mini-lsm-mvcc/src/table/iterator.rs:59-70 | mini-lsm/src/table/iterator.rs:59-70 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/iterator.rs\u0060 and \u0060mini-lsm/src/table/iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/iterator.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b00fdbbf67ee98893d5a01db4a0436d7bd2a57252cb6458807609f03a4c556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:687-697 | mini-lsm/src/lsm_storage.rs:617-627 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f580fda4424414b94a6e3144a7aec8cd70faaab630af7b18ae1e43addc1bac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mini-lsm-mvcc/src/table/iterator.rs:108-118 | mini-lsm/src/table/iterator.rs:108-118 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/iterator.rs\u0060 and \u0060mini-lsm/src/table/iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/iterator.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b52c9650291cf2c7e749445f16c473e9a475e1e71f60756343ace20aff299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): mini-lsm-starter/src/bin/compaction-simulator.rs:209-219 | mini-lsm-starter/src/bin/compaction-simulator.rs:229-236 \u2014 both copies are in the same file, so extract the block 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 \u0060mini-lsm-starter/src/bin/compaction-simulator.rs:209\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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"99de54e82365bb5e65f30b0c342cb3e4491771e7bb4216b44af7564b9ce421e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:190-199 | mini-lsm/src/compact.rs:156-165 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact.rs:190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mini-lsm-mvcc/src/compact.rs:200\u0060 calls \u0060Some\u0060 and \u0060mini-lsm/src/compact.rs:166\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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b800f6a0d412614a72187345a21fc4713c5556575efe2adbe7a11210408eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): mini-lsm-mvcc/src/lsm_storage.rs:574-583 | mini-lsm/src/lsm_storage.rs:552-560 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:574\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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"71431dc5e31f00ad7eb36a1f6c19dee5bc96d0a07c4f5fac43688ff9916058a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mini-lsm-starter/src/bin/compaction-simulator.rs:345-354 | mini-lsm-starter/src/bin/compaction-simulator.rs:446-455 \u2014 both copies are in the same file, so extract the block 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 \u0060mini-lsm-starter/src/bin/compaction-simulator.rs:345\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":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f385c4d4e7d62de75435df2b239ff15670ce5efb5391cef84bb5e1e23b2f3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): mini-lsm-mvcc/src/lsm_storage.rs:330-338 | mini-lsm-starter/src/lsm_storage.rs:230-238 | mini-lsm/src/lsm_storage.rs:323-331 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm-starter/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619363c4f035252305bdbc82f64b0b66e1dbca3b9b7f361443358dfa78e84a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/block/iterator.rs:100-108 | mini-lsm/src/block/iterator.rs:99-107 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/iterator.rs\u0060 and \u0060mini-lsm/src/block/iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7359c3e784d7995418b795f950c0f20bf957ce35475f9f9b1a707b7c532936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/iterators/concat_iterator.rs:36-44 | mini-lsm/src/iterators/concat_iterator.rs:36-44 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/concat_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/concat_iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/concat_iterator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd053ac7f5e5f494119b6b03be631d4c8896240dccb7af5f0984fb65790a28c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:95-103 | mini-lsm/src/iterators/two_merge_iterator.rs:93-101 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/two_merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/two_merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/two_merge_iterator.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e2521e80fd41ead31d216d5c92971e202214f3782a18fd37890421cd794cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:357-365 | mini-lsm/src/table.rs:333-341 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bdd9f4db9e36ca6b2463f001c8f7d39365811903c7e1db13a4cc4c7ff3ced2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mini-lsm-mvcc/src/table/builder.rs:85-95 | mini-lsm/src/table/builder.rs:80-90 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/builder.rs\u0060 and \u0060mini-lsm/src/table/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/builder.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"826d730a8381fd579216f20fdaa6e4028c453057395a6879e625ee87387a77a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mini-lsm-mvcc/src/manifest.rs:135-144 | mini-lsm/src/manifest.rs:135-144 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/manifest.rs\u0060 and \u0060mini-lsm/src/manifest.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/manifest.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e070ec3ace8d9db6bc1e06e7a4464348d563855d63c631d1e349cb4569e444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mini-lsm-mvcc/src/mem_table.rs:114-121 | mini-lsm/src/mem_table.rs:74-81 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/mem_table.rs\u0060 and \u0060mini-lsm/src/mem_table.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7003c94683d8d769352dbd57e9071ec06aea72a71a6aeb638008fecf0d4db11c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mini-lsm-mvcc/src/wal.rs:47-54 | mini-lsm/src/wal.rs:47-54 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/wal.rs\u0060 and \u0060mini-lsm/src/wal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/wal.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dbc99bc346efec8fe73f8e344ab97b8ab9a0fb7bf6c451abcd8255219dfd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mini-lsm-mvcc/src/table/bloom.rs:101-107 | mini-lsm-starter/src/table/bloom.rs:87-93 | mini-lsm/src/table/bloom.rs:101-107 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/bloom.rs\u0060 and \u0060mini-lsm-starter/src/table/bloom.rs\u0060 as WHOLE FILES: 89% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1feb6c1a36b0f6cf0b11736d0dc3be36f0f2ac5a9daa09fb41f497f976229c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mini-lsm-mvcc/src/block/iterator.rs:119-125 | mini-lsm/src/block/iterator.rs:118-124 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/iterator.rs\u0060 and \u0060mini-lsm/src/block/iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b850621026e955490abdd28107a9d61a425147602ab1ab77232ea03ded38058e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:89-96 | mini-lsm/src/table.rs:77-83 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table.rs:89\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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2cc2e5702b0816011c9aee414eb3a59bad9f51215ace596c0e5673f5ce9aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:141-147 | mini-lsm/src/table.rs:117-122 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table.rs:141\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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f89981514eb928a090382d932b96ab189abed91c5a5d5dc08e250bbbdff0117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): mini-lsm-mvcc/src/compact.rs:445-449 | mini-lsm-mvcc/src/compact.rs:478-482 | mini-lsm-starter/src/compact.rs:146-150 | mini-lsm-starter/src/compact.rs:171-175 | mini-lsm/src/compact.rs:401-405 | mini-lsm/src/compact.rs:434-438 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm-starter/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/compact.rs:445\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":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c195b2a27ab6e3a18c4995a4e472b673f5dfb813fa2c573f0849eb7c64778b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): mini-lsm-mvcc/src/lsm_storage.rs:572-577 | mini-lsm-mvcc/src/lsm_storage.rs:878-883 | mini-lsm/src/lsm_storage.rs:550-555 | mini-lsm/src/lsm_storage.rs:801-806 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/lsm_storage.rs:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcb602283462c1bc9fddc450dfd2cb84ec7a64e0964e4beae90dea456a36164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mini-lsm-mvcc/src/mvcc.rs:50-56 | mini-lsm-starter/src/mvcc.rs:48-54 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/mvcc.rs\u0060 and \u0060mini-lsm-starter/src/mvcc.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"mini-lsm-mvcc/src/mvcc.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b53e6091fa4ba1c4901c2107ceb5aa7bd243eb9d11f1536e4e47c77d53a6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:199-205 | mini-lsm/src/table.rs:175-181 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"710459fa1d0a1024ebe5870b75a832ee75d146564d2c6dec896c3ef1176346ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): mini-lsm-starter/src/iterators/concat_iterator.rs:37-67 | mini-lsm-starter/src/iterators/two_merge_iterator.rs:35-61 | mini-lsm-starter/src/table/iterator.rs:34-78 | mini-lsm-starter/src/wal.rs:35-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-starter/src/iterators/concat_iterator.rs:37\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":"mini-lsm-starter/src/iterators/concat_iterator.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46584044e84614f735257976ec551c58b3fef8b8d943df12ab95e66199d7609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (155 lines \u00D7 2): mini-lsm-starter/src/key.rs:28-182 | mini-lsm/src/key.rs:28-182 \u2014 before extracting anything, compare \u0060mini-lsm-starter/src/key.rs\u0060 and \u0060mini-lsm/src/key.rs\u0060 as WHOLE FILES: 99% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-starter/src/key.rs:28\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":"mini-lsm-starter/src/key.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ca7eba9ad7c0d99eadb6ca8ad63880af72168b8c6aaeabcb2fb3b094bd71b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mini-lsm-mvcc/src/block.rs:33-42 | mini-lsm/src/block.rs:33-42 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block.rs\u0060 and \u0060mini-lsm/src/block.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"322279b982f0cb215eba36cc233ff06cffe6a3b47a3966ddb0b6def9753dcb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mini-lsm-mvcc/src/block/builder.rs:49-56 | mini-lsm/src/block/builder.rs:49-56 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/builder.rs\u0060 and \u0060mini-lsm/src/block/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/builder.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"502e1329c808e3a68c1a0a0440d86ff3fa3744542b672310246e2eaf2e02db6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/block/builder.rs:118-126 | mini-lsm/src/block/builder.rs:116-124 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/builder.rs\u0060 and \u0060mini-lsm/src/block/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/builder.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d248d990e88a3f8769b4d242ccc3ec259f970cef6e22f65f97753741dfa7aa63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/block/iterator.rs:52-60 | mini-lsm/src/block/iterator.rs:51-59 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/block/iterator.rs\u0060 and \u0060mini-lsm/src/block/iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/iterator.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf320ba0c46a29d7cbd19cceac3671df66bea256c4d613c97b0e54e473a4549a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): mini-lsm-mvcc/src/compact.rs:52-59 | mini-lsm-starter/src/compact.rs:48-55 | mini-lsm/src/compact.rs:52-59 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm-starter/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"071af761e913db425c7f7b3bcc73ba0f1e032c4339836654c28e74f07789ce52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mini-lsm-mvcc/src/compact.rs:462-472 | mini-lsm/src/compact.rs:418-428 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/compact.rs\u0060 and \u0060mini-lsm/src/compact.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9ba6277b875e453535b5096e81768b28694727abc300978603d400c4da4ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mini-lsm-mvcc/src/iterators/concat_iterator.rs:119-126 | mini-lsm/src/iterators/concat_iterator.rs:119-126 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/concat_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/concat_iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/concat_iterator.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9151652c41963701093d8f56e6e25ed163475fa47daa247fcc17506d659537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mini-lsm-mvcc/src/iterators/concat_iterator.rs:128-132 | mini-lsm/src/iterators/concat_iterator.rs:128-132 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/concat_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/concat_iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/concat_iterator.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e87f9448cd0f17a3580f59792704ce237a2151ca28f13ad0d1073c120bdf1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mini-lsm-mvcc/src/iterators/merge_iterator.rs:42-48 | mini-lsm-starter/src/iterators/merge_iterator.rs:44-50 | mini-lsm/src/iterators/merge_iterator.rs:42-48 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/merge_iterator.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c472d4fb6dcc2a4039c044895686a7c34cb09d53e67f9659e0af94b6b0f1f4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mini-lsm-mvcc/src/iterators/merge_iterator.rs:156-166 | mini-lsm/src/iterators/merge_iterator.rs:156-166 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/merge_iterator.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40743be5533560660b41f215e8bf52454dcbd0cf80c77dc8b84c2d0fd2f09b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:32-40 | mini-lsm/src/iterators/two_merge_iterator.rs:32-40 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/two_merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/two_merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/two_merge_iterator.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ea06fe8eff92896b6b553240cc187191f19d8a12d0bfd62af19309bd4c4c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:42-47 | mini-lsm/src/iterators/two_merge_iterator.rs:42-47 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/two_merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/two_merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/two_merge_iterator.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"520e8cb88f16607b935d316814fc00385234ab16a288b771ba29a31238176da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:49-58 | mini-lsm/src/iterators/two_merge_iterator.rs:49-58 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/iterators/two_merge_iterator.rs\u0060 and \u0060mini-lsm/src/iterators/two_merge_iterator.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/two_merge_iterator.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"168cbfe05b8ee81a98e77fa59cdf53bf69357ce7cebea855f92e846743a96267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/lsm_iterator.rs:70-78 | mini-lsm/src/lsm_iterator.rs:62-70 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_iterator.rs\u0060 and \u0060mini-lsm/src/lsm_iterator.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_iterator.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"685548b4041716f6363dcdf53717d0ef05eded2423d29a83ffb204e6ceac4cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mini-lsm-mvcc/src/lsm_iterator.rs:177-189 | mini-lsm/src/lsm_iterator.rs:147-159 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_iterator.rs\u0060 and \u0060mini-lsm/src/lsm_iterator.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_iterator.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf932679acc4654fada6346da04c04c1123ee997a9364f1bb748a77fe98522e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): mini-lsm-mvcc/src/lsm_storage.rs:131-140 | mini-lsm-mvcc/src/lsm_storage.rs:142-151 | mini-lsm-starter/src/lsm_storage.rs:97-106 | mini-lsm-starter/src/lsm_storage.rs:108-117 | mini-lsm/src/lsm_storage.rs:118-127 | mini-lsm/src/lsm_storage.rs:129-138 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/lsm_storage.rs\u0060 and \u0060mini-lsm-starter/src/lsm_storage.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e275e2b8eebadae8860edd31e1996ebeb784e9661e075de365d1b9c48871335a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mini-lsm-mvcc/src/manifest.rs:39-50 | mini-lsm/src/manifest.rs:39-50 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/manifest.rs\u0060 and \u0060mini-lsm/src/manifest.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/manifest.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4325d389ba73e1d6317064f37e2a8cb98e3d1431fad21fa3c4aa194ab02d63e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mini-lsm-mvcc/src/mem_table.rs:43-49 | mini-lsm-starter/src/mem_table.rs:45-51 | mini-lsm/src/mem_table.rs:43-49 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/mem_table.rs\u0060 and \u0060mini-lsm/src/mem_table.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67160aed44f7a69263dc2acbf6ba6accafeff6e98d8f1692e8f69284cd0ac9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mini-lsm-mvcc/src/mem_table.rs:93-100 | mini-lsm/src/mem_table.rs:53-60 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/mem_table.rs\u0060 and \u0060mini-lsm/src/mem_table.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c130d1a276cb6de6ad12244ca63bc8fd5ef12927ca538d232b069a8a7c82327c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mini-lsm-mvcc/src/mem_table.rs:103-110 | mini-lsm/src/mem_table.rs:63-70 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/mem_table.rs\u0060 and \u0060mini-lsm/src/mem_table.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"823d8569cbbfc7962bdedab6238527d8c31ed99d1ab4cd9a1295983c7fcb6bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mini-lsm-mvcc/src/mem_table.rs:269-273 | mini-lsm/src/mem_table.rs:214-218 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/mem_table.rs\u0060 and \u0060mini-lsm/src/mem_table.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/mem_table.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00ab2bc5356b8d3121560a091b9ca6789237a6150ae0df0596d4cabb1b999dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mini-lsm-mvcc/src/table.rs:34-39 | mini-lsm/src/table.rs:34-39 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5c63c8824d8965d345f4bd375626e10a772eee5f7560471ef57697e092b2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): mini-lsm-mvcc/src/table.rs:207-211 | mini-lsm-starter/src/table.rs:93-97 | mini-lsm/src/table.rs:183-187 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c551194c14dfc19f9b582fdd868253bd8f7a0a05797ec3bac8b772bf256d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): mini-lsm-mvcc/src/table.rs:310-322 | mini-lsm-starter/src/table.rs:134-146 | mini-lsm/src/table.rs:286-298 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table.rs\u0060 and \u0060mini-lsm/src/table.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/table.rs:310\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":"mini-lsm-mvcc/src/table.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"329da01e26d6c70b71839b2a7fda8726083ae71c2fd966c3ec6f5a59221368ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mini-lsm-mvcc/src/table/bloom.rs:84-90 | mini-lsm/src/table/bloom.rs:84-90 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/bloom.rs\u0060 and \u0060mini-lsm/src/table/bloom.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f6dc6f35b71c08fc92e7406c38c653ad4613d02e903c2b5e4bf2764efc4468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): mini-lsm-mvcc/src/table/bloom.rs:93-97 | mini-lsm-starter/src/table/bloom.rs:79-83 | mini-lsm/src/table/bloom.rs:93-97 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/bloom.rs\u0060 and \u0060mini-lsm-starter/src/table/bloom.rs\u0060 as WHOLE FILES: 89% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060mini-lsm-mvcc/src/table/bloom.rs:88\u0060 calls \u0060hash\u0060, \u0060put_u32\u0060 and \u0060mini-lsm-starter/src/table/bloom.rs:75\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":"mini-lsm-mvcc/src/table/bloom.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddab2a631bf3bc0af54bd893337a868bd72d669ab2baeab1d4544830547497d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/table/iterator.rs:40-48 | mini-lsm/src/table/iterator.rs:40-48 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/iterator.rs\u0060 and \u0060mini-lsm/src/table/iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/iterator.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0ba28f4b923b22c53c778228de1beed95f39330e083bd313aa443c0487c304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mini-lsm-mvcc/src/table/iterator.rs:51-56 | mini-lsm/src/table/iterator.rs:51-56 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/iterator.rs\u0060 and \u0060mini-lsm/src/table/iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/iterator.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3449b8f5543fc630dce179a80b5c4e279c70137d64d9bab5fd7525a51b28b7ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mini-lsm-mvcc/src/table/iterator.rs:73-81 | mini-lsm/src/table/iterator.rs:73-81 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/iterator.rs\u0060 and \u0060mini-lsm/src/table/iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/iterator.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60ef127704fe293d7c28ccf78b24a19610ed981c356106f72b1e601b6d7a132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mini-lsm-mvcc/src/table/iterator.rs:84-89 | mini-lsm/src/table/iterator.rs:84-89 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/table/iterator.rs\u0060 and \u0060mini-lsm/src/table/iterator.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/table/iterator.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a59795bc31910599d28b54a77f62053874cbf3ddb39c851bb1bb3abf35aa319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mini-lsm-mvcc/src/wal.rs:33-44 | mini-lsm/src/wal.rs:33-44 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/wal.rs\u0060 and \u0060mini-lsm/src/wal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/wal.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c296fd463aecaf33de5d94c445b222417749d4a42fc57f1e08432a3dcbd166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mini-lsm-mvcc/src/wal.rs:153-158 | mini-lsm/src/wal.rs:139-144 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/wal.rs\u0060 and \u0060mini-lsm/src/wal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/wal.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a9f04475cb1f4392819591d0807d0c84f30868fb4de4e89f772d6d1f1be536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mini-lsm-mvcc/src/wal.rs:115-124 | mini-lsm/src/wal.rs:101-110 \u2014 before extracting anything, compare \u0060mini-lsm-mvcc/src/wal.rs\u0060 and \u0060mini-lsm/src/wal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mini-lsm-mvcc/src/wal.rs:115\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":"mini-lsm-mvcc/src/wal.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9d2048d1602aabfac44239dc3734938c3b76fd668dd2a0f9b65f78b7a69791"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: mini-lsm/src/lsm_storage.rs, mini-lsm-mvcc/src/table.rs, xtask/src/main.rs, mini-lsm-mvcc/src/wal.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ea9f867005d667a331e8f4dd35b76285230a8574e1ecb870d87fb61a24cbdb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 22 files: The identical TodoComment appears in 22 files (44 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 44 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO(you): remove this lint after implementing this mod\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-starter/src/block.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecca9163df52e150c14754bb5cde97da84c3f07756f74fa19055fe22e6f6c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: build the bloom filter \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":"mini-lsm-starter/src/table/bloom.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbed39f36480576e20bd6692b82b61303c2b3b93ece5619d85e40a630891feae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: probe the bloom filter \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":"mini-lsm-starter/src/table/bloom.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"20687bc6212e338b69cd1490f5bbabc218a1eae4f7e33b62f877c9fe4d600c9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: apply remove again \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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc9fd1d776d03bb192fd69d4f73c9284cf4dc7f6eac260e3abf9f96a03b180e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: apply remove again \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":"mini-lsm/src/lsm_storage.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d61a2670b66efc777e58d71690ab02886e24fa533f988ef8b0d1c7435c1e0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we can implement \u0060key.next()\u0060 so that we can directly seek to the \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":"mini-lsm-mvcc/src/lsm_storage.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0e35b5abe95e48009089737da89ccc4c64802a54d9bd0a8f0ee3f179cd9bb9"}},{"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 \u0060mini-lsm-starter/src/bin/compaction-simulator.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-starter/src/bin/compaction-simulator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38c5f012829be529758092feb4d85f4d94a1b12e2f28deca84609a37724ac1c"}},{"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":"2d4a941906ee01744df019fe1d5043e939414ca3b5beab0554d05fa10425b158"},"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":"5d8c891fa759b2c8b59da851365aae33dd1e0a8e19c9bb3b6035709310d5c278"},"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":"24e9cb852375dd557ae0b9a3a8475280155d96dce6acb8a6e63b99345235ed88"},"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":"d76bf33d134c24efa2ea549a4addacbaf2ebeec295c6f9a70bcdb2b9b784b90b"},"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":"b13ce9d09e4d8bc33cc3a20136e184dcbfd0a25150d662a377daa2e0f79c85cd"},"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":"a6a0c8f1de15d7c7deddb4198a5848f3e05ec5abc1ff97332a4e7663ccf1702a"},"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":"b6c97cf24c7d477982370ddd3da93906217653545c92017f3bd527b938d75d76"},"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":"a7fbd00318cbe65603b95dac7e6e9c63266ff56afa48c1a741d0730f60e85a94"},"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":"321e5683d6878d3e062c1e580dc6fac15507ef9ae6508b84e921bb9402779e8c"},"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":"fc478727a8f6d3b9623a5631a3eeee7a2949ca7a0b49987cc5dd838f83d337ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45349f6239e2400cb362ee004dcad31b5c521c173147d133f03693899a2d262c"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"aea4a0144bedd70a707c440c17985122dd32568e444eca37166a524c09134aff"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e759935bc673c1bbcc6c3a0b71d4c7fad5f018c82bda27e04c84ef98fe18b58"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/pr.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://eu.umami.is/script.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-book/theme/head.hbs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25f0c8dd7b08be741981cd1479d654e2606c0154c3f6089da78651c2677b97d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.has_errored \u0026\u0026 self.iter.is_valid()\u0060 appears character-identically in 2 files \u2014 mini-lsm-mvcc/src/lsm_iterator.rs, mini-lsm/src/lsm_iterator.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/lsm_iterator.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a147fb6945c95dacad3c23e4c224ff065d728bf65c9f3eeec45860d64f0a933d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.is_empty() \u0026\u0026 (block_is_full || offset_is_full || count_is_full)\u0060 appears character-identically in 2 files \u2014 mini-lsm-mvcc/src/block/builder.rs, mini-lsm/src/block/builder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/block/builder.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4923b9daa475d2067aeab4ab49062b9915a43279bfb3a895dad62d3317159c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current_size_ratio \u003E size_ratio_trigger \u0026\u0026 id \u002B 1 \u003E= self.options.min_merge_width\u0060 appears character-identically in 2 files \u2014 mini-lsm-mvcc/src/compact/tiered.rs, mini-lsm/src/compact/tiered.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/tiered.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f2b35f08bd90585596cc0c20852f3ab1544a682e2d1190c307e33d48ed6c5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.a.is_valid() \u0026\u0026 self.b.is_valid() \u0026\u0026 self.b.key() == self.a.key()\u0060 appears character-identically in 2 files \u2014 mini-lsm-mvcc/src/iterators/two_merge_iterator.rs, mini-lsm/src/iterators/two_merge_iterator.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/iterators/two_merge_iterator.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"165f069d8d6aaab61b7707d2a86ce2d8dcc05c71abf72370d57fd5bc5407eb6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tier_to_remove.is_empty() \u0026\u0026 !new_tier_added \u0026\u0026 !output.is_empty()\u0060 appears character-identically in 2 files \u2014 mini-lsm-mvcc/src/compact/tiered.rs, mini-lsm/src/compact/tiered.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mini-lsm-mvcc/src/compact/tiered.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4847ed25082c0a44bc5bd383970806542e80914ec8729ed16a329665dca0d710"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":14,"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."]}]}