{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"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":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"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":"BaseTuner.inject_adapter (cyclomatic 73): BaseTuner.inject_adapter has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"555a98111c31c9a8a7ae9cdfd446d23eecf310e3712f5aaebec02b8285044c26"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraConfig.__post_init__ (cyclomatic 41): LoraConfig.__post_init__ has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/config.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aac1550c4160d75e56618d9f9ae265b14c1fc8890e7f30305f1c6ce79471155"}},{"ruleId":"D1","level":"warning","message":{"text":"save_and_load.get_peft_model_state_dict (cyclomatic 41): save_and_load.get_peft_model_state_dict has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa4fe61d3fb129e35e1e3816d37efcd2d6bb35181eefa0796c47cdd44793957"}},{"ruleId":"D1","level":"warning","message":{"text":"eva._get_eva_state_dict (cyclomatic 36): eva._get_eva_state_dict has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/eva.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"cded6aba78f92a94f5e53c4c3187bd86ad037b78267b20808ce87c1de59f3f60"}},{"ruleId":"D1","level":"warning","message":{"text":"conversion.convert_to_lora (cyclomatic 33): conversion.convert_to_lora has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/conversion.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"58072c3379add38dc2d67f1355c8b48b11cde80463b4183a12b49aea8d37d866"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel.from_pretrained (cyclomatic 31): PeftModel.from_pretrained has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a333a95423f8f31a3669b3fc3f963975fcfe1d7f2fb5c458b1cb5f14cb1ec838"}},{"ruleId":"D1","level":"warning","message":{"text":"tuners_utils._get_in_out_features (cyclomatic 31): tuners_utils._get_in_out_features has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9316a567ba771b9fa45c06f2adfb9f7840cf6c094a871d9fb699f91f965e48cf"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel.save_pretrained (cyclomatic 30): PeftModel.save_pretrained has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50abbd3ddcd482ccc4eb31556bcc5eff8b468169e067ba9d090583569ba1455"}},{"ruleId":"D1","level":"warning","message":{"text":"transformers_weight_conversion._convert_peft_config_moe (cyclomatic 30): transformers_weight_conversion._convert_peft_config_moe has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"259f8aafd5ea515dda6e700c568c9900af9bdfa8340d6f6bbdf945efc8494075"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel.get_prompt (cyclomatic 29): PeftModel.get_prompt has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"5979f92f3ca098336c14a14e17e8846de12d22304b689fc9339c4a51d9ff1249"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel.load_adapter (cyclomatic 29): PeftModel.load_adapter has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"a411b562ff96a0f1f8d13bf7c404cc57dc3966bd42c63fa33c4174496320f600"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModelForCausalLM.prepare_inputs_for_generation (cyclomatic 28): PeftModelForCausalLM.prepare_inputs_for_generation has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"edff4485b68e792a46a25e11f7ba3d48f899da4a2dc0fbf1eead2916f5154f53"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraLayer.update_layer (cyclomatic 28): LoraLayer.update_layer has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4824e527987e19eb901efeb495313032224bd0b2e60232d87ac946f5569273"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraModel._create_and_replace (cyclomatic 28): LoraModel._create_and_replace has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86a6c644858b137fde874113cd8c974f563b15a55558448bcd1e488f2867cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraModel._enable_peft_forward_hooks (cyclomatic 28): LoraModel._enable_peft_forward_hooks has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c914470bf6c0f6c4f459a91b649b22d64b71c3a49465b788480cce7fce811da"}},{"ruleId":"D1","level":"warning","message":{"text":"other.set_additional_trainable_modules (cyclomatic 27): other.set_additional_trainable_modules has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd12497ddb5866860948ded6c3470637781304a3557d74ecefff9ea80b90352"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraModel._check_add_weighted_adapter (cyclomatic 26): LoraModel._check_add_weighted_adapter has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95248bf0904cc49c7f3144ae366024add47ab307e459ff52c089437236dc1c2"}},{"ruleId":"D1","level":"warning","message":{"text":"other.prepare_model_for_kbit_training (cyclomatic 26): other.prepare_model_for_kbit_training has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c61cb6583449c94f22e7793c201ac33c33401060be66e171a8b720ed7bc13f5"}},{"ruleId":"D1","level":"warning","message":{"text":"other._prepare_prompt_learning_config (cyclomatic 26): other._prepare_prompt_learning_config has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a8e1aefd8732ec33e378f054cb84069232ce81af36d47357b014893f230f3d"}},{"ruleId":"D1","level":"warning","message":{"text":"tuners_utils.check_target_module_exists (cyclomatic 25): tuners_utils.check_target_module_exists has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff227373b7f571840942399235142abe996378f46f3a845c3d195bad36133fa"}},{"ruleId":"D1","level":"warning","message":{"text":"quantization_utils.resolve_quantization_backend (cyclomatic 25): quantization_utils.resolve_quantization_backend has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/quantization_utils.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a6039f07220e060dd0386ebcd565e22768415e145222899b9f6950b38df58e"}},{"ruleId":"D1","level":"warning","message":{"text":"save_and_load._maybe_shard_state_dict_for_tp (cyclomatic 24): save_and_load._maybe_shard_state_dict_for_tp has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a79ff93af663e3552987d4100f3130bde4b3f950ac88dca422a63ff621d5909"}},{"ruleId":"D1","level":"warning","message":{"text":"run.run_benchmark (cyclomatic 23): run.run_benchmark has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f94319d8bcad9bd17745c121c6f137982043a13ad9cbd78ccf7f1ac9acbeae"}},{"ruleId":"D1","level":"warning","message":{"text":"ParamWrapper.update_layer (cyclomatic 23): ParamWrapper.update_layer has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"859eff85eed273244dc2fffd6e1718ad3f958a9a82edc7cfbb3822a35d5acb60"}},{"ruleId":"D1","level":"warning","message":{"text":"transformers_weight_conversion.build_peft_weight_mapping (cyclomatic 23): transformers_weight_conversion.build_peft_weight_mapping has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6763b1624d0551c65368b6cfabefffc90a68e2643746b0d052ea56613aea024"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraFAOptimizer.step (cyclomatic 22): LoraFAOptimizer.step has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fa84f0d15e4d88641720ba7066aa361c17d96f82aabc9bf8f9c26a5fb54734"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel._setup_prompt_encoder (cyclomatic 22): PeftModel._setup_prompt_encoder has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1b898f819f9f3f15f5423c112ad787c95779aa2e500d81764076881cd04e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"hotswap.hotswap_adapter_from_state_dict (cyclomatic 22): hotswap.hotswap_adapter_from_state_dict has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/hotswap.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aeb8dae81a18ca3ed46f5fc18ef347566e04c09512f679aeb9af45ddd1275f"}},{"ruleId":"D1","level":"warning","message":{"text":"Conv2d.update_layer (cyclomatic 21): Conv2d.update_layer has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cbdbcd0e19ef40049eaf6348b6d9512dc3dc134e6deb8482621a57bf8a48c4"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseTuner._unload_and_optionally_merge (cyclomatic 21): BaseTuner._unload_and_optionally_merge has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77cb933812c8512ad2b16f47d5d05d81aca3fa8487824ca3050ab07fcf42351"}},{"ruleId":"D1","level":"warning","message":{"text":"transformers_weight_conversion.convert_peft_adapter_state_dict_for_transformers (cyclomatic 21): transformers_weight_conversion.convert_peft_adapter_state_dict_for_transformers has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2751c6a4532bd2c9f4725482cf0757126092a34de1d67f33a1bad77e81b17e4"}},{"ruleId":"D1","level":"warning","message":{"text":"run.train (cyclomatic 20): run.train has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/run.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1261a85f8e9a1c7375a62d84ae3571f9f9c25e5fc8efe156a24921c3c58192ec"}},{"ruleId":"D1","level":"warning","message":{"text":"peft_model.get_layer_status (cyclomatic 20): peft_model.get_layer_status has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"62634e67315cc5746a9b85af264c0dc26a59197d41f9ed09af52b29ee373894d"}},{"ruleId":"D1","level":"warning","message":{"text":"BOFTLayer.update_layer (cyclomatic 20): BOFTLayer.update_layer has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa56f78c14454806aee8687bddbd7b70082d54033f5ac2caebd91e6419da49c"}},{"ruleId":"D1","level":"warning","message":{"text":"save_and_load.set_peft_model_state_dict (cyclomatic 20): save_and_load.set_peft_model_state_dict has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"400de26491d72688892171b2eda63fff8de3420033339980957a58abb0815d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"save_and_load.load_peft_weights (cyclomatic 20): save_and_load.load_peft_weights has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e835921f7e25387285c6138698d246726aceafe62ed1e924f53a0660336d24"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModelForSeq2SeqLM.forward (cyclomatic 19): PeftModelForSeq2SeqLM.forward has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f5ad5a07867fd05fe5e6966fe93ff57a1830230947c537b56684bc7442027"}},{"ruleId":"D1","level":"warning","message":{"text":"tuners_utils._maybe_include_all_linear_layers (cyclomatic 19): tuners_utils._maybe_include_all_linear_layers has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a9a9e864d7eb85e72dac97b0adeb5e1a2429ee34178d45d4ac2276e69ef63d"}},{"ruleId":"D1","level":"warning","message":{"text":"sanitizer._evaluate_node (cyclomatic 18): sanitizer._evaluate_node has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/sanitizer.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f17fa3723661f450f5266ccf934b0c0c47b8cf6601bd673d58fbc14ca1cf36e"}},{"ruleId":"D1","level":"warning","message":{"text":"Linear.forward (cyclomatic 18): Linear.forward has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"25047b3a66cd34495183c6aad1610ecf3966e7771d3905c9d59e09fd4d5d80f1"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraModel.add_weighted_adapter (cyclomatic 18): LoraModel.add_weighted_adapter has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9511fbedc40ddc2162458275c4a8cf202939e185989d3293c01b0cbf9642b"}},{"ruleId":"D1","level":"warning","message":{"text":"PsoftConfig.__post_init__ (cyclomatic 18): PsoftConfig.__post_init__ has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/psoft/config.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a6d451b85b6f3aac70e5c716173f09c68a03c3ad9fef0d4abb164de8ad7ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel.create_or_update_model_card (cyclomatic 17): PeftModel.create_or_update_model_card has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"464d9d7f02cc6cce8c5fd0a59f17ac43ff39e9084d77fe6f35eb59e21d74a669"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModelForSequenceClassification._prefix_tuning_forward (cyclomatic 17): PeftModelForSequenceClassification._prefix_tuning_forward has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2436934d4608ee15e78f1bdb74bdaa98bda09cbad8f0c7e0f1ac5e73d5415487"}},{"ruleId":"D1","level":"warning","message":{"text":"FrodModel._init_frod_projections (cyclomatic 17): FrodModel._init_frod_projections has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/model.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5e971fc0bed902f717f7be5027daff018315586e1e715274e33db9da37ec96"}},{"ruleId":"D1","level":"warning","message":{"text":"intruders.reduce_intruder_dimension (cyclomatic 17): intruders.reduce_intruder_dimension has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/intruders.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"755eb43d9969e83f2558bebe0c863698c7e1cdf167c295cdf279518603e13073"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraLayer._sync_tp_replicated_lora_weights (cyclomatic 17): LoraLayer._sync_tp_replicated_lora_weights has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0434e23b8d5be31843186de48d1f1861416d0de7fb375acfd8fe6c39d71190d4"}},{"ruleId":"D1","level":"warning","message":{"text":"DetachedFluxShadowModel.from_base (cyclomatic 17): DetachedFluxShadowModel.from_base has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/diffusion_models.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f4de7cbd5608daf6056c8dd37dba227e93721479e62c2091db5f28d18527e7"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseTuner._mark_only_adapters_as_trainable (cyclomatic 17): BaseTuner._mark_only_adapters_as_trainable has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f45c1b71dbcc55d659c62a14ad43362316b5d45522294ef43f37fabd3c8d79"}},{"ruleId":"D1","level":"warning","message":{"text":"tuners_utils.replicate_layers (cyclomatic 17): tuners_utils.replicate_layers has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bc9397f4ee78157c8dfa23e39469da19ad3d0106b87eddb43c3a415e37daf0"}},{"ruleId":"D1","level":"warning","message":{"text":"tuners_utils.cast_adapter_dtype (cyclomatic 17): tuners_utils.cast_adapter_dtype has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5c0be191ec578feca17c7fe4c887adb12541f5f27e88dee839dd0dd3da60a2"}},{"ruleId":"D1","level":"warning","message":{"text":"app.matches_filters (cyclomatic 16): app.matches_filters 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":"method_comparison/peft-shop/app.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0cd0fdce994369b44b5666f00556050c62c940f08f01c1a467904e57b7d581"}},{"ruleId":"D1","level":"warning","message":{"text":"helpers.create_dummy_lora_config (cyclomatic 16): helpers.create_dummy_lora_config has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/helpers.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1471120593e5ef6f5d7a9841e5c6a9e1f8dc7b8b3c25fc052d35880152af9a2"}},{"ruleId":"D1","level":"warning","message":{"text":"PeftModel._update_offload (cyclomatic 16): PeftModel._update_offload has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f346e2dd92f2cc04e9cfe8e7824ddd9ed861ee4999ec9aef18b40bfe927d49c"}},{"ruleId":"D1","level":"warning","message":{"text":"AdaLoraModel._create_new_module (cyclomatic 16): AdaLoraModel._create_new_module has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3762be00ba071cb4273ea8e5475c9a9bb5e21e03f77c42fbaaf754ece4984552"}},{"ruleId":"D1","level":"warning","message":{"text":"Linear._move_adapter_to_device_of_base_layer (cyclomatic 16): Linear._move_adapter_to_device_of_base_layer has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c3784bacba967b0910148be582e723a503d268d2f3826e8ba4fefbc64895a8"}},{"ruleId":"D1","level":"warning","message":{"text":"GloraLayer.unmerge (cyclomatic 16): GloraLayer.unmerge has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab50d72e2ceb3ab78c5d91d0ec750e1295c58a905ed8952be36f9f9516d35f0"}},{"ruleId":"D1","level":"warning","message":{"text":"astra.calib_cov_distribution (cyclomatic 16): astra.calib_cov_distribution has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32124581aebaa6574dcaccd93fafcbf51a8464ca9ff45e8380716b8f3d69dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraModel._svd_generalized_task_arithmetic_weighted_adapter (cyclomatic 16): LoraModel._svd_generalized_task_arithmetic_weighted_adapter has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca3ade5a547baed9918b87339ac03a310331cfff5ff67dce31b55e0bef69772"}},{"ruleId":"D1","level":"warning","message":{"text":"LoraParallelLinear.update_layer (cyclomatic 16): LoraParallelLinear.update_layer has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/tp_layer.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cd1d5776819a9a6368ccf7949df4c298b2ae7be91476e366980b552d3d8d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"variants.calculate_alora_offsets (cyclomatic 16): variants.calculate_alora_offsets has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8912e515db0113f6cdd5e024d63f086aa765f6449320e09ba424aa5f973d4cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"tuners_utils.onload_layer (cyclomatic 16): tuners_utils.onload_layer has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca245aaec9a2b86108bd4cfe5dc2014ede69969460a41309527aa8530f745e73"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner.inject_adapter (cognitive 120): BaseTuner.inject_adapter has cognitive complexity 120 (threshold 15). Drivers by points: if/else 42 (84 pts), loops 11 (15 pts), boolean chains 14, ternaries 3 (7 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b63ef89894d37e6db8a56025cd5eeae373b367116b3299f9e32169ae2195674"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel.save_pretrained (cognitive 77): PeftModel.save_pretrained has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (56 pts), loops 5 (14 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f5b57e1cc0ff4c12e16f43887bcb4cc3e0e083b5b267e1847482e6c6a1b256"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel.get_prompt (cognitive 67): PeftModel.get_prompt has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (55 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454dac8b1b3115d94d3dad198bfc869e272a75875b10b36c1246341733135cd"}},{"ruleId":"D2","level":"warning","message":{"text":"transformers_weight_conversion.build_peft_weight_mapping (cognitive 65): transformers_weight_conversion.build_peft_weight_mapping has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 8 (24 pts), boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"251c4276cd1f1ff3b08018300ba02ad2f854914c2d10d7b33c81e81079691952"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraFAOptimizer.step (cognitive 64): LoraFAOptimizer.step has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (60 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"248ee7eae8fcf92d32d555f173124625b50884b1eee8ba1775f9c9e40b2b496c"}},{"ruleId":"D2","level":"warning","message":{"text":"save_and_load.get_peft_model_state_dict (cognitive 64): save_and_load.get_peft_model_state_dict has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (46 pts), boolean chains 10, ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a40020fef71ba6e8c8db014dbd5c9585f2385ab9138d797591c7301d433b16"}},{"ruleId":"D2","level":"warning","message":{"text":"other.set_additional_trainable_modules (cognitive 62): other.set_additional_trainable_modules has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (44 pts), loops 4 (12 pts), boolean chains 6 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc414e8ecccbe91247892fe9f55e527d917b3f9aff284c85cf3fa392204c695"}},{"ruleId":"D2","level":"warning","message":{"text":"save_and_load._maybe_shard_state_dict_for_tp (cognitive 56): save_and_load._maybe_shard_state_dict_for_tp has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 6 (16 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d19a8e00dec3bacedca3aa00329aee109e75ffc94fd5c7ed94bdcabb31141a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraModel._enable_peft_forward_hooks (cognitive 55): LoraModel._enable_peft_forward_hooks has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 5 (10 pts), boolean chains 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff702151608d3c70bcd9799aa6758b3be97e67ef626eba601118a041691cb257"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel.from_pretrained (cognitive 53): PeftModel.from_pretrained has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"58478c517f7462331c1d129479c81c5a6b2a9d4ce8bf2b4cee369a356c68e15c"}},{"ruleId":"D2","level":"warning","message":{"text":"conversion.convert_to_lora (cognitive 52): conversion.convert_to_lora has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29 (44 pts), boolean chains 3, loops 3, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/conversion.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c26ea970da1fe4ded2af44427ee505d2d96ea8d6c39f96e5cff1bd29eb4bdcb"}},{"ruleId":"D2","level":"warning","message":{"text":"eva._get_eva_state_dict (cognitive 52): eva._get_eva_state_dict has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (37 pts), loops 7 (9 pts), boolean chains 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/eva.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"259a523cb7160e038d00b0cc0a80142e3743dfab20b6a2097ed2edc7c67e7677"}},{"ruleId":"D2","level":"warning","message":{"text":"_ConvNd.merge (cognitive 52): _ConvNd.merge has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (51 pts), loops 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c52b228eda94d1219d843ba27279d208aaeff27b0da00c54a8f65a4ad320b3"}},{"ruleId":"D2","level":"warning","message":{"text":"tuners_utils.check_target_module_exists (cognitive 51): tuners_utils.check_target_module_exists has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 6, ternaries 2 (6 pts), loops 1 (4 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ac68c1712525d43419bfbdb03fad141302c431e497f94464fbeaf75ef793f6"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModelForCausalLM.prepare_inputs_for_generation (cognitive 49): PeftModelForCausalLM.prepare_inputs_for_generation has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 10 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e5550701a1ab145684bc20402eaebfa6d29a291d75ef2282943513ea5c090"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 49): Linear.merge has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 1 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e782aaf73f38c19ec86a502b8c52a55c14b31ee8f5b9f9737ae5316cff97399"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraModel._create_and_replace (cognitive 49): LoraModel._create_and_replace has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3675645cbdc8734e7e207e490ce21967608eeb1393ea4f3634effb534b99a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel._update_offload (cognitive 48): PeftModel._update_offload has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 7 (19 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a559408507cbe25b35f48fb1fee209aa986f7b0d0d3f2469b853faa9f4e74c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"tuners_utils.cast_adapter_dtype (cognitive 46): tuners_utils.cast_adapter_dtype has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 5 (11 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff26d218d2f24019b0fa657a295909b2c90f8e8e1938e7440ef4300589001d28"}},{"ruleId":"D2","level":"warning","message":{"text":"peft_model.get_layer_status (cognitive 45): peft_model.get_layer_status has cognitive complexity 45 (threshold 15). Drivers by points: loops 8 (26 pts), if/else 9 (16 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe43fc5865efbccf76017adcdb576c02c8b93dc81017ccf3d304e3ce7497a53"}},{"ruleId":"D2","level":"warning","message":{"text":"other.prepare_model_for_kbit_training (cognitive 43): other.prepare_model_for_kbit_training has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"910bb667ae4ce42da92100464027ea2beb3818e0886cd0d10636c7d7cef84936"}},{"ruleId":"D2","level":"warning","message":{"text":"quantization_utils.resolve_quantization_backend (cognitive 41): quantization_utils.resolve_quantization_backend has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/quantization_utils.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4efa3ab2b075cad13bb8e156859e2df36f99b3f39df72ad18ef490f9deec12"}},{"ruleId":"D2","level":"warning","message":{"text":"transformers_weight_conversion._convert_peft_config_moe (cognitive 41): transformers_weight_conversion._convert_peft_config_moe has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 9, loops 3 (4 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b2f8080b83cfa08870a0570f04530a619351c0d5c0ed8b87a24253362c865"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel.load_adapter (cognitive 40): PeftModel.load_adapter has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 6, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b60c440aaa6b27ae35539e0c56812e93bcded276b9567a4f35ecd40faba7e91"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraModel.add_weighted_adapter (cognitive 39): LoraModel.add_weighted_adapter has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34e5e6a2075b6b999d90a6ee4292ea5f645f568f2281432cccb6bd1c5e542ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.forward (cognitive 38): Linear.forward has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 2 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4291b3a3a1138d08c538f8fcf109ae0f6e5b0bc3c853dea925c2a3a2a662b4ae"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraConfig.__post_init__ (cognitive 38): LoraConfig.__post_init__ has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 15, ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/config.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"600852767cdc1e843c445dd97f82b79cc579c38ae385b1eb3a06b7b24e5e854c"}},{"ruleId":"D2","level":"warning","message":{"text":"corda.preprocess_corda (cognitive 37): corda.preprocess_corda has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (12 pts), boolean chains 1 (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":"src/peft/tuners/lora/corda.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"687368b247326a71542b36b81bed18cc4a56dd2c8496c0f1b9c99b65811cf95a"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner._unload_and_optionally_merge (cognitive 37): BaseTuner._unload_and_optionally_merge has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), error handling 2 (5 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2218251edd1ca07238c4705b785b706d23f7a39c65f77e5cc08bb3b3f2e6b89"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv2d.update_layer (cognitive 36): Conv2d.update_layer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"070abd0a69ca1c441da23f6a1b359552b6a17de83fcfccc66dc530ac387dafec"}},{"ruleId":"D2","level":"warning","message":{"text":"variants.calculate_alora_offsets (cognitive 36): variants.calculate_alora_offsets has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c957569995369901625c7085af819fbbb1a135f3576bee9d9e1bb03dc01bc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"hotswap.hotswap_adapter_from_state_dict (cognitive 36): hotswap.hotswap_adapter_from_state_dict has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (25 pts), error handling 2 (5 pts), boolean chains 3, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/hotswap.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd130a1689d29b23c2425c1bc23c9fba2b74723eba9472f984e831484900eb"}},{"ruleId":"D2","level":"warning","message":{"text":"save_and_load.load_peft_weights (cognitive 36): save_and_load.load_peft_weights has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (24 pts), error handling 2 (5 pts), loops 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e908d21747fec50d785285c5dbc9f7738536b5b41ae46586ab78229ecd7b3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"BOFTLayer.update_layer (cognitive 35): BOFTLayer.update_layer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6e956190a26d62e935fea2cc350456effc09a5e3eec63257a3e3bc3eebf90d"}},{"ruleId":"D2","level":"warning","message":{"text":"tuners_utils._maybe_include_all_linear_layers (cognitive 35): tuners_utils._maybe_include_all_linear_layers has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"77433f61ee321a8147a93705c8b478691885853ae6e0d6948d623efdd6726649"}},{"ruleId":"D2","level":"warning","message":{"text":"tuners_utils._get_in_out_features (cognitive 34): tuners_utils._get_in_out_features has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 9, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1c81f392704ef353656459d3b7b345b8a3cf0e3e45d7117259b79d62e9991"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModelForSequenceClassification._prefix_tuning_forward (cognitive 33): PeftModelForSequenceClassification._prefix_tuning_forward has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ebc20f3dd76406f0e6232ef59da06b6908930f8c02b1fc923fe5ff453ab24c"}},{"ruleId":"D2","level":"warning","message":{"text":"astra.preprocess_astra (cognitive 33): astra.preprocess_astra has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e373e8d8e92fd3330491425e4c3ec252436f2a4382cbde2dcb68f966c55a763b"}},{"ruleId":"D2","level":"warning","message":{"text":"intruders.reduce_intruder_dimension (cognitive 33): intruders.reduce_intruder_dimension has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (27 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/intruders.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b64553b21702a0722d7fb1c9024821a1986c342e276cf289db0d3b4f2ceec1"}},{"ruleId":"D2","level":"warning","message":{"text":"save_and_load._get_adapter_state_dict_key_prefixes (cognitive 33): save_and_load._get_adapter_state_dict_key_prefixes has cognitive complexity 33 (threshold 15). Drivers by points: loops 5 (14 pts), ternaries 3 (13 pts), if/else 2 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"96058329471c2f0591210a0e2e323fd7d48976c75e77bd2aca278b710dd94d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraModel._check_add_weighted_adapter (cognitive 32): LoraModel._check_add_weighted_adapter has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 2, ternaries 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ad885877571e750db9e858a341c069744b06737b72dadc866ffad917a3487"}},{"ruleId":"D2","level":"warning","message":{"text":"save_and_load.set_peft_model_state_dict (cognitive 32): save_and_load.set_peft_model_state_dict has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a52e04cbbd2b624bd56702f6ec175ff977cf00034c1bb15b391f9008b0f310"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel._setup_prompt_encoder (cognitive 31): PeftModel._setup_prompt_encoder has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"48584682bfa061975e55481728e5503c6d27e8fd42c2543646156b2228f94f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 31): Linear.merge has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (_ConvNd.merge) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"73edc98e6a9bc18532a01a093af28a63ed18eef7c826a65612ed3aabae2ed9c0"}},{"ruleId":"D2","level":"warning","message":{"text":"_ConvNd.merge (cognitive 31): _ConvNd.merge has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Linear.merge) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e555e9e90f710bca36cebcdb61acb43143950a5e1d81aa3b7c92d970bbb6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"MissLinear.forward (cognitive 31): MissLinear.forward has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/miss/layer.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c0e6593125a54381a9394fec939bcfe75767012a2e26a6074b113ae3089a26"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner._mark_only_adapters_as_trainable (cognitive 31): BaseTuner._mark_only_adapters_as_trainable has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f37227255453c278df33c3a4a76f1b1452d029bd83237ec4fdae8458e9d79a9"}},{"ruleId":"D2","level":"warning","message":{"text":"run.train (cognitive 29): run.train has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, error handling 3, loops 2 (3 pts), ternaries 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":"method_comparison/MetaMathQA/run.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26152ffcb99b63817b2a15b8aad80df0f7472306ec3b1d4ae1a73b430afc591"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaLoraModel.forward (cognitive 29): AdaLoraModel.forward has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1092045a73b02a28ddb4ef932887ef4d24ec43038d3fea6d64d2515cf81c027a"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 29): Linear.merge has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b7a7329f0808ade6d3ba653fe5d2229789e4ceaa0ac88a421a2e60412d8c46"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 29): Linear.merge has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/road/layer.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f291e7142d462b537f196559f94794c6d128fcd63e90fb15ce2715a70baf9e"}},{"ruleId":"D2","level":"warning","message":{"text":"transformers_weight_conversion.convert_peft_adapter_state_dict_for_transformers (cognitive 29): transformers_weight_conversion.convert_peft_adapter_state_dict_for_transformers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 6 (8 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"de69161043929837418a4d04dfa847f6a28c3304f11aa593c1ea446bfbdb7012"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModelForSeq2SeqLM.forward (cognitive 28): PeftModelForSeq2SeqLM.forward has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97e05aa71400731e25342d843684812650a8575cabcbef104e5fc62238b0ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"LilyModel._post_injection_hook (cognitive 28): LilyModel._post_injection_hook has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/model.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fcb33c4e6d8f18ad68fbdf5a3190fc05ae52f5f9b43c1153ea7378850c8f61"}},{"ruleId":"D2","level":"warning","message":{"text":"arrow.ensure_adapters_target_linear_layers_only (cognitive 28): arrow.ensure_adapters_target_linear_layers_only has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), ternaries 1 (5 pts), error handling 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/arrow.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d1233ec32ad44b64ab8b6fe85b98043f44fc89cb8df993f242bf2b67b63bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"other._prepare_prompt_learning_config (cognitive 28): other._prepare_prompt_learning_config has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2434ab6a0c3c51f51e429970c45650ae56a0185b9b5be12fbfea4118840dee"}},{"ruleId":"D2","level":"warning","message":{"text":"FrodModel._init_frod_projections (cognitive 27): FrodModel._init_frod_projections has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/model.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"83398ee1c55c9f393970ad790fb0b20bcd310c88c9b03104dd938fc43e5f753c"}},{"ruleId":"D2","level":"warning","message":{"text":"app_embed.generate_pareto_plot (cognitive 26): app_embed.generate_pareto_plot has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/app_embed.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c9833641b5b8808984a1cf54a611a9e83e3dfb04cb4059cb22b5f21afa870a"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.create_dummy_lora_config (cognitive 26): helpers.create_dummy_lora_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/helpers.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec25b7d1dfdc3126126dbef105940d1b8b040a4be0064086ea06c0ebaef7e311"}},{"ruleId":"D2","level":"warning","message":{"text":"OrthLayer.get_matrix (cognitive 26): OrthLayer.get_matrix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/psoft/layer.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"285966047584cdea007a2ed08cc75e87c39e58150d305ca498fd60a3f9c7242b"}},{"ruleId":"D2","level":"warning","message":{"text":"HRAConv2d.forward (cognitive 25): HRAConv2d.forward has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/layer.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54afc323745263581e9774d292aa517fdb84302c715787747ef57583529fc43"}},{"ruleId":"D2","level":"warning","message":{"text":"MixedModel._mark_only_adapters_as_trainable (cognitive 24): MixedModel._mark_only_adapters_as_trainable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/mixed/model.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c2a6c87321b08b13d97002842e59cefe7e776fb35d4755545d07ad1ca4b508"}},{"ruleId":"D2","level":"warning","message":{"text":"tuners_utils.onload_layer (cognitive 24): tuners_utils.onload_layer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc52b7b2a6dfbfc267156a494825dd8a71a8293b7ad21b81a5ba0cba942bda1"}},{"ruleId":"D2","level":"warning","message":{"text":"app.load_benchmark_results (cognitive 23): app.load_benchmark_results has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/peft-shop/app.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a586ca1f7ce507a5bdf4da08ea340b93d027b0b1c3629f9fbeccb24740a6f9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitizer._evaluate_node (cognitive 23): sanitizer._evaluate_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/sanitizer.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ded03769ab7b1c86753c8419dc98d8612c7482ed15779095f5708622aa145c8"}},{"ruleId":"D2","level":"warning","message":{"text":"run.run_benchmark (cognitive 23): run.run_benchmark has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 6, loops 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"245402f4acac60053bdcf2ccd5cd9651f5b2ed302add5f33efbca4b959772fde"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.forward (cognitive 23): Linear.forward has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0880f962a5d5128960c2cfb95881427d1ded6a0a51415e574732663a1ad7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"eva._load_eva_state_dict (cognitive 23): eva._load_eva_state_dict has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/eva.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3d663108b9c4939b2d0120d1379986bd8db38702cf8edc5b337b4055e2a688"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner._inject_parameters (cognitive 23): BaseTuner._inject_parameters has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3193b8232052351aa3ce3a2a343ced571c19677ac381e8d8b0dac90576057ac"}},{"ruleId":"D2","level":"warning","message":{"text":"run.train (cognitive 22): run.train has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), error handling 3, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/image-gen/run.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"956235dcb5469cbd86e64052f2a407ee43ce304c73cb16b1488ca8f6f43d1fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"AdamssModel.update_and_allocate (cognitive 22): AdamssModel.update_and_allocate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/model.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d710832009aefb137a85efe755389933a26dd00c6a8f8a7ba2180d2fae6129a"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear._move_adapter_to_device_of_base_layer (cognitive 22): Linear._move_adapter_to_device_of_base_layer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0404fe022d26cc4f67dc5aa147aecd15d688e322d858db18117997c0d294b83c"}},{"ruleId":"D2","level":"warning","message":{"text":"astra.calib_cov_distribution (cognitive 22): astra.calib_cov_distribution has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 7 (10 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e4d76f0e231b7a8a3820663c7e07dd0861e679dd9bf70fe36e939ee55c87b"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraLayer.update_layer (cognitive 22): LoraLayer.update_layer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c569344ed39bca15becdd94bce5d73bed2cdbfa7f000a1da83af4cfe2d1e02cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MissLinear.merge (cognitive 22): MissLinear.merge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/miss/layer.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"056951f5be48e3865a48aef962c6ed45150921c07840ea5e6a0ccf410e60bfbb"}},{"ruleId":"D2","level":"warning","message":{"text":"PsoftConfig.__post_init__ (cognitive 22): PsoftConfig.__post_init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/psoft/config.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f339f08c1852d27f99eab5281304d40b0de68c38785ddd865905e7e373b47d"}},{"ruleId":"D2","level":"warning","message":{"text":"app.matches_filters (cognitive 21): app.matches_filters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 1 (2 pts) (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":"method_comparison/peft-shop/app.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fcf7a0da3ca7f419d9f71eaae218cf6c70a8ec87317a24f401d486f576f472"}},{"ruleId":"D2","level":"warning","message":{"text":"AdamssModel._global_mask_to_target (cognitive 21): AdamssModel._global_mask_to_target has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/model.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff3e801479b2d178b195f084b243b21545b2d2ee1bfe8baede111369f9c4e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TinyLoraModel._create_and_replace (cognitive 21): TinyLoraModel._create_and_replace has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/model.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bbd03aa2c5fd5fa641a9945364cafffc59598d7a60a051943b31d5e8df53dd"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTunerLayer._move_adapter_to_device_of_base_layer (cognitive 21): BaseTunerLayer._move_adapter_to_device_of_base_layer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3a0eee863207e2b22947dae1ab41ce06915b4288c3a66922590aa3adb1df2f"}},{"ruleId":"D2","level":"warning","message":{"text":"other._set_trainable (cognitive 21): other._set_trainable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaeb533d68bb7b1a9e81354011dab2f9e67198dca6e71cdc2b21330900d5d18"}},{"ruleId":"D2","level":"warning","message":{"text":"loraplus.create_loraplus_optimizer (cognitive 20): loraplus.create_loraplus_optimizer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/loraplus.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefd07e956b3eb4e8df9325b907634c60f476022ab68a7ef0fdaec4ed44cad2f"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel.create_or_update_model_card (cognitive 20): PeftModel.create_or_update_model_card has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"452448d86f19ffaaf1cb5387120a02077607413188a278b1fea7a0ae8ecb4c41"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModelForCausalLM.forward (cognitive 20): PeftModelForCausalLM.forward has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (20 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"88394def71da6bbd20972cfe847ab09d9be70a3dfa1d5f7b04987c1a6d85bac8"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModelForQuestionAnswering._prefix_tuning_forward (cognitive 20): PeftModelForQuestionAnswering._prefix_tuning_forward has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3314}}}],"partialFingerprints":{"codehealthFindingId/v1":"937e177d55dce23483390491d3da28d2e9b01fdc455b7bf0f7b268a4bd8584e1"}},{"ruleId":"D2","level":"warning","message":{"text":"peft_model.get_model_status (cognitive 20): peft_model.get_model_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 6 (8 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b386fda40894875febdce5f66cd547706f3d27e1a2d7ae70880360affabb761"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaLoraModel._create_new_module (cognitive 20): AdaLoraModel._create_new_module has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50c20c76df8f229e40f0d2f80668750fb98733232bf22c5e2e77b83e4b4f830"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.forward (cognitive 20): Linear.forward has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cfbbd089aa4633208ede309bcf7192cacdbdb2186927eed0f21b0ff8d6d84e"}},{"ruleId":"D2","level":"warning","message":{"text":"corda.calib_cov_distribution (cognitive 20): corda.calib_cov_distribution has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/corda.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced131b7910f49ebb6243f81dd32b4deab0f6ce0d7120734e1088091d5452b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"DetachedFluxShadowModel.from_base (cognitive 20): DetachedFluxShadowModel.from_base has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/diffusion_models.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20b6f140782de7164155a59b420e15d5cf8441fa64ad4ca67b6a35428155893"}},{"ruleId":"D2","level":"warning","message":{"text":"RankAllocator.mask_to_budget (cognitive 19): RankAllocator.mask_to_budget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c8e8ff810e6efa0c4fe3b9af0ab8a2a062a1f840e90e4577a0ec9e6f307fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"arrow.check_loaded_lora_compatibility_arrow (cognitive 19): arrow.check_loaded_lora_compatibility_arrow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/arrow.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35457e6c8c924ac4f6167825dd76c4c72711057f75603af590f1fd1bad9fda"}},{"ruleId":"D2","level":"warning","message":{"text":"arrow.create_arrow_model (cognitive 19): arrow.create_arrow_model has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/arrow.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dcb60fe59178ec549e127abb401363476d3b12e6f8bf76c862c9374c0cc8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"OrthLayer.reset_parameters (cognitive 19): OrthLayer.reset_parameters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/psoft/layer.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88e39f28e8c853862c6c58a0b62888469bbeae4af127242b565cfcc8bbe942a"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner._replace_module (cognitive 19): BaseTuner._replace_module has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b56e1a196cb5789f9cdd57b1cbd6d1a5ce104bf8aea6a807912e80cd79590e"}},{"ruleId":"D2","level":"warning","message":{"text":"tuners_utils.replicate_layers (cognitive 19): tuners_utils.replicate_layers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"71143804c3b2421924e5e833f9fae604b03c735ceaf6b18440b8009fac87eb9b"}},{"ruleId":"D2","level":"warning","message":{"text":"waverec2d.waverec2d (cognitive 19): waverec2d.waverec2d has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/waverec2d.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b35a43ec6ecc2154a0af7f9a50eb02f083225975532486a47d314769b9944d1"}},{"ruleId":"D2","level":"warning","message":{"text":"AdamssLayer.update_layer (cognitive 18): AdamssLayer.update_layer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e232309dabf1b059092b2d68d491fda3294199d64f45102b08fcc92575ce77"}},{"ruleId":"D2","level":"warning","message":{"text":"corda.crop_corda_eigens (cognitive 18): corda.crop_corda_eigens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/corda.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"657e8dbb77bcca80bd5cbfc958a5352cac63a913e975e7d044c68cb2a2acb2b8"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraModel._check_new_adapter_config (cognitive 18): LoraModel._check_new_adapter_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (6 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9605430b3645becb169433e54a5db8cab123fafc19c3f3feac35e3079e0e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"MixedModel._replace_module (cognitive 18): MixedModel._replace_module has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/mixed/model.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04bbf9334121f22dcb9b4ad5fe8bd7353370aeb48a0b7c897a2c86a7aa905cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 18): Linear.merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (Conv2d.merge, Embedding.merge) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0183714a4963cb3f177569e70fce9bfebf8870279eb96a541fa2718a835e35a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv2d.merge (cognitive 18): Conv2d.merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (Linear.merge, Embedding.merge) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"90750e4cd9e4bd1bb3d9576cee6d7526ec49bf102f88ce158e52063861525291"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedding.merge (cognitive 18): Embedding.merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (Linear.merge, Conv2d.merge) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d659fd0887f3371def116c05626ae43e05506a9bf761b07bfded42cdeaa518b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowModel._init_shadow_backbone (cognitive 18): ShadowModel._init_shadow_backbone has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/model.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7b1de4f8dc3fdce1c2e43a46f749cebe1247d38ff721850866af5400d8890"}},{"ruleId":"D2","level":"warning","message":{"text":"XLoraEmbeddingLayer.forward (cognitive 18): XLoraEmbeddingLayer.forward has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/layer.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ea74cee86d554a4b826ec85201aa13310df2a308ff7867465717ff840bd419"}},{"ruleId":"D2","level":"warning","message":{"text":"other._get_module_names_tied_with_embedding (cognitive 18): other._get_module_names_tied_with_embedding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a31488c5ed52fa1a59bf8c2338f953535a6e61abd8cc2d5557d7d64fa560fa"}},{"ruleId":"D2","level":"warning","message":{"text":"app.render_card (cognitive 17): app.render_card has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 5, loops 2 (3 pts) (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":"method_comparison/peft-shop/app.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"260f38698b2cda24f101e2567252b983815f6265d678289d2ba1033b092e8a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"app.build_demo (cognitive 17): app.build_demo has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 2 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/peft-shop/app.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32010f25838ae8ba6350c23c1617bc46337f9c4da97e22216eb67f650dc6577"}},{"ruleId":"D2","level":"warning","message":{"text":"_BaseAutoPeftModel.from_pretrained (cognitive 17): _BaseAutoPeftModel.from_pretrained has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/auto.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e287c9fe1ef8c4c2bfc1e627ff73f4a1332c5e607eaf94bf1546c0da8b1601"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModel._reshard_fsdp_modules (cognitive 17): PeftModel._reshard_fsdp_modules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"37761a7eddcf0894a2309661610e7c6fba450417cfc69e972b85a91bec664235"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaLoraModel.resize_state_dict_by_rank_pattern (cognitive 17): AdaLoraModel.resize_state_dict_by_rank_pattern has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (10 pts), if/else 2 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7e296e91677cb7cba807625b64fb3a440e4258da06e8f8c44a4c98b674b27"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear._load_from_state_dict (cognitive 17): Linear._load_from_state_dict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b775f190f7074dde8a9562a3e757f1b583da8b3c3e2cb24e513168323fb143"}},{"ruleId":"D2","level":"warning","message":{"text":"IA3Model.add_weighted_adapter (cognitive 17): IA3Model.add_weighted_adapter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/model.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9280b128fa423e1385acafb2e3bfa4170f9a83d8927c869d3ee54046fe0e03c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedding.update_layer (cognitive 17): Embedding.update_layer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5a8068320fa6838fbd7338940ba29fd2ca283138e2dc5917ac3d4528a476b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedding.merge (cognitive 17): Embedding.merge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0c98f3dcd7633c2f8f0de5cfa93b0ba5c1da3c736df3877a06f78d58a40b98"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedding.forward (cognitive 17): Embedding.forward has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97cceb52736a4730dd90100e3e789d087f831d7d7e28fe8702adadd8b03a062"}},{"ruleId":"D2","level":"warning","message":{"text":"loraga.preprocess_loraga (cognitive 17): loraga.preprocess_loraga has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/loraga.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acd5dacc751a21de7028b2c90cb11a73b782d153b2e1474ce6c3d0c6e1f4053"}},{"ruleId":"D2","level":"warning","message":{"text":"PveraLayer.update_layer (cognitive 17): PveraLayer.update_layer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f785c81a6946bddc2fa820492257d2a09c835aa7347050d94fccb19097864c23"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowModel._seed_shadow_pre_hook (cognitive 17): ShadowModel._seed_shadow_pre_hook has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/model.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a272e97a1d8135c2761066372b730496c8690b70bebe70881bd4c2d2bde3e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner._check_tied_modules (cognitive 17): BaseTuner._check_tied_modules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078c364f50a701e76e90920909b241338d6d43d616ce9a5ec5b6f3eb73e652b"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTuner._get_learnable_bias_state_dict (cognitive 17): BaseTuner._get_learnable_bias_state_dict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3401317656b64883308aaf1a9b72ecbd313949e101ea0a9a061719851feb88e8"}},{"ruleId":"D2","level":"warning","message":{"text":"XLoraClassifier.__init__ (cognitive 17): XLoraClassifier.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/classifier.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fdb628911126e6042326c4074c76d7503f9e143296a8a26ef7585a7e4c60f9"}},{"ruleId":"D2","level":"warning","message":{"text":"hotswap.prepare_model_for_compiled_hotswap (cognitive 17): hotswap.prepare_model_for_compiled_hotswap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/hotswap.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"428563b1bf5f6eaadc7bd2a3eb8ca9435c62c27b939fcdc841f02962bf9abb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.log_results (cognitive 16): utils.log_results has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/image-gen/utils.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b3d78b8313ade35c37e5bb5bb0c41adfd8297a3451b8aa99c90b2c69e3b4e9"}},{"ruleId":"D2","level":"warning","message":{"text":"PeftModelForSeq2SeqLM.generate (cognitive 16): PeftModelForSeq2SeqLM.generate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f210995642c73691b35aae4c9b6b2739ed0d3ed5f968b5e08cef19e59802afd"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv2d.forward (cognitive 16): Conv2d.forward has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2443f73e937f8f5ced1309b59b78b4fed42614ebbf510951e4aac068eba2eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"GloraLayer.merge (cognitive 16): GloraLayer.merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2, ternaries 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb84633ce305665ea2cd725d25d032a343ff22ce875fc8adb7c72472898e7584"}},{"ruleId":"D2","level":"warning","message":{"text":"GloraLayer.unmerge (cognitive 16): GloraLayer.unmerge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 3 (4 pts), ternaries 3, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c879bccf80efa5545396eff6e7d35eccc7e575c350d53e8cc6dfc1d36254f8"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiheadAttention.merge (cognitive 16): MultiheadAttention.merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e9b824458226d089f5c1d8a6d7a911cff93d3d2290c14728e07d7cdc7a28a"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.project_gradient_to_orthogonal_space (cognitive 16): utils.project_gradient_to_orthogonal_space has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/osf/utils.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"43302c357d7f6b86626e5fc1df52182c8466d2b681a4ca7d16fe3580d7c9bdda"}},{"ruleId":"D2","level":"warning","message":{"text":"PolyLayer.reset_poly_parameters (cognitive 16): PolyLayer.reset_poly_parameters has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/poly/layer.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"181ece478bb523e0789151b217e8f06895ee438eb426433f9ea4930e288599ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RandLoraLayer.update_layer (cognitive 16): RandLoraLayer.update_layer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/layer.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aafa2ee04dbdfe3e79b190f53a4477e150eee78f57835392c649e75afd2e327"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 16): Linear.merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/supertuning/layer.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"614de2c8dbd54fd7be9da6fb1fccde0aaf738866e7525167ad919afca9fbef47"}},{"ruleId":"D2","level":"warning","message":{"text":"TinyLoraLayer.delete_adapter (cognitive 16): TinyLoraLayer.delete_adapter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eace66647e0c3425417b40994c9f0fc21cab288eba89d9320343357963c2355"}},{"ruleId":"D2","level":"warning","message":{"text":"Linear.merge (cognitive 16): Linear.merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/unilora/layer.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a3be00aa9a245db9224d26eca7ed12b3e4aeb42fddaf389544e4700b11e1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveFTModel._create_and_replace (cognitive 16): WaveFTModel._create_and_replace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/model.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7141e8abc31cfb0235ca4ade544ab2e3864750070d96d57b43bfb705b005cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"save_and_load.set_base_model_state_dict (cognitive 16): save_and_load.set_base_model_state_dict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"87035285570929608c16b4209437703a8d17f4306292420c06ca1f16775adf0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lora/layer.py: FileTooLong \u2014 1936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1436 over it, 3.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"433b08d7a043ce13d624df45710bd67e3f014f7c40227c506406579f9402f864"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: peft/peft_model.py: FileTooLong \u2014 1854 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1354 over it, 3.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec092682f6dfcc3b0cccf3e0fdbf2ed460f481470cfe6e648d882642964d42b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/other.py: FileTooLong \u2014 1065 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 565 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"230cdecc54d8367551f866c8b6c8a9b0eff1a5b9cd57a9984f67d1b99bb93311"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tuners/tuners_utils.py: FileTooLong \u2014 1036 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 536 over it, 2.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":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"154dee380926687e0c226b06813d88ed52f385639ba6f8c04e19cdd4ddcbf606"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lora/variants.py: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 528 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a06c06b85fac3469241a0ce01a2cdca41929ae5011793626ec2c05931af2f9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseTuner: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"be293a8154aa5375cbf92609c11f878d6da1bf0da94c257dc109c3b550d9e42f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oft/layer.py: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c746084c106f6ba11a31b5bfdc060f863ce7c71610eb42f3941e481b4e0d7a52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: peft-shop/app.py: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 185 over it, 1.37\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":"method_comparison/peft-shop/app.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460896b9b1c16fe2dc554526eb555f28298a4cb4c15fa31782f94797ace0e85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lora/config.py: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3820bc06d8c9b607f39d7d6ec36e0282f966d8bf1f6535d5981f9f020dc3809d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PeftModel: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0754e4ced3513b64c27307b5f31518bc44f4a3c558e35521c06d8c04ad924d4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shadow/model.py: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd0333acdff2ae29b4bd54773baee9c1c7db5aebc87b1fda11e5655eeb6500b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: boft/layer.py: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6716da87aa1fcd5f78f1d81a9c72e837907de0b793f1b2f24cf1aba54a28603f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShadowModel: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/model.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceefdd6d935d65acd4d20182521c886f5c6b28a6506c3d37233132c2de3076ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image-gen/run.py: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 64 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/image-gen/run.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f7de52834c5c1f531c70326d29511e71af104dabffcc5ea51e8be0728e4c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: MetaMathQA/utils.py: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a3904243010ed6702c22fac2d466b4633955bac4f78ab26fd495213facd762"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/save_and_load.py: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4940645de4f15581d1df1edc8f360c2f9c10db46011135a8cf5b9f8e4c3e69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): src/peft/tuners/boft/layer.py:271-375 | src/peft/tuners/boft/layer.py:705-821 \u2014 These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de40eab50912fb43d16bb68cd88fa6e6b6e8ccd5e9c22c7937f4480b02bda4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/peft/tuners/adalora/config.py:71-110 | src/peft/tuners/boft/config.py:152-170 | src/peft/tuners/delora/config.py:144-159 | src/peft/tuners/lily/config.py:224-237 | src/peft/tuners/loha/config.py:133-143 | src/peft/tuners/lokr/config.py:145-155 | src/peft/tuners/oft/config.py:178-196 | src/peft/tuners/paca/config.py:183-207 | src/peft/tuners/peanut/config.py:177-192 | src/peft/tuners/vblora/config.py:186-196 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/config.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc6fc3ce7572f70fcd2e0c797b8e26db4389f62a886310a686020a90c6efdd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/peft/tuners/fourierft/config.py:189-203 | src/peft/tuners/hira/config.py:142-153 | src/peft/tuners/hra/config.py:117-132 | src/peft/tuners/miss/config.py:128-139 | src/peft/tuners/psoft/config.py:262-319 | src/peft/tuners/shadow/config.py:198-223 | src/peft/tuners/waveft/config.py:243-262 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/config.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf980684042a186ba4f1cf4091dd884c99658889d39ab7fb20567c6c0efb12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/peft/peft_model.py:2188-2238 | src/peft/peft_model.py:2370-2444 | src/peft/peft_model.py:2715-2824 | src/peft/peft_model.py:3026-3077 | src/peft/peft_model.py:3258-3312 | src/peft/peft_model.py:3440-3485 \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":"src/peft/peft_model.py"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ea11b6c80e5705bdfa8ebb9fc2d0ccc5c42bc1187d399bac66e6982bc8bfed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/peft/tuners/adalora/layer.py:120-154 | src/peft/tuners/adalora/layer.py:259-290 | src/peft/tuners/lycoris_utils.py:115-147 | src/peft/tuners/pvera/layer.py:196-231 | src/peft/tuners/unilora/layer.py:174-195 | src/peft/tuners/vblora/layer.py:138-170 \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":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5926d039d4f36dfe3dae48e5a4876c1f1500aaeb293a5d72bec00b55271004"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/peft/tuners/fourierft/model.py:91-118 | src/peft/tuners/frod/model.py:282-318 | src/peft/tuners/gralora/model.py:93-125 | src/peft/tuners/randlora/model.py:345-425 | src/peft/tuners/vblora/model.py:123-156 | src/peft/tuners/waveft/model.py:140-167 \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":"src/peft/tuners/fourierft/model.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afafdfdd56a09ba55157406e6ecebcdb001c74de791a61a9f4eabf71464423a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/peft/tuners/gralora/layer.py:35-64 | src/peft/tuners/pvera/layer.py:36-68 | src/peft/tuners/randlora/layer.py:57-88 | src/peft/tuners/vblora/layer.py:36-59 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/layer.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab6de547fd8ffd5f7fd4c4d0ecab55e1de1fb7c87eac2d89713a5ddb3347bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/peft/tuners/hira/model.py:164-187 | src/peft/tuners/lora/model.py:464-487 | src/peft/tuners/mixed/model.py:117-156 | src/peft/tuners/tuners_utils.py:1324-1383 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a94483a22989c1041addabad53c48ea5fb062cd8bbf46191b3c1c5841c9c578"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/peft/tuners/lora/layer.py:232-342 | src/peft/tuners/lora/layer.py:1321-1415 | src/peft/tuners/lora/layer.py:1720-1794 | src/peft/tuners/lora/layer.py:2577-2659 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e209a76119fcb319c1ef130d61c16e1d1904ee92f66fbca75c7a6d396e8b2fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): src/peft/tuners/lora/astra.py:155-232 | src/peft/tuners/lora/corda.py:162-233 \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":"src/peft/tuners/lora/astra.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa2bec4fdce6145d49dc470d46da2a79ff7e84adf93c730de7ae97dacdfa4e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): src/peft/tuners/boft/layer.py:615-671 | src/peft/tuners/boft/layer.py:952-1020 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"416aa2c220ed4b5c816177d4d9f3593967b3a58bf03cbc39652e328cb549f15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 59\u002B corresponding lines): src/peft/tuners/pvera/layer.py:83-151 | src/peft/tuners/randlora/layer.py:104-174 | src/peft/tuners/vera/layer.py:75-133 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 59 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38cf07c344682c1439b0c089b469ff941f71da90bcbbd8516513bb4bcb092cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): src/peft/tuners/lora/layer.py:537-618 | src/peft/tuners/lora/layer.py:621-687 \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":"src/peft/tuners/lora/layer.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dc38229033b08c4aa6ae37fed80f3850d48a0c28d1167a231425472669c9b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): src/peft/tuners/lora/layer.py:1055-1121 | src/peft/tuners/lora/layer.py:1800-1871 \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":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"633ad0a90ec5592d20cc5655dca88d4401bf7349e416445a311e972b483ca54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): src/peft/tuners/lora/astra.py:68-144 | src/peft/tuners/lora/corda.py:63-151 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee36993d312a127b482b0ebf99448e236e1dcf4fa6c62c3790e85a35153ea24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/peft/tuners/ia3/layer.py:97-147 | src/peft/tuners/ia3/layer.py:250-300 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0ddf9acd1bfaacc51cd3b659edffe0ad83ab50a70f50659108bb7f45cdf16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): src/peft/tuners/adamss/layer.py:539-609 | src/peft/tuners/adamss/layer.py:612-665 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e2ecd1fd90890acfb53d014bd3edece1725a39c6f39abe48e80841107ed28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): src/peft/tuners/boft/layer.py:824-884 | src/peft/tuners/hra/layer.py:321-381 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"d490c9fc4a22696cee57470a350c20a048626de0c9919fb8e53395981d2e3445"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/peft/tuners/glora/layer.py:326-350 | src/peft/tuners/glora/layer.py:353-390 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0297cb8d36e2e7cd41fb536c6aa5245a22e45e02fd8008314229e4a2164e76f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/peft/tuners/oft/layer.py:674-747 | src/peft/tuners/oft/layer.py:929-979 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"3246ea76799a0bc3b12c26bfe189ee9c16322e0a3046937a9701e46d8bda826a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/peft/tuners/adalora/layer.py:52-90 | src/peft/tuners/adalora/layer.py:222-256 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e8d36610443a9ce67aca56ae95363ffe0070525a77f37f1b6d121c9a34b54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): method_comparison/MetaMathQA/utils.py:668-749 | method_comparison/image-gen/utils.py:537-615 \u2014 These two members are one piece of code written twice and then edited apart: 79 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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd413e9245021dee3adc828381195a9145efee28a36866b055f276736bc24ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): src/peft/tuners/adalora/model.py:162-227 | src/peft/tuners/pvera/model.py:194-259 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3fdebb7898b3e6dee3181c5b1fbadd86350997e6c4075fe13f577477f703bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): method_comparison/MetaMathQA/utils.py:118-143 | method_comparison/image-gen/utils.py:143-162 \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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e946cc7acf5f7401662b44b31683ac7ea5d3514be0799472509081adf1f92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/peft/tuners/pvera/layer.py:288-320 | src/peft/tuners/vera/layer.py:254-289 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7a20958580a4c41fdca2ab86d594380b89cbc6aa052b6a39abad33c2c67c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/peft/tuners/lora/layer.py:502-534 | src/peft/tuners/lora/layer.py:1418-1445 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f0c0e214d1843c118b9fa077c546d1d9617d60d8f67aa01bc5fcd22de2c360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/peft/tuners/fourierft/layer.py:58-87 | src/peft/tuners/waveft/layer.py:74-117 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/layer.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e693b58da84c3c721506a4d0f49abc6be1041c7d825a8381509f426f018dd69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/peft/tuners/hira/layer.py:642-685 | src/peft/tuners/lora/layer.py:2898-2933 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe452203506212fd034c84b051aba997b1b52ab940b473276da276c21884b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/peft/tuners/boft/layer.py:562-591 | src/peft/tuners/boft/layer.py:919-949 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f6ed29ca4679ba9a894f9e0b11a09d0870e585ba10199e03a59c2d2cabb0e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/peft/tuners/pvera/layer.py:244-285 | src/peft/tuners/vera/layer.py:215-251 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2864e685d202b2e6b78fe2fa941407ec19cc665e2bcc08c6a8ab86a1d434d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/peft/tuners/hira/layer.py:534-571 | src/peft/tuners/lora/layer.py:1896-1932 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41883bf96938e82b79be05aafd6b65b9f232043693a5e50468a92fccc5dc1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/peft/tuners/pvera/model.py:71-105 | src/peft/tuners/randlora/model.py:102-136 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de560248749aea32801e86b6f9a637bcc2439885a4d1e562d4b2ed9f5e23e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/peft/tuners/lora/te.py:85-110 | src/peft/tuners/lora/tp_layer.py:194-221 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/te.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fcdb0bd25b5079b9281f4ecf11615b995a07d176384bdb4e594e8f5374cfd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/peft/tuners/tinylora/layer.py:380-421 | src/peft/tuners/tinylora/layer.py:567-610 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"481c8f9f9758863f36c5cffa67abd674b34bab62ef54ecf4abded6676e44c2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/peft/tuners/tinylora/layer.py:192-232 | src/peft/tuners/tinylora/layer.py:496-526 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aede408d6f14521a0a0604f5d46f0df6627843535c21aca76b0d0304f51b823"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 46\u002B corresponding lines): src/peft/tuners/boft/layer.py:493-538 | src/peft/tuners/oft/layer.py:490-538 | src/peft/tuners/oft/layer.py:750-803 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 46 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac930fee0575ca1182b06895d08b298f60957c1a4321117a0d0e17a8e1d8d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/peft/tuners/ia3/layer.py:173-199 | src/peft/tuners/ia3/layer.py:326-353 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7e065ab08ba44be5bba1805e0b21b13e0266bf5cdf6ade82e450098ccfe1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/peft/tuners/ia3/layer.py:150-170 | src/peft/tuners/ia3/layer.py:303-323 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d76d83a7fe925862af41cf27bad1721f837998b6ae21440199c621572e38d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/peft/tuners/adalora/layer.py:176-197 | src/peft/tuners/adalora/layer.py:314-338 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"159a700d86e3eb86a2445f8e003d3ff9d606fde7270bd84f945ca36eef8fcf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/peft/tuners/lily/layer.py:35-63 | src/peft/tuners/peanut/layer.py:35-65 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/layer.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8594a7088b4b39488c48e1c9311cda3030a677ce2bf7ca2c8e8084d09f40d64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): src/peft/tuners/hira/layer.py:250-277 | src/peft/tuners/hira/layer.py:574-602 | src/peft/tuners/psoft/layer.py:453-488 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f39c60a5350e736e58ac5e10cfe41bb361ef91e6dfedfd417a645c93be010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/peft/tuners/glora/model.py:88-115 | src/peft/tuners/road/model.py:120-153 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/model.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8255d9580fd8d0f74f3e9c5a165bafe46bd71693fddf9d5eefd667a34c16dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/peft/tuners/boft/layer.py:887-916 | src/peft/tuners/hra/layer.py:384-406 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"674a0db274006de7ac323499c335d70f6162e8530e5b90cf7886772828d65163"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/peft/tuners/lora/layer.py:2308-2340 | src/peft/tuners/lora/tp_layer.py:278-310 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c8428e3db3d01d1e9daef2db097dcbce8cc36006377eb416559f8869447cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/peft/tuners/oft/layer.py:541-563 | src/peft/tuners/oft/layer.py:806-831 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dc67f0c8276241d02cfa37402352efab17812b370d0d560e4f5fd2aca3bd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/peft/tuners/tinylora/layer.py:151-189 | src/peft/tuners/tinylora/layer.py:461-493 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc404309744c999ecba9ab51b01c12a083260c4aecd0904139c03171d8d0fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/peft/tuners/boft/layer.py:159-193 | src/peft/tuners/oft/layer.py:45-70 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ac741e77350a4a266e72ce3154d774807f77437178eaab3fef5b66b78a7c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/peft/tuners/randlora/layer.py:328-346 | src/peft/tuners/unilora/layer.py:236-256 | src/peft/tuners/vblora/layer.py:236-253 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/layer.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bd148cd4fa25658cf651c429a519caabe697810e8357936779228c34d65ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/peft/tuners/loha/layer.py:222-245 | src/peft/tuners/lokr/layer.py:290-313 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f82d905c6f3e97f6f68dbc6bd4bf2762a823133ed2b22011dda5dff2e950735"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/peft/tuners/deft/layer.py:45-78 | src/peft/tuners/fourierft/layer.py:36-55 | src/peft/tuners/waveft/layer.py:45-66 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/deft/layer.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d74f81da49c01827a1516a7070fde10139d07825c5fc2179519efabd7440fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): method_comparison/MetaMathQA/utils.py:372-391 | method_comparison/image-gen/utils.py:325-344 \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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d86f62dc8a9122d3740cc9a5b377b95af79446d434b6283ccf1137932af6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/peft/helpers.py:484-501 | src/peft/helpers.py:506-523 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/helpers.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"18de6998f5112baef50a58b912074b5da11633ed9920d9d9db96df1571881481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/peft/tuners/fourierft/layer.py:172-191 | src/peft/tuners/waveft/layer.py:270-289 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/layer.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcbd22e24f7db600b7ea3a77badb4da54af53d872c3de4aaa16330e6ec8a7fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/peft/tuners/delora/layer.py:174-212 | src/peft/tuners/peanut/layer.py:168-196 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/delora/layer.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dac007e3f274f13ee719eca7c32f2dbad3c1e7bf1698adb198c5410a777139c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/peft/tuners/fourierft/layer.py:121-155 | src/peft/tuners/waveft/layer.py:219-253 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/layer.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec39e42b04e0f01c7711dc0b2b43018eec9fb289cf752a2ee58efa53271a4fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/peft/tuners/hira/layer.py:218-247 | src/peft/tuners/hira/layer.py:354-384 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47202143af7de60e3ef02dfc6cf5566873743c02e7aa650db7f29d57aeb8a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): src/peft/tuners/boft/layer.py:207-239 | src/peft/tuners/miss/layer.py:37-57 | src/peft/tuners/vera/layer.py:36-63 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce12b91c2530d1067362218bbdacc2ddfd27792cd268bc2386ab5576509d7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): method_comparison/MetaMathQA/utils.py:288-308 | method_comparison/image-gen/utils.py:277-295 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fec5629f45a98b460c98078662e6c819e597d5a96b77fb44a6bc61cf78f72a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): src/peft/tuners/adalora/gptq.py:40-67 | src/peft/tuners/lora/aqlm.py:59-82 | src/peft/tuners/lora/awq.py:58-81 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/gptq.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5afda944759a62193326739f25f2e3b08963fc0999eb1854a50b951de17f5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/peft/tuners/tinylora/layer.py:330-365 | src/peft/tuners/tinylora/layer.py:529-552 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"684e22329cccd088c5771cce25682c43138545c9d7896d60b39a140ccad8e8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/peft/tuners/loha/layer.py:79-86 | src/peft/tuners/loha/layer.py:94-101 | src/peft/tuners/lokr/layer.py:112-125 | src/peft/tuners/lokr/layer.py:145-158 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"935b3e2aae032ce5a4b6d087e3fb2dcf207a93afce13d4730c3442dc5a88e1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/peft/tuners/deft/model.py:83-109 | src/peft/tuners/tinylora/model.py:220-270 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/deft/model.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085ed48f7b792f3138e34d3b69456df4634ef5c460ebc07a68544a18f096474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 36\u002B corresponding lines): src/peft/tuners/c3a/layer.py:131-168 | src/peft/tuners/hra/layer.py:215-253 | src/peft/tuners/lora/tp_layer.py:224-261 | src/peft/tuners/osf/layer.py:241-276 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 36 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/layer.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"53150965b1d7016a2de9fe5190bc7d89555af7ea0587f7c21c48e8b2b7b5aa35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/peft/tuners/shira/layer.py:160-197 | src/peft/tuners/vera/layer.py:165-200 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shira/layer.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"091408948b9d417df0c4f1c24f733356a455b4a8b9b571bfdab735268a43a3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/peft/tuners/hira/layer.py:399-432 | src/peft/tuners/oft/layer.py:1093-1110 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"991cb2bbc23b990f9b4e5b4b42b0ea7a418dcf4898f4a5eefc6d220863bf0a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/peft/tuners/lora/layer.py:2804-2832 | src/peft/tuners/psoft/layer.py:398-425 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"6917c4d15f4abcd29c936d249ba74ab6a42afbb632e45d03226dacae599c1aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/peft/tuners/c3a/model.py:62-84 | src/peft/tuners/delora/model.py:71-92 | src/peft/tuners/fourierft/model.py:66-87 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/model.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2aca06f38bdd732b86decdbb9c6ae4423099f61bc5a3ac14bb89364e5c3fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/peft/tuners/hira/model.py:132-161 | src/peft/tuners/road/model.py:53-79 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ba90b14c328c4683f28c9c01e5c070640605cb9bdd189749bbef18a9881a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/peft/tuners/paca/layer.py:182-201 | src/peft/tuners/shira/layer.py:59-77 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/paca/layer.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a588983a9833c063e57583f39dee35209938f38dc7a8fab3dec299dd681604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): src/peft/tuners/lora/layer.py:1147-1175 | src/peft/tuners/lora/layer.py:1510-1538 | src/peft/tuners/lora/variants.py:1040-1062 | src/peft/tuners/lora/variants.py:1490-1512 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"550388618f25f93bed0ff217c68bfd2a50d511dbecdb78b7244cf22b5f3cbfa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 27\u002B corresponding lines): src/peft/tuners/pvera/model.py:162-189 | src/peft/tuners/randlora/model.py:313-340 | src/peft/tuners/unilora/model.py:177-204 | src/peft/tuners/vblora/model.py:90-119 | src/peft/tuners/vera/model.py:202-228 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb24f414919dc68d07e7f374bbc2da7f099cafe1b179f55c4dd8373dfb68886"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/peft/tuners/pvera/model.py:108-120 | src/peft/tuners/vera/model.py:148-160 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"788576347dfb839791583843b6de2ac7e5eb746c1a89d6eac356f8cb3b83bdbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/peft/tuners/pvera/model.py:263-278 | src/peft/tuners/vera/model.py:272-287 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f7fabad01d4b10a4f2731071e8043a0c2d47c4827a7bfd53cb71c7867ab1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): src/peft/tuners/lora/model.py:1240-1290 | src/peft/tuners/lora/model.py:1293-1342 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2867922a22a31c5aece7e36a81ceeab90ee6354a3c9ad939f90d3ecf6774158a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/peft/tuners/randlora/model.py:218-242 | src/peft/tuners/vera/model.py:166-190 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/model.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5843d216fa32274aab5685ef6ecdc9cdfc5406d50148b64e64317f85c45c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 19\u002B corresponding lines): src/peft/tuners/lora/variants.py:169-192 | src/peft/tuners/lora/variants.py:196-214 | src/peft/tuners/lora/variants.py:276-299 | src/peft/tuners/lora/variants.py:303-321 | src/peft/tuners/lora/variants.py:381-403 | src/peft/tuners/lora/variants.py:407-425 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5491ffedd00e000f6c52303a9f1c2cffb48a23a53e066ea45163fed030f7614"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/peft/tuners/hira/model.py:193-225 | src/peft/tuners/road/model.py:83-115 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77958042e59b71ee5fa67eaca891a5d02d1b7941fed8d53545f077997a3fbec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/peft/utils/other.py:744-766 | src/peft/utils/other.py:1036-1059 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d84060059dc45d1ed548feaa1dd9e9eb19a17b9e7ec17dc2164554115a6b7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/peft/tuners/lora/aqlm.py:40-55 | src/peft/tuners/lora/awq.py:36-55 | src/peft/tuners/lora/te.py:49-66 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/aqlm.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef1b254cb28bdf7f9e00dcf82bbc199e34c80895c3434d63478d07dbfba9e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/peft/tuners/loha/model.py:103-117 | src/peft/tuners/lokr/model.py:104-118 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/model.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"348facfb9d77004cc6753cdf973197b1335318290a1231f6fcdb8b1aa7e8c5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): method_comparison/MetaMathQA/utils.py:358-366 | method_comparison/image-gen/utils.py:299-311 \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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"22be84c21e3d47d5740475fa2a9191a894e2d5a812e031f8ef741ca13f9eabd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/peft/peft_model.py:2112-2132 | src/peft/peft_model.py:2953-2969 | src/peft/peft_model.py:3180-3197 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef34aa2d449091c3fe1453bc1621059563e2d6b6be6d9e952c52c0ce66b01a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/peft/mixed_model.py:35-57 | src/peft/peft_model.py:770-783 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd81892b2b3cfe51c60beae1485d93f881980bb3a5ce8e2792646bb80864c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/peft/helpers.py:36-66 | src/peft/helpers.py:70-107 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/helpers.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c48fb614b2d4f070252e50f575324734ef56fdd32fde6d7bbdacdd2dfbe6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/peft/tuners/lora/layer.py:2282-2305 | src/peft/tuners/lora/layer.py:2401-2410 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16577bbd156e0bdaf334f443fe00b437767ac42abc5bfb1b737d88807a633d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/peft/tuners/lora/variants.py:261-272 | src/peft/tuners/lora/variants.py:369-377 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce6350d26715fd7e5330befdab65611e1e80f774f836d3052d904eecd0ec099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): method_comparison/text_generation_benchmark/run.py:47-56 | method_comparison/text_generation_benchmark/run_base.py:126-137 \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":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"25594308f4d840690cdfd6445cde6eab2739fbce470e30402c9478f8eef8b046"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/peft/tuners/boft/model.py:36-44 | src/peft/tuners/oft/model.py:31-41 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/model.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eb06bfab325d26b694379c192d950228507428b96fca5dc61e8c3017bebae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): src/peft/tuners/boft/model.py:102-118 | src/peft/tuners/deft/model.py:64-79 | src/peft/tuners/hra/model.py:88-103 | src/peft/tuners/oft/model.py:110-131 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/model.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3dc46618fa57170d3fcdf6f89e1a21a4b3888e914bda14cf74190391530941"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/peft/tuners/glora/model.py:53-64 | src/peft/tuners/lily/model.py:63-80 | src/peft/tuners/peanut/model.py:61-74 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/model.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcab384faef91edd09d99bd5e01b7b3402c57cb473f5ece8a6360d1f174b13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/peft/tuners/ia3/layer.py:57-70 | src/peft/tuners/ia3/layer.py:220-231 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"710e996b10dfb84652bf25c1a02fbbf2bd33c5e9c92fda475147719d3bb815ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): method_comparison/MetaMathQA/data.py:93-99 | method_comparison/MetaMathQA/data.py:103-109 \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":"method_comparison/MetaMathQA/data.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"01227f6f142547657f9b1cecba98a812fae26c55562a3ae4f52cbde5a1e6973a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/peft/tuners/beft/layer.py:31-43 | src/peft/tuners/c3a/layer.py:36-48 | src/peft/tuners/road/layer.py:57-72 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/layer.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c74c00eb6c57435f4c38e2aa95dc8ce38aa3f386ba416a14735020d3529bfde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/peft/tuners/lora/intruders.py:21-26 | src/peft/tuners/lora/intruders.py:31-36 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/intruders.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea187794de3eb3130bd247a9db23e4bd116dababecfc2bd95aef635adedae7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/peft/mixed_model.py:273-300 | src/peft/mixed_model.py:303-312 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c06ac9d23fb3dd3602b94320acfb4bbcf19a0d5e7544c521656d24d0ccf2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/peft/tuners/fourierft/layer.py:158-169 | src/peft/tuners/waveft/layer.py:256-267 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/layer.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"23afffaf09d0d2599eff8d8834c243cde2bb391acb7252295b4ba770f5f98a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/peft/tuners/frod/config.py:183-192 | src/peft/tuners/gralora/config.py:177-187 | src/peft/tuners/road/config.py:118-126 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/config.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"958df7d2c0264932f5adcbcd8835ebc2fd6dcd1ac31bb5bba3d2b214f05ac9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/peft/tuners/unilora/layer.py:225-233 | src/peft/tuners/vblora/layer.py:218-233 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/unilora/layer.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab688ded8e7b915c4f0bec3c820f8eb2ebc8cfb8d4af535d9e1ae65056c9934a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/peft/tuners/lora/layer.py:2836-2845 | src/peft/tuners/lora/tp_layer.py:264-275 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc549a830388a19459c388bc950ad1f981a06e7770270e5c762f5d766f242915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/peft/tuners/shira/layer.py:200-209 | src/peft/tuners/vera/layer.py:203-212 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shira/layer.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94836baf930432bebb42de4c50a0a286d6b72321c7467c99d2068decaeca172"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/peft/tuners/beft/model.py:90-102 | src/peft/tuners/gralora/model.py:73-89 | src/peft/tuners/ia3/model.py:163-181 | src/peft/tuners/supertuning/model.py:105-117 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/model.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d4213a3e0d9c9918cbd9f5c0ebee2fd4aba9ba876c5fbbb8ee378192efe7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/peft/tuners/adamss/model.py:134-155 | src/peft/tuners/c3a/model.py:88-100 | src/peft/tuners/delora/model.py:96-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/model.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"839219b2be68692b868ef35d04fef573be8cb7a5706e8fb57afbc80e06d8891d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/peft/tuners/lora/variants.py:218-225 | src/peft/tuners/lora/variants.py:325-331 | src/peft/tuners/lora/variants.py:429-435 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc676f53224867d1fc5ab483ec1c3a5f2d6ecb556b20c2868e9980cd8b62715"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/peft/tuners/tuners_utils.py:2075-2091 | src/peft/utils/other.py:569-585 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"15447c8541a96ea8f52a93bd61fcef337b1ba19cad162d3481c4566bacd25070"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): src/peft/tuners/c3a/layer.py:171-180 | src/peft/tuners/delora/layer.py:215-224 | src/peft/tuners/pvera/layer.py:234-241 | src/peft/tuners/unilora/layer.py:198-205 | src/peft/tuners/vblora/layer.py:173-180 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/layer.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0325f70749ad52f85be5be7203c6d7f475a45d8a6a5fa16eb8647e647112e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/peft/tuners/pvera/config.py:189-202 | src/peft/tuners/shira/config.py:117-129 | src/peft/tuners/vera/config.py:149-162 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/config.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d5e05bd4c204f4b49a952b8dfff043e2622db447db070357e99357741d89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/peft/tuners/tuners_utils.py:2224-2245 | src/peft/utils/other.py:616-635 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c69e7d27d653d16c8fdf06ee1ec6208bf1a3ffdeb3f955f67ba37e31c8451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/triage_prs.py:80-93 | src/peft/utils/other.py:1584-1596 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/triage_prs.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e458777d22a4eb8f5cf21db3890fd04aa86cf6b43479be06eaf651a6af78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/peft/tuners/frod/layer.py:222-229 | src/peft/tuners/hira/layer.py:111-119 | src/peft/tuners/peanut/layer.py:199-208 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f8108133de8fbb790321485bd80897331ff45d2fdd93b795e3eaa5b6a1675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/peft/tuners/lora/eva.py:62-74 | src/peft/tuners/lora/eva.py:258-282 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/eva.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1403659d34c8a42297af7d84a11b5bf5f9b4249298be53bc1c150bd5d135a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/peft/tuners/lora/astra.py:237-244 | src/peft/tuners/lora/corda.py:242-249 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f1823ed15587f248ad5e290bf3f7b02fa8071639e491b28885b3d8a0e05c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/peft/config.py:330-342 | src/peft/peft_model.py:1409-1419 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/config.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a45b9af862ca8a45c73e85945fede6f01a122f9685a747abe938a10569761d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): src/peft/tuners/frod/layer.py:154-157 | src/peft/tuners/hira/layer.py:84-87 | src/peft/tuners/peanut/layer.py:111-114 \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":"src/peft/tuners/frod/layer.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69551544c311691a24f1a2d49e11c880e24b402d8d7642add6114da85219fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/peft/tuners/lora/gptq.py:120-134 | src/peft/tuners/lora/awq.py:94-105 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/gptq.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ff4816db1d51f1550ec1310a698db00e9e7a8d927ae9bd84131b1b4b49a717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/peft/tuners/paca/layer.py:278-284 | src/peft/tuners/shira/layer.py:150-157 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/paca/layer.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"326610a6bfa115ea5a6917912611f1c422bc48f02831f1882c68fdb4bfd2446a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/peft/tuners/shira/model.py:34-40 | src/peft/tuners/vera/model.py:40-46 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shira/model.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"03903f1424aee7e23e035a7c9e813b229210d5fd354b63e3b564bb91383104ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/peft/tuners/mixed/model.py:207-214 | src/peft/tuners/tuners_utils.py:2765-2786 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/mixed/model.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bc97cf21d7672ae9d4b857baa69c66e78cb56187f0a3f18db83611b8c0810c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/peft/utils/merge_utils.py:191-214 | src/peft/utils/merge_utils.py:218-236 | src/peft/utils/merge_utils.py:245-268 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/merge_utils.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"093f0be817898f5e06480018f3316e5626aaee4f598ef8c25b4a7475af7f0b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): src/peft/tuners/gralora/layer.py:172-177 | src/peft/tuners/tinylora/layer.py:314-327 | src/peft/tuners/vblora/layer.py:130-135 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/layer.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c751ccb4851b3f17f7a4a3898cea0704ff48f7b0e3a06fe5e92209b47be7fbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): method_comparison/MetaMathQA/utils.py:532-537 | method_comparison/image-gen/utils.py:364-368 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8548206881fe8f489519812e4e165506db653d3e8c127c63471c937b1835048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/peft/tuners/peanut/model.py:98-106 | src/peft/tuners/shadow/model.py:253-264 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/peanut/model.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"017080ba182fb7afbd091466630d5102ecc5a31717a8b9cde6b77a7d72e59206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/peft/tuners/pvera/layer.py:154-157 | src/peft/tuners/vera/layer.py:136-139 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b50f6a9b4ee6af2f805a5f0db73d4434a4140e737091b825a12f1c52bed11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): src/peft/tuners/hira/layer.py:184-190 | src/peft/tuners/oft/layer.py:476-487 | src/peft/tuners/unilora/layer.py:160-165 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c163811d1189186e72fcf88e000498bc37657d3cf77cdae5a925f3a446085b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/peft/tuners/hira/layer.py:449-455 | src/peft/tuners/ia3/layer.py:211-217 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"05255e07435b4f1a4598fb2d39f76fc0ef001c7fb8a8bb83fe08b0c36161afe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/peft/tuners/boft/layer.py:483-490 | src/peft/tuners/psoft/layer.py:359-364 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1d104aaaf20926ec092adcd01e2d8526b61d077ea1b6d4c438f12e10fa81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/peft/tuners/hira/layer.py:630-633 | src/peft/tuners/lora/layer.py:2019-2022 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6c8d288d1b7d994f4aa39df8442481ec2d9a2dd58c858f5c8c83ad378dda7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/peft/mixed_model.py:155-172 | src/peft/peft_model.py:1004-1018 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e4825cfbd7df10483bd60755286509b117452bb2a3c4d310bd6a84da84be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/peft/tuners/hira/layer.py:295-300 | src/peft/tuners/oft/layer.py:653-664 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"129bf05fd9f990860d9bc65df4f4ee864ad8a7d092bb720c5b107848de796352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/peft/tuners/delora/layer.py:168-171 | src/peft/tuners/tinylora/layer.py:440-450 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/delora/layer.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5495979be30aa02e3f9edb5084bbe8898e1f9685c0274a6485c57ada9ff3ed5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): src/peft/tuners/c3a/layer.py:125-128 | src/peft/tuners/deft/layer.py:189-192 | src/peft/tuners/hra/layer.py:209-212 | src/peft/tuners/lily/layer.py:121-132 | src/peft/tuners/miss/layer.py:161-164 | src/peft/tuners/peanut/layer.py:127-132 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/layer.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4065d7e975f680511760e6abf91ad6b9ca873c038d89a06ca3c864c3a5ad2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): src/peft/tuners/hira/layer.py:612-615 | src/peft/tuners/ia3/layer.py:360-362 | src/peft/tuners/lora/layer.py:1983-1986 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"276bef83133375ab4c1288ca1bb47a8c3802bc84dc07ffadfa10a37fbd00590e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): src/peft/tuners/hira/layer.py:621-624 | src/peft/tuners/ia3/layer.py:368-370 | src/peft/tuners/lora/layer.py:2001-2004 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"117e4866f6c7644b434dcde07da4d7586d5ff6c2c92a2d673b61d2b4609ed76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/peft/tuners/beft/layer.py:75-78 | src/peft/tuners/boft/layer.py:693-697 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/layer.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"40db1caf0224ce8dba6d88a831b15747977664c1e9f399db981b19d52666a354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201358 lines \u00D7 2): src/peft/tuners/adamss/layer.py:539-596 | src/peft/tuners/adamss/layer.py:612-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd789c08a745562987013115df3236914e8932e2538e943d5f9f3c3a28483900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201356 lines \u00D7 2): src/peft/tuners/lora/astra.py:174-229 | src/peft/tuners/lora/corda.py:177-231 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/astra.py\u0060 and \u0060src/peft/tuners/lora/corda.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a61fdcc2360690e26ba8ea807e8d8903a6e7a559e7f02773c7cae962a8519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): src/peft/tuners/lora/layer.py:1080-1121 | src/peft/tuners/lora/layer.py:1830-1871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c34f4c74b454cf57fcfe7c11dd9d4fba0131c64a603d37cb5e9ef3a7dbc1ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): method_comparison/image-gen/evaluate.py:104-142 | method_comparison/image-gen/run.py:541-581 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060method_comparison/image-gen/run.py:583\u0060 calls \u0060perf_counter\u0060 and \u0060method_comparison/image-gen/evaluate.py:144\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/image-gen/evaluate.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2fc4001a038c5522171520e4bc3f8f9fddeea7a3965a1d4da615ec0db86aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): src/peft/tuners/xlora/layer.py:103-139 | src/peft/tuners/xlora/layer.py:213-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/layer.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ef4816a9ead2673823c853553b94576c6ca7fada407e0892644ae69d9c47a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201333 lines \u00D7 2): src/peft/tuners/adalora/layer.py:120-152 | src/peft/tuners/adalora/layer.py:259-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8b60fc144cc430525d0220a2da17fffc2183b6f64619134d04b1cbdc11733d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/peft/tuners/boft/layer.py:271-301 | src/peft/tuners/boft/layer.py:705-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8e3ddfced8ffe751f7e1f96f20e4eae6721a606b5ceee2f14fa46abbc538c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 3): src/peft/peft_model.py:2206-2234 | src/peft/peft_model.py:3045-3073 | src/peft/peft_model.py:3279-3308 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd46ffc0ed1718b9a2d3f2415e894c08a3db71cfdc84237b6c12ccba54dc93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): src/peft/tuners/hira/model.py:193-221 | src/peft/tuners/road/model.py:83-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/hira/model.py:193\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6cac601e5d0ac7f72a4caba72a23bd68df658f8251b8cc320ee39c8bd838c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/peft/tuners/pvera/model.py:76-105 | src/peft/tuners/randlora/model.py:107-136 \u2014 \u0060src/peft/tuners/pvera/model.py\u0060 and \u0060src/peft/tuners/randlora/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd02c1c9824e5c740e6fbebaace8ae7a6a8c9b6077cffa646c752a037a33ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201329 lines \u00D7 2): src/peft/tuners/oft/layer.py:343-371 | src/peft/tuners/oft/layer.py:674-691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"583e98dffb7d22b61e76eb202ce8425d544c9a5904a1604b713032131b8a2c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201327 lines \u00D7 2): src/peft/tuners/tinylora/layer.py:330-356 | src/peft/tuners/tinylora/layer.py:529-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/tinylora/layer.py:330\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1712c20eaced34f9edc20e39b58b0cfeeb800ab6192ef3223363154a50e92b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/peft/utils/transformers_weight_conversion.py:256-282 | src/peft/utils/transformers_weight_conversion.py:298-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117a285602463910318c50a239f7bd84b16b8819ed8dcd708f49c8f55000ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/peft/tuners/boft/layer.py:632-657 | src/peft/tuners/boft/layer.py:973-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"00193155474f9062aa2e5205cbc420f03a13ea9c03ca9a0c8cce6049011a9366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/peft/tuners/oft/layer.py:566-591 | src/peft/tuners/oft/layer.py:834-859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/oft/layer.py:829\u0060 calls \u0060view\u0060 and \u0060src/peft/tuners/oft/layer.py:561\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c5f217c08c0bc6d5f8e46f57e3c8c9d6f288be91bd2672aac99a6550b2092f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201325 lines \u00D7 2): src/peft/optimizers/lorafa.py:186-197 | src/peft/optimizers/lorafa.py:207-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abfb43ef9d2d3c3511275df1426fc649d357b83846fe7f0fc299878ad0a37f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/peft/tuners/hra/layer.py:215-239 | src/peft/tuners/hra/layer.py:321-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/layer.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8729ebf112da47f7c85a9a9d132e239ee5ce11b3f4af4962e1512eff84117cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 5): src/peft/tuners/fourierft/model.py:91-114 | src/peft/tuners/frod/model.py:284-307 | src/peft/tuners/gralora/model.py:93-116 | src/peft/tuners/vblora/model.py:123-146 | src/peft/tuners/waveft/model.py:140-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/model.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"93acd3bed526d80206acdc29a6d0153d247e54032dbb91dbdc92ef9911000835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): method_comparison/app.py:75-98 | method_comparison/app_embed.py:94-116 \u2014 before extracting anything, compare \u0060method_comparison/app.py\u0060 and \u0060method_comparison/app_embed.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/app.py:75\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":"method_comparison/app.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bb087b114749d45ebfbb443a5d9146df8e397ad751fab3acf0ef538116b5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): src/peft/tuners/tinylora/layer.py:209-232 | src/peft/tuners/tinylora/layer.py:507-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/tinylora/layer.py:207\u0060 calls \u0060transpose\u0060 and \u0060src/peft/tuners/tinylora/layer.py:505\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dade2b27ed2ec6d0aca41b0d17d0e26e7a5038486c0e0662d97712423068dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 2): src/peft/peft_model.py:2743-2765 | src/peft/peft_model.py:3461-3477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/peft_model.py:2743\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f3f5b9bf7fbdfc166bbc41727b65203be833b5d17ba89dee927437bb7bfcdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/peft/utils/hotswap.py:132-153 | src/peft/utils/hotswap.py:250-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/utils/hotswap.py:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/hotswap.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"710188e9ef15c17a2811425ff9e1c21b6c59d2f0faaf3bb0057917b85e2a8d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/peft/peft_model.py:2251-2272 | src/peft/peft_model.py:3090-3111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8bd5f118a224e499752de63d8d69b95edc5bb25744a2598a608c44e62824b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/peft/tuners/lora/layer.py:307-328 | src/peft/tuners/lora/layer.py:2636-2656 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/layer.py:307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/lora/layer.py:304\u0060 calls \u0060isinstance\u0060, \u0060lower\u0060, \u0060gather_params_ctx\u0060 and \u0060src/peft/tuners/lora/layer.py:2635\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"142830b5e5f6feabe3c5e53c8991d4738593d1ea29db23b70f7b7eb8550f63b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/peft/tuners/lora/layer.py:537-558 | src/peft/tuners/lora/layer.py:621-641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/layer.py:537\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3429c2b3e74d05f4132212ef75c0f72d84cf8f4ede2e5a4a5c54ca0a363c17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/peft/tuners/lora/layer.py:1197-1218 | src/peft/tuners/lora/layer.py:1953-1973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fcc6bc2f076c7be6cd2248a6547ae8699914d59ca59f8ee005b176dd52a4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/peft/tuners/lora/layer.py:1124-1144 | src/peft/tuners/lora/layer.py:1874-1893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b36efa4975e0e4b1fdb8b9a9dad78042470502f35ce9464836ad43668bce52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/peft/tuners/lora/variants.py:235-255 | src/peft/tuners/lora/variants.py:445-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060module\u0060 to \u0060Linear\u0060 in one and \u0060_ConvNd\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/variants.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8947e3af35ee7a98d9500553dc21c839b6ad5347a61c09034dc04230c39e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/peft/tuners/oft/layer.py:373-393 | src/peft/tuners/oft/layer.py:937-957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/oft/layer.py:373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde202301c0ca89af6448d7437c44468e321ed1be49a0100cddc42628b6f88c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/peft/peft_model.py:2404-2423 | src/peft/peft_model.py:3457-3475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaf6ffa2e06c35fe4b25cf1301b46ac9fd38808c68b08db4cbbe59ded4674ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/peft/tuners/boft/layer.py:572-591 | src/peft/tuners/boft/layer.py:930-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b88976b5596477a5de55a9d89a51c8fccac29eef9bfd39a3980c90a5d47097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/peft/tuners/hira/model.py:164-183 | src/peft/tuners/lora/model.py:464-483 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2418f0abee361c30e585b0533363c29d325b425c2de1a5ca90184d59f0fc983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/peft/tuners/lora/aqlm.py:61-80 | src/peft/tuners/lora/awq.py:60-79 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/aqlm.py\u0060 and \u0060src/peft/tuners/lora/awq.py\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/aqlm.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bf530d7f1eb02b2bd2f5a2659d8b6c93ee124d437beb86e12e3292bdf8e987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/peft/tuners/miss/layer.py:235-254 | src/peft/tuners/miss/layer.py:276-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/miss/layer.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e84fbae9cf2255e57b60c29afed0107c8dd5ec2212e2211e2c26c9271b89a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/peft/tuners/oft/layer.py:395-414 | src/peft/tuners/oft/layer.py:959-978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/oft/layer.py:395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab0213d310909ad3c5fadb2153b8cfc8e8c830abb2e7ce9f863dfd08a59ef21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): src/peft/tuners/pvera/model.py:203-219 | src/peft/tuners/randlora/model.py:354-373 \u2014 \u0060src/peft/tuners/pvera/model.py\u0060 and \u0060src/peft/tuners/randlora/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/randlora/model.py:354\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f397eedb24eb2f8df80d2f2a0e73ce0976a3d14760d420b39777be4579dbab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): src/peft/tuners/gralora/layer.py:201-219 | src/peft/tuners/tinylora/layer.py:349-365 | src/peft/tuners/tinylora/layer.py:536-552 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/layer.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29701884716675db2b6d4ad1cb3dd5179750d65f6eef33ef5f33469d69f6483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): method_comparison/MetaMathQA/run.py:441-459 | method_comparison/image-gen/run.py:629-647 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/run.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1426a47a3d62fe32e18c7d7240068509c301f5be7a8cc7fa67e576a80b0222d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): method_comparison/text_generation_benchmark/run.py:157-173 | method_comparison/text_generation_benchmark/run_base.py:53-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060method_comparison/text_generation_benchmark/run.py:175\u0060 calls \u0060ValueError\u0060 and \u0060method_comparison/text_generation_benchmark/run_base.py:73\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f72df0155907ed51cc0eee505334d177d572985b474e3a6a5f1cf13e4fcd80a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/peft/tuners/c3a/layer.py:150-168 | src/peft/tuners/lora/tp_layer.py:243-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/layer.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b9fc7f52fefc5b038b37ef14e5c2f038c20958fd82d35ee5547ef98fb13155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/peft/tuners/lora/layer.py:243-261 | src/peft/tuners/lora/layer.py:1726-1744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/lora/layer.py:238\u0060 calls \u0060get\u0060 and \u0060src/peft/tuners/lora/layer.py:1724\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bfacfc0b3b154cd6eb75250531646788e12aceaa7a929d45a66ea419e97e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/peft/tuners/randlora/model.py:224-242 | src/peft/tuners/vera/model.py:172-190 \u2014 \u0060src/peft/tuners/randlora/model.py\u0060 and \u0060src/peft/tuners/vera/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/model.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0cbb47866d6393e7997d611a2bb6a5709007239789e1adda31fe05dd057265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/peft/tuners/pvera/model.py:126-143 | src/peft/tuners/randlora/model.py:218-235 | src/peft/tuners/vera/model.py:166-183 \u2014 \u0060src/peft/tuners/pvera/model.py\u0060 and \u0060src/peft/tuners/randlora/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060PveraConfig\u0060 in one and \u0060RandLoraConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fe700a5cd9ea9997f015ec5a599ec5f1ea8249db3018674ef0270ec73a8140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/peft/tuners/cartridge/utils.py:108-125 | src/peft/tuners/cartridge/utils.py:143-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/cartridge/utils.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"471f136c72d10a28040817da09f275165fd0fb45a20f68e676435241e607f3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/peft/tuners/loha/layer.py:228-245 | src/peft/tuners/lokr/layer.py:296-313 \u2014 \u0060src/peft/tuners/loha/layer.py\u0060 and \u0060src/peft/tuners/lokr/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/loha/layer.py:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c840abc469c629acba5f69bdcdfa12e159a9971610246c2415f8fc6430c09c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/peft/tuners/oft/layer.py:541-558 | src/peft/tuners/oft/layer.py:806-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/oft/layer.py:825\u0060 calls \u0060view\u0060 and \u0060src/peft/tuners/oft/layer.py:559\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"43395ecf0b89c7e2fc4a14c80693bdca61bf6e148ce923ddb9449eb1f7adc5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/peft/tuners/tinylora/layer.py:115-129 | src/peft/tuners/tuners_utils.py:2203-2220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0870fd7ad159b0af0ce7cdb57dd12fa564be412d6e776ee60988061d588108d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201317 lines \u00D7 4): src/peft/tuners/lora/layer.py:1147-1163 | src/peft/tuners/lora/layer.py:2308-2324 | src/peft/tuners/lora/tp_layer.py:278-294 | src/peft/tuners/lora/variants.py:1490-1496 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/layer.py\u0060 and \u0060src/peft/tuners/lora/tp_layer.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69bbd2ecd7e4dc2f6b6b6e144a7fea30177b7e42f7907e75ddfafe8cc0df4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/peft/tuners/oft/layer.py:399-415 | src/peft/tuners/oft/layer.py:731-747 | src/peft/tuners/oft/layer.py:963-979 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/oft/layer.py:399\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc424688f35a5f1e938a8bc9b2039b76ce7e8c2faf4abcdaf527a82ece36146d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:185-201 | method_comparison/image-gen/utils.py:195-210 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8b1727a01d608e358c87102481254faa39091923c5cfc6a8e0d3587466926c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/peft/peft_model.py:2721-2737 | src/peft/peft_model.py:3266-3280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2721}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef2a4c12f6fe096e6a8a0b283ebb1237493be47c89df81871fb866962e1e805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/peft/tuners/lily/model.py:84-100 | src/peft/tuners/peanut/model.py:78-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/model.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9347c9280e5d1afb231153bc5d1c678083ee1634de2af0430b6e957342b4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/peft/tuners/tinylora/layer.py:163-179 | src/peft/tuners/tinylora/layer.py:468-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"80de6d8f38191a5410d79c846eb7fb1537b411ebcea45f4e45e2cd0c2f2411a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 5): src/peft/peft_model.py:2198-2210 | src/peft/peft_model.py:2396-2411 | src/peft/peft_model.py:3037-3049 | src/peft/peft_model.py:3271-3283 | src/peft/peft_model.py:3449-3464 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/peft_model.py:2198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbd08d25774ad41dfaf28fae5d73b12d34f798491df8772cb6c406875e741c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): src/peft/tuners/glora/layer.py:308-321 | src/peft/tuners/lora/layer.py:930-945 | src/peft/tuners/road/layer.py:145-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"72580d7fec49b70093587be2530ed5c0c9c95ef420b28c6b40312d27ad141ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/peft/mixed_model.py:451-466 | src/peft/peft_model.py:550-565 \u2014 before extracting anything, compare \u0060src/peft/mixed_model.py\u0060 and \u0060src/peft/peft_model.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"75754501ec9c662f78aca08e32c708a13e4d94e1aa0a770e29fe5b3f888c0c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/peft/tuners/fourierft/layer.py:140-155 | src/peft/tuners/waveft/layer.py:238-253 \u2014 \u0060src/peft/tuners/fourierft/layer.py\u0060 and \u0060src/peft/tuners/waveft/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 52 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/layer.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbd9fbace96cfb523f504bd66cd81da4b75fed8acfc2ab6aa611f1c2e28a8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/peft/tuners/ia3/layer.py:122-137 | src/peft/tuners/ia3/layer.py:276-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d663d97d5065921340887d0a8f85e2e72dd2d8868beefdeccc77ef66c06a40da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 6): src/peft/peft_model.py:2197-2209 | src/peft/peft_model.py:2395-2407 | src/peft/peft_model.py:2727-2741 | src/peft/peft_model.py:3036-3048 | src/peft/peft_model.py:3270-3282 | src/peft/peft_model.py:3448-3460 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/peft_model.py:2197\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"119028391a720b3343d696217f86e27fa8c3afdfdd60ca76c0b7a70977e56869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/peft/tuners/lora/gptq.py:89-103 | src/peft/tuners/lora/layer.py:1199-1211 | src/peft/tuners/lora/layer.py:1954-1967 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/gptq.py: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":"src/peft/tuners/lora/gptq.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4e551798a150a2ff08acdc98d5d87d897bfcb00d66b77a811150dfe88e2b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): src/peft/tuners/lycoris_utils.py:134-145 | src/peft/tuners/pvera/layer.py:215-229 | src/peft/tuners/vblora/layer.py:157-168 \u2014 \u0060src/peft/tuners/pvera/layer.py\u0060 and \u0060src/peft/tuners/vblora/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 72 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lycoris_utils.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdb4889b7a88407a872b707b08cc77e095c2faf90878bbf0245a4b344390977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:153-167 | method_comparison/image-gen/utils.py:167-178 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1333cfad33e5c2e9e258d92bc97ecfc9a5f3ae466a97d337fa2e8ab549f36b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:294-308 | method_comparison/image-gen/utils.py:281-295 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/MetaMathQA/utils.py:294\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060method_comparison/MetaMathQA/utils.py:293\u0060 calls \u0060create_riemannian_optimizer\u0060 and \u0060method_comparison/image-gen/utils.py:280\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e22171eee9904969148add24bc8257d9f2006c4e610ff25a56a60df93ced7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/peft/tuners/adalora/layer.py:180-194 | src/peft/tuners/adalora/layer.py:318-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/adalora/layer.py:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d14322e9d20e0ed15b7d59fbb3efcefe57f0db6a4a090ccb1f67f7a94dd6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/peft/tuners/ia3/layer.py:173-185 | src/peft/tuners/ia3/layer.py:326-340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdacd61a57c749904c13ae185ccfd73d3b1d3ca8d0da02ad882de8dfdf2ae80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/peft/tuners/lily/layer.py:48-62 | src/peft/tuners/peanut/layer.py:51-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/layer.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c7588398a96cb208c3001b980434c95dbedc71d4848c127fffff5576a08586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/peft/tuners/lora/astra.py:260-273 | src/peft/tuners/lora/corda.py:301-315 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/astra.py\u0060 and \u0060src/peft/tuners/lora/corda.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/corda.py:301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9db3980861c156822273e40e6c18d8539cb82fbc07cb0d758d999edd44ac04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): src/peft/tuners/lora/layer.py:2669-2679 | src/peft/tuners/tuners_utils.py:2291-2305 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: \u0060BufferDict\u0060 names \u0060._buffer_dict\u0060 in one and \u0060peft.tuners._buffer_dict\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb2227b4a6fe722912071cdcb0ddce7a63baa8d6615e6d4d01f7d7150847c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/peft/tuners/mixed/model.py:128-142 | src/peft/tuners/tuners_utils.py:1355-1369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/mixed/model.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0069eccb2ba95d29c94922a4707ff664fd32951d07d74b32e46dfdab8f4d5bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): src/peft/tuners/fourierft/model.py:97-110 | src/peft/tuners/frod/model.py:290-303 | src/peft/tuners/gralora/model.py:99-112 | src/peft/tuners/randlora/model.py:397-410 | src/peft/tuners/vblora/model.py:129-142 | src/peft/tuners/waveft/model.py:146-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/model.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8dc6268155805eaa5fe812667a1b15bbf12839da65658e7a7695cb2049f689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/peft/tuners/pvera/model.py:71-84 | src/peft/tuners/randlora/model.py:102-115 | src/peft/tuners/vera/model.py:114-127 \u2014 \u0060src/peft/tuners/pvera/model.py\u0060 and \u0060src/peft/tuners/randlora/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e013d4347e0b7d79d2589359639fd20922024dab0080e37aa396a47c53c29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:372-385 | method_comparison/image-gen/utils.py:325-338 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb504340e000a4596ddc71eebbfd40e7f6e3370a771d4a8adf6e29129899f35c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): method_comparison/app.py:365-378 | method_comparison/app_embed.py:179-189 \u2014 before extracting anything, compare \u0060method_comparison/app.py\u0060 and \u0060method_comparison/app_embed.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/app.py:365\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":"method_comparison/app.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b66c0a5e2781aaf61c186767749dabe4213f191bc4c91085c5319788932dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/peft/tuners/delora/layer.py:199-212 | src/peft/tuners/peanut/layer.py:183-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/delora/layer.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"71687f6255259c2440582decbb432ec7b9f0b760d1cd1f96fba986dae879738a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): src/peft/tuners/lora/conversion.py:351-361 | src/peft/utils/save_and_load.py:299-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/conversion.py:351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/conversion.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"608bd12606e882ff2e81b6294b09a031aee98cbc4791be3f9427dffef45a5dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/peft/tuners/lora/layer.py:282-295 | src/peft/tuners/lora/layer.py:2614-2627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61be3b66aac14094c7adf59cc788dd31d48453b3a317badbbd2b7a171908540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/peft/tuners/lora/layer.py:1190-1203 | src/peft/tuners/lora/te.py:92-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/layer.py:1190\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/lora/te.py:91\u0060 calls \u0060ValueError\u0060 and \u0060src/peft/tuners/lora/layer.py:1189\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7f19737fa8456d8fdb9b63ed24eeb5fb24ef5152ecb36831ba1a87eb5e02ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/peft/tuners/oft/layer.py:521-534 | src/peft/tuners/oft/layer.py:1009-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3dc7155bf69c277a297a72ee8a98af9dbc6247234af64a67fa309944c29533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/peft/tuners/paca/layer.py:190-201 | src/peft/tuners/shira/layer.py:64-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/paca/layer.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c521ed719c69e1b904aebab7e80aa99d191e60bcabcce53cc697af7b44d4ebd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/peft/tuners/shira/layer.py:180-193 | src/peft/tuners/vera/layer.py:184-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shira/layer.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66c73d7145c86b5d534594c2ab1f0dde308181b04f24b57e238f0d4b9384009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 6): src/peft/tuners/adalora/layer.py:143-154 | src/peft/tuners/adalora/layer.py:279-290 | src/peft/tuners/lycoris_utils.py:136-147 | src/peft/tuners/pvera/layer.py:219-231 | src/peft/tuners/unilora/layer.py:186-195 | src/peft/tuners/vblora/layer.py:161-170 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e2c5b361abf841f7d5052d711ffe193b4da9d967b64a393d92ca11b3d85c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): src/peft/tuners/hira/model.py:176-187 | src/peft/tuners/lora/model.py:476-487 | src/peft/tuners/mixed/model.py:144-156 | src/peft/tuners/tuners_utils.py:1371-1383 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e165b432b0a875302d1c5252be71f71b942b03b5a9dca726d0ed821157f9399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): method_comparison/MetaMathQA/run.py:419-431 | method_comparison/image-gen/run.py:580-592 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/MetaMathQA/run.py:419\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, \u0060method_comparison/image-gen/run.py:593\u0060 calls \u0060item\u0060 and \u0060method_comparison/MetaMathQA/run.py:432\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":"method_comparison/MetaMathQA/run.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b41fe147caf8906473d85ac30f560bfd72987a99d6f5cdc039a40ca9ddb5ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): method_comparison/text_generation_benchmark/run.py:177-189 | method_comparison/text_generation_benchmark/run_base.py:73-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060method_comparison/text_generation_benchmark/run.py:175\u0060 calls \u0060ValueError\u0060 and \u0060method_comparison/text_generation_benchmark/run_base.py:71\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aeedde6fad53fb037d22623d14ef596a4fd987b36f938e11b175e412b13a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/peft/mixed_model.py:45-57 | src/peft/peft_model.py:770-782 \u2014 before extracting anything, compare \u0060src/peft/mixed_model.py\u0060 and \u0060src/peft/peft_model.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060model\u0060 to \u0060nn.Module\u0060 in one and \u0060PreTrainedModel\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1331a28b4900ada986a4504892f94da1395e7307a66169c42eb3c3bd3de05fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/peft/tuners/hra/layer.py:256-268 | src/peft/tuners/hra/layer.py:384-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/layer.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7209b22f69d843818727e8330539c3660b40c444cab07679b2d784cb3944c9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/peft/tuners/lora/layer.py:2290-2302 | src/peft/tuners/lora/layer.py:2401-2410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee63b71fbb2f847d0cdd1cc07638ef878ba95e1dd4a4417f1b6c7fa002ae3394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 5): src/peft/tuners/fourierft/config.py:193-203 | src/peft/tuners/hra/config.py:121-132 | src/peft/tuners/psoft/config.py:266-277 | src/peft/tuners/shadow/config.py:202-210 | src/peft/tuners/waveft/config.py:247-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/fourierft/config.py:193\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/config.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc5d35403951da4d6c794738d493aa4fa3fdf19cadf1b2ade562d0d2d90bb1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): examples/loftq_finetuning/int8_correction.py:82-93 | src/peft/tuners/lora/aqlm.py:64-75 | src/peft/tuners/lora/awq.py:63-74 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/aqlm.py\u0060 and \u0060src/peft/tuners/lora/awq.py\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loftq_finetuning/int8_correction.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"345359868a15d108adc9affc483786ddae1b24a40c69dfab367e48805605a69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/peft/tuners/deft/layer.py:67-78 | src/peft/tuners/fourierft/layer.py:45-55 | src/peft/tuners/waveft/layer.py:56-66 \u2014 \u0060src/peft/tuners/fourierft/layer.py\u0060 and \u0060src/peft/tuners/waveft/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 52 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/deft/layer.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7985de11a5a02aa3affbebe342af23d058ea772f7827a5a5aeb8084b3a09844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/peft/tuners/hira/layer.py:70-81 | src/peft/tuners/lily/layer.py:52-63 | src/peft/tuners/peanut/layer.py:55-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/hira/layer.py:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f87c198c3b50dce9d9f02dc799c2e238f82284807b04606441cb3ffc1129446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): src/peft/tuners/lora/layer.py:251-262 | src/peft/tuners/lora/layer.py:1334-1343 | src/peft/tuners/lora/layer.py:1734-1745 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/layer.py:251\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66e0365a69e95fd7c681dd6339134d3a9261f77a0e049f2ad0edebc6f855031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/peft/helpers.py:490-501 | src/peft/helpers.py:512-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/helpers.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"33498b4b03b0bf92f99c5606d81095383c71ec7075e96e31e41d81e15475ef42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/peft/tuners/adaption_prompt/layer.py:118-129 | src/peft/tuners/adaption_prompt/layer.py:202-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/adaption_prompt/layer.py:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/adaption_prompt/layer.py:216\u0060 calls \u0060getattr\u0060 and \u0060src/peft/tuners/adaption_prompt/layer.py:132\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adaption_prompt/layer.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7238e0866c4c4f107696912316b470f9b4c02041fe40918fb90802b695007ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/peft/tuners/beft/model.py:68-79 | src/peft/tuners/supertuning/model.py:83-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/model.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc6d058ad29bcb70a5076b678ec0d6c082f7ceb993a54e9e74c9f5e770eeb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/peft/tuners/boft/layer.py:339-350 | src/peft/tuners/boft/layer.py:785-796 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/boft/layer.py:339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ee4a560b46bddbe64ac1a0a865595d80ca1c4a42ba1f411e4f149ccfa84562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/peft/tuners/boft/layer.py:738-749 | src/peft/tuners/oft/layer.py:694-705 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a2eaadae545a4b6618e2fb8704b22f0d44eb91aa7fc9e95c2e9fe8a3b6a6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/peft/tuners/boft/layer.py:849-860 | src/peft/tuners/boft/layer.py:869-880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcee79cfd83139930db78e5dc79de105293ebe75cfda333230d014a7064af5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/peft/tuners/hra/layer.py:346-357 | src/peft/tuners/hra/layer.py:367-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/layer.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f837f34af53839201d799843bc0a2fd3433132883bc256831d6aa55a6b2638c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/peft/tuners/lora/te.py:99-110 | src/peft/tuners/lora/tp_layer.py:212-220 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/te.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76bf8822cab708e110578272e3745961f57072e4ccb63b58e76a02be0e324d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): examples/loftq_finetuning/int8_correction.py:72-81 | src/peft/tuners/glora/layer.py:356-365 | src/peft/tuners/lora/layer.py:1628-1637 | src/peft/tuners/lora/layer.py:1938-1948 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/lora/layer.py:1627\u0060 calls \u0060pop\u0060 and \u0060examples/loftq_finetuning/int8_correction.py:70\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":"examples/loftq_finetuning/int8_correction.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07d045008daac2e3a7ef34a90b4cbf9c77d3fa78e1517cbd87abb7983b66ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/peft/tuners/lora/layer.py:292-303 | src/peft/tuners/lora/layer.py:2624-2635 | src/peft/tuners/lora/tp_layer.py:167-178 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/layer.py\u0060 and \u0060src/peft/tuners/lora/tp_layer.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/lora/layer.py:304\u0060 calls \u0060isinstance\u0060, \u0060lower\u0060, \u0060gather_params_ctx\u0060 and \u0060src/peft/tuners/lora/layer.py:2636\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"931dcde7cf334bf2b8e813de56d33e8727cc876f045040925751cc5737d0c051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/peft/tuners/lora/layer.py:321-331 | src/peft/tuners/lora/layer.py:1368-1378 | src/peft/tuners/lora/layer.py:1784-1794 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/layer.py:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a73fb327f099cc0f200f4ad0d491850178a21a5b2eb7e9f5fadcac42f9cf01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/peft_model.py:394-404 | src/peft/peft_model.py:420-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"38292fb77e6f644a93dce51cd18907b1cad798403017e727d77b582e201e3a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/adamss/layer.py:477-488 | src/peft/tuners/psoft/layer.py:408-418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d9f4c64b43b2a75c55035ce65ba6faa7def59a3d9a10da30bd70da94affa83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/peft/tuners/boft/layer.py:226-236 | src/peft/tuners/miss/layer.py:47-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/boft/layer.py:222\u0060 calls \u0060ModuleDict\u0060, \u0060ParameterDict\u0060 and \u0060src/peft/tuners/miss/layer.py:44\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b053fff04daddf0305cb6481546706f19bb73aa2b7397929c919bbda8621f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/boft/layer.py:307-317 | src/peft/tuners/boft/layer.py:753-763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/boft/layer.py:307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bfffe5771ffd3f4d1802f82a6f0a59f67fb68cb8b0bd2bf5bf4d64a334a56c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/deft/model.py:69-79 | src/peft/tuners/hra/model.py:93-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/deft/model.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7311db5e883c83bde4c8978ed085cfecb7a5f14515029c4a11b799e72b5e9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/hira/layer.py:129-139 | src/peft/tuners/hira/layer.py:303-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5cb865a047de8f4b6232f908573dd161928ce1cfcf9ca5f6ba2c479445666a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/hra/layer.py:278-288 | src/peft/tuners/hra/layer.py:423-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/hra/layer.py:438\u0060 calls \u0060permute\u0060 and \u0060src/peft/tuners/hra/layer.py:290\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/layer.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2003cbd5914f0cf3e262c7eac152bb0350c028e72332938b8973934c1226984d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/peft/tuners/lora/layer.py:1948-1958 | src/peft/tuners/lora/tp_layer.py:209-217 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/layer.py\u0060 and \u0060src/peft/tuners/lora/tp_layer.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"225d6f743654823e70836cf7ace94960226709c799df8215fe1b72ea3e5163b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/peft/tuners/oft/layer.py:196-206 | src/peft/tuners/oft/layer.py:247-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/oft/layer.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6f925ac9638ef4df223aef4b94c39c6b10705b137a11b532c22204725f6743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/peft/tuners/osf/utils.py:71-81 | src/peft/tuners/osf/utils.py:93-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/osf/utils.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d70403e0614e6c36a50cb9739da7b13a3b695fb117ea092324277a6ee24e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/pvera/model.py:263-273 | src/peft/tuners/vera/model.py:272-282 \u2014 \u0060src/peft/tuners/pvera/model.py\u0060 and \u0060src/peft/tuners/vera/model.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/pvera/model.py:263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9396de2ac6dd322c953f196ee0ecbed829d7e3c958ec83e582fc68c7ba5b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/peft/tuners/randlora/model.py:258-268 | src/peft/tuners/randlora/model.py:284-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/randlora/model.py:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/model.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"258468737e62d35809d7da8eecf0810907f00567cd767895a77630f4138cea1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/peft/tuners/tinylora/layer.py:389-398 | src/peft/tuners/tinylora/layer.py:575-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fb294fdb049789b52747903a61b5dc89b918f83cc0c3f91e068f18d7d2bf1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 11): src/peft/tuners/adalora/layer.py:177-184 | src/peft/tuners/adalora/layer.py:315-322 | src/peft/tuners/fourierft/layer.py:175-182 | src/peft/tuners/loha/layer.py:225-234 | src/peft/tuners/lokr/layer.py:293-302 | src/peft/tuners/pvera/layer.py:291-298 | src/peft/tuners/randlora/layer.py:330-337 | src/peft/tuners/tinylora/layer.py:383-390 | src/peft/tuners/unilora/layer.py:238-245 | src/peft/tuners/vblora/layer.py:238-245 | src/peft/tuners/waveft/layer.py:273-280 \u2014 there are 11 copies across 10 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 11 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/adalora/layer.py:311\u0060 calls \u0060reshape\u0060, \u0060get_base_layer\u0060 and \u0060src/peft/tuners/adalora/layer.py:173\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c5edbd2479880adf75012666ef230588cf1dc06217f9b25f4de0b4c1e94f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 10): src/peft/tuners/adalora/config.py:80-89 | src/peft/tuners/boft/config.py:154-162 | src/peft/tuners/delora/config.py:147-156 | src/peft/tuners/lily/config.py:226-233 | src/peft/tuners/loha/config.py:135-143 | src/peft/tuners/lokr/config.py:147-155 | src/peft/tuners/oft/config.py:180-188 | src/peft/tuners/paca/config.py:185-192 | src/peft/tuners/peanut/config.py:179-186 | src/peft/tuners/vblora/config.py:188-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 10 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 10 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/peanut/config.py:188\u0060 calls \u0060ValueError\u0060 and \u0060src/peft/tuners/lily/config.py:234\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/config.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"01487a310cc40c1a83601ab7cc5a1f28c877367181795587619879e2b0479161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 7): src/peft/tuners/fourierft/config.py:191-200 | src/peft/tuners/hira/config.py:144-153 | src/peft/tuners/hra/config.py:119-128 | src/peft/tuners/miss/config.py:130-139 | src/peft/tuners/psoft/config.py:264-273 | src/peft/tuners/shadow/config.py:200-208 | src/peft/tuners/waveft/config.py:245-254 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/config.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7a77b92db6bbded8eac0d82788d87e41368902338e7200773adbddfeaf1359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/peft/tuners/lily/layer.py:51-60 | src/peft/tuners/peanut/layer.py:54-62 | src/peft/tuners/tuners_utils.py:236-243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/layer.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7175ef62e8f1600261cc585c4d48a327587f69f38c67d95a9daebbdd23ba5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/peft/tuners/lora/layer.py:280-289 | src/peft/tuners/lora/layer.py:1351-1360 | src/peft/tuners/lora/layer.py:2612-2621 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2253a6386f07e666891df6769a74cfb39d4a7e099014fca563e53708216dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/peft/tuners/pvera/layer.py:59-68 | src/peft/tuners/randlora/layer.py:79-88 | src/peft/tuners/vblora/layer.py:50-59 \u2014 \u0060src/peft/tuners/pvera/layer.py\u0060 and \u0060src/peft/tuners/randlora/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70923f752dccd64df249f376b5da4e24e69891c007a44bcf8d1426c959d6e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:172-181 | method_comparison/image-gen/utils.py:182-191 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa18b13b86ac5f0019c2da042dde256e9f29b1b9a4bffd7b7647785d62afa53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/peft/mixed_model.py:472-481 | src/peft/peft_model.py:617-625 \u2014 before extracting anything, compare \u0060src/peft/mixed_model.py\u0060 and \u0060src/peft/peft_model.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db9e0df8abf770d092468ae0a5bab56dd1ad63a7d7661f83b9ffcf9ea3c72e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/peft_model.py:3106-3115 | src/peft/peft_model.py:3342-3351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/peft_model.py:3106\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93f0382030fdedf1165b667671ccb416b274627e2dfff26157f27568399e3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/adalora/layer.py:157-166 | src/peft/tuners/adalora/layer.py:293-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"806b1225bd60cb89a8862aa047a5229267ff96cd2d963f7042185aa6c38350ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/peft/tuners/boft/layer.py:615-623 | src/peft/tuners/boft/layer.py:952-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/boft/layer.py:952\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7dd4108760480f1929db2b26b95a51bab65886755a7f70a63554503a7e9dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/ln_tuning/model.py:111-120 | src/peft/tuners/mixed/model.py:251-260 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ln_tuning/model.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f94846119e96a029df4e12f833a244a4d8bc7e3bc404bcf6a0b721471972b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/loha/layer.py:123-132 | src/peft/tuners/lokr/layer.py:182-191 \u2014 \u0060src/peft/tuners/loha/layer.py\u0060 and \u0060src/peft/tuners/lokr/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8263e4666e6d80d07146c37bf755202e40a9a1b760cc0b96f697a61f0f853d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/lora/astra.py:155-165 | src/peft/tuners/lora/corda.py:162-172 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/astra.py\u0060 and \u0060src/peft/tuners/lora/corda.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bf8fcce49ab9831d544e9921abf6e18b958ba788f6c7e1bba310cc4023ec2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/lora/layer.py:1769-1779 | src/peft/tuners/lora/layer.py:2612-2621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/lora/layer.py:1769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9062a5b6431e3933fd0dcc734dd06ca73e42b2eabc5a159750d18544ccbd7fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/lora/layer.py:2331-2340 | src/peft/tuners/lora/tp_layer.py:301-310 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/layer.py\u0060 and \u0060src/peft/tuners/lora/tp_layer.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d7bc4989a5b03827e93055bbf7cfafe56c4939d0e398018a11c53369d25f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/tinylora/layer.py:368-377 | src/peft/tuners/tinylora/layer.py:555-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/layer.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd547a0070f1f82f9d9e0a93adf797b1c5f4de336986320bd43cd5cd83c5c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/utils/other.py:824-833 | src/peft/utils/other.py:1077-1086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"84de49018ae8b45634860e21ab42f24ba9dc80ba46f1fbbe25d2ead3791bda2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 18): src/peft/tuners/adalora/layer.py:176-183 | src/peft/tuners/adalora/layer.py:314-321 | src/peft/tuners/c3a/layer.py:185-192 | src/peft/tuners/fourierft/layer.py:174-181 | src/peft/tuners/gralora/layer.py:324-331 | src/peft/tuners/hira/layer.py:250-257 | src/peft/tuners/hira/layer.py:574-582 | src/peft/tuners/loha/layer.py:224-231 | src/peft/tuners/lokr/layer.py:292-299 | src/peft/tuners/peanut/layer.py:211-218 | src/peft/tuners/psoft/layer.py:453-460 | src/peft/tuners/pvera/layer.py:290-297 | src/peft/tuners/randlora/layer.py:329-336 | src/peft/tuners/tinylora/layer.py:382-389 | src/peft/tuners/unilora/layer.py:237-244 | src/peft/tuners/vblora/layer.py:237-244 | src/peft/tuners/vera/layer.py:256-263 | src/peft/tuners/waveft/layer.py:272-279 \u2014 there are 18 copies across 16 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 18 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/adalora/layer.py:311\u0060 calls \u0060reshape\u0060, \u0060get_base_layer\u0060 and \u0060src/peft/tuners/adalora/layer.py:173\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1687be45cc8d9245b52e926ddbd87e2d31470ab0147e1709e658aecd6aa7c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): examples/loftq_finetuning/int8_correction.py:78-86 | src/peft/tuners/adalora/layer.py:180-188 | src/peft/tuners/adalora/layer.py:318-326 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/loftq_finetuning/int8_correction.py:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/loftq_finetuning/int8_correction.py:77\u0060 calls \u0060_mixed_batch_forward\u0060 and \u0060src/peft/tuners/adalora/layer.py:179\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loftq_finetuning/int8_correction.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5fb060071172c1a69decc6b1c96a505c61dd2b471aa97aa7ebcb041a5e23c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/peft/tuners/adalora/gptq.py:45-53 | src/peft/tuners/adalora/layer.py:184-192 | src/peft/tuners/adalora/layer.py:322-330 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/gptq.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0ea82cd7f6668eea2f21130dad0b18a7add2ed22ac7d4cb1f2431980cfbdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/peft/tuners/hra/layer.py:274-282 | src/peft/tuners/hra/layer.py:419-427 | src/peft/tuners/miss/layer.py:329-337 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/layer.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e2f143532514147fdabb68c0b2a6a71b1d5bc0ea957601bab38b47977db7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/peft/tuners/lora/layer.py:1178-1186 | src/peft/tuners/lora/layer.py:1625-1632 | src/peft/tuners/lora/layer.py:1935-1942 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"115cff6ba458ec44a32808b7f0f4328cb535d32a12a408c6cf4014ec799d7387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:624-635 | method_comparison/image-gen/utils.py:473-484 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eaa3ea25ecf0d12c3361b39140cbf1eb1396e8728130894f6db4b9456ef311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): method_comparison/image-gen/evaluate.py:89-97 | method_comparison/image-gen/run.py:336-344 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/image-gen/evaluate.py:89\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":"method_comparison/image-gen/evaluate.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f609e80d8ca9574f28b30d0dfe051211750a36a049a7646b123e74718085432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/adalora/layer.py:57-66 | src/peft/tuners/lora/tp_layer.py:123-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b620adb9d674060d5d2bcfcc0d84901ad208164c232f8e70b82a75f8781558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/adalora/layer.py:230-238 | src/peft/tuners/lora/layer.py:1740-1750 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baecd4c84dc9d783389a758edcf48148e91767d69b9f7d6ce5634949836384e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/boft/layer.py:357-365 | src/peft/tuners/boft/layer.py:803-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/boft/layer.py:357\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b7927f6f2b2790f60ff482d4709d3aa732b47a76901afd529f6a9ecab186e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/c3a/layer.py:40-48 | src/peft/tuners/delora/layer.py:53-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/layer.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"98803990f8200fbb3a816097e9c30d75e3fa0b0c2b5457b053346b761b5dbbe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/ia3/model.py:301-309 | src/peft/tuners/lora/model.py:886-894 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/ia3/model.py:301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/model.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"88260eec56dd70a5443a8b547bbe95dd3bf0381a7a2f2daf8a101daebba8b5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/lokr/layer.py:116-125 | src/peft/tuners/lokr/layer.py:132-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lokr/layer.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"88661e2aed62202a207d7796082f9575a9e3237180c8b77afedbaadae833d36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/peft/tuners/lora/astra.py:117-123 | src/peft/tuners/lora/corda.py:117-125 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/astra.py\u0060 and \u0060src/peft/tuners/lora/corda.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ebc8de667e681e3d7308bef59d277623765173ca177df8b53b8b246392f8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/lora/model.py:909-917 | src/peft/tuners/lora/model.py:1041-1049 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"df15821d54bce95591ebe255b6e7b77ac79629a68fdaeb9b81dac13a875a60e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/pvera/layer.py:265-273 | src/peft/tuners/vera/layer.py:236-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/pvera/layer.py:277\u0060 calls \u0060size\u0060 and \u0060src/peft/tuners/vera/layer.py:246\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/layer.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54e6deda159de357e12bd00c974df363926305e2e4998b709fc011a0dfb863b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/randlora/model.py:143-151 | src/peft/tuners/randlora/model.py:180-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/model.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f832ec45e0f55ab18232aff18d85f26ce673defd00676dac60570fe448db246c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/peft/tuners/lora/layer.py:1160-1167 | src/peft/tuners/lora/layer.py:1909-1916 | src/peft/tuners/lora/layer.py:2321-2328 | src/peft/tuners/lora/tp_layer.py:291-298 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/layer.py\u0060 and \u0060src/peft/tuners/lora/tp_layer.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4ab52b0f46637c62716fff7a45e6cf7087d695b2d36cbc190121c57b78682c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/peft/peft_model.py:2716-2723 | src/peft/peft_model.py:3261-3268 | src/peft/peft_model.py:3441-3448 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/peft_model.py:2716\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/peft_model.py:3259\u0060 calls \u0060_get_return_dict_transformers_v4\u0060 and \u0060src/peft/peft_model.py:2715\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca51d60718e550e8443de1c718ae112f84b23b20e4824075eb790c64756e91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/peft/tuners/gralora/layer.py:49-56 | src/peft/tuners/pvera/layer.py:55-62 | src/peft/tuners/vblora/layer.py:46-53 \u2014 \u0060src/peft/tuners/pvera/layer.py\u0060 and \u0060src/peft/tuners/vblora/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 72 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/gralora/layer.py:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/peft/tuners/gralora/layer.py:45\u0060 calls \u0060ModuleDict\u0060 and \u0060src/peft/tuners/vblora/layer.py:43\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/layer.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1cb780ff47829ce805b81eaa45d7fdf85b1672602cba169d6a635ee669dc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/peft/tuners/hira/layer.py:404-412 | src/peft/tuners/oft/layer.py:1093-1100 | src/peft/tuners/tinylora/layer.py:567-575 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/hira/layer.py:414\u0060 calls \u0060get_base_layer\u0060 and \u0060src/peft/tuners/oft/layer.py:1103\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"984046357c65ec7bf979173a82eeacd318758fd6327512b5189c6370c51f9fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:128-135 | method_comparison/image-gen/utils.py:151-158 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2401bc925d2e554c08475e2a83ec68128c24f55370233e340f4e1ef96c60e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/peft/mixed_model.py:290-297 | src/peft/mixed_model.py:303-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f828c9fa626677946e13032051af629dc21b0020fac2174a13b21ca4e8442805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): src/peft/tuners/adalora/layer.py:71-90 | src/peft/tuners/adalora/layer.py:243-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/layer.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eeedff4ba0156caaaa630e9ee2c7d3584500feee13107f69c7176c55247faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/peft/tuners/hira/layer.py:63-70 | src/peft/tuners/ia3/layer.py:44-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2678d384258fdafde16953541c67e866724bc41eb0329d657c691f82a808243e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/peft/tuners/lora/aqlm.py:40-47 | src/peft/tuners/lora/awq.py:36-43 \u2014 before extracting anything, compare \u0060src/peft/tuners/lora/aqlm.py\u0060 and \u0060src/peft/tuners/lora/awq.py\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/aqlm.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"946346fca50cac7db5eacce00f61b4f25d3c62da04fa7aa5b83739798800b645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/peft/tuners/gralora/layer.py:52-58 | src/peft/tuners/pvera/layer.py:58-64 | src/peft/tuners/randlora/layer.py:78-84 | src/peft/tuners/vblora/layer.py:49-55 \u2014 \u0060src/peft/tuners/pvera/layer.py\u0060 and \u0060src/peft/tuners/randlora/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/peft/tuners/gralora/layer.py:60\u0060 calls \u0060NotImplementedError\u0060 and \u0060src/peft/tuners/pvera/layer.py:66\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/layer.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f061161cbd84e94994ba1eae0bf83ab8473b94867888deb79dc067325a837e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/peft/peft_model.py:2267-2272 | src/peft/peft_model.py:3106-3112 | src/peft/peft_model.py:3342-3348 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/peft_model.py:2267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"354611c2f60b368c39e0f5b48895819ed1b23c1e052308fdf9faa4f12234e19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): method_comparison/image-gen/run.py:250-256 | method_comparison/image-gen/run.py:263-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060method_comparison/image-gen/run.py:249\u0060 calls \u0060disable_adapter\u0060 and \u0060method_comparison/image-gen/run.py:262\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/image-gen/run.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cbc47b511ad71cc3a3aeb977d25e5b475664450d6a1e9b01eaa67cbfec8663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/peft/tuners/beft/layer.py:34-40 | src/peft/tuners/road/layer.py:63-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/layer.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b083100de07d5f41e3368e3e2050723a8a6b16c23bc0d71304bc80c85e03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/peft/tuners/glora/model.py:100-106 | src/peft/tuners/road/model.py:136-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/model.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a11b42a0fcfc5a13b3bd7dc8bb39fb28299821f877e07d006291b8926e62b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:744-749 | method_comparison/image-gen/utils.py:610-615 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/MetaMathQA/utils.py:744\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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"217b4121718362ab87c3089da44b48f3b9ffb659fdeaa3ac43a468052d26b3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/peft/peft_model.py:2274-2279 | src/peft/peft_model.py:3113-3118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0948de69aa30d5ef60b8be5099b4bf95f57c0734306f7ec68e1d88f7c4203fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/peft/peft_model.py:3307-3312 | src/peft/peft_model.py:3480-3485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3307}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a6b5e49614b2341b7ca0c67337fac7a8005674dc178358cba7f7691778f647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:596-601 | method_comparison/image-gen/utils.py:425-430 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c8a261df59b8c224db0ddf9a3ca951fdf43c8523b66fb638453909c0615540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): method_comparison/MetaMathQA/utils.py:713-717 | method_comparison/image-gen/utils.py:579-583 \u2014 \u0060method_comparison/MetaMathQA/utils.py\u0060 and \u0060method_comparison/image-gen/utils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 108 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060method_comparison/MetaMathQA/utils.py:713\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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a45f633a53bf28cc9bd1b83990788109ef5d48c44647757870456f356ab60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): method_comparison/app.py:282-286 | method_comparison/app_embed.py:172-176 \u2014 before extracting anything, compare \u0060method_comparison/app.py\u0060 and \u0060method_comparison/app_embed.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/app.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7235ef6015c948925828bd054b57619a265e8b8ab831ffe74c1f8f6c2cb470f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/peft/tuners/hira/layer.py:552-556 | src/peft/tuners/lora/layer.py:1914-1919 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3091f0f5faf2a53e134e896403d65d5ec52aa9b55708425ce1d5fc1a63995d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/peft/tuners/ia3/layer.py:139-143 | src/peft/tuners/ia3/layer.py:293-297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/peft/tuners/ia3/layer.py:139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f36a56193da5d9bf113dc1d691010e388de110cbdae5358240d5f82982630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/peft/tuners/lokr/layer.py:128-134 | src/peft/tuners/lokr/layer.py:145-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lokr/layer.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33bd3f48aff2f469caed6098d9fc44cecf04750000a68e32681b98aa6d130f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): examples/feature_extraction/peft_lora_embedding_semantic_search.py:193-199 | src/peft/tuners/adaption_prompt/model.py:221-229 | src/peft/tuners/osf/model.py:39-49 | src/peft/tuners/tuners_utils.py:1716-1722 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"897ad5901a96155caf220260c5f6f8d135df9d6efa963de75ac3072a34c02cd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/peft/mixed_model.py:175-181 | src/peft/peft_model.py:1021-1027 \u2014 before extracting anything, compare \u0060src/peft/mixed_model.py\u0060 and \u0060src/peft/peft_model.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3068a6217b80669909c787d4a27d334ceb72037fe4383e3827d3264e78a3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/peft/tuners/hira/layer.py:387-396 | src/peft/tuners/oft/layer.py:1080-1089 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d7b58f3952ea0a3aba5fd5788e05bbca972c233256122a725ff5008a0695d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/peft/tuners/ia3/__init__.py:29-39 | src/peft/tuners/randlora/__init__.py:30-40 | src/peft/tuners/road/__init__.py:37-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/__init__.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"925b5d877f1de59374e7a4cfa0676b841564d5aa2f738dc0fd4f291d2672c5eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/peft/tuners/loha/layer.py:260-264 | src/peft/tuners/loha/layer.py:298-302 | src/peft/tuners/loha/layer.py:331-335 | src/peft/tuners/lokr/layer.py:330-334 | src/peft/tuners/lokr/layer.py:370-374 | src/peft/tuners/lokr/layer.py:405-409 \u2014 \u0060src/peft/tuners/loha/layer.py\u0060 and \u0060src/peft/tuners/lokr/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d598e5f47e7b3917438d34a898a8da72f08d0e8524423ade69f6b7eef5eaa9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/peft/tuners/loha/layer.py:269-273 | src/peft/tuners/lokr/layer.py:339-343 \u2014 \u0060src/peft/tuners/loha/layer.py\u0060 and \u0060src/peft/tuners/lokr/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb3640b3f3f7ca5652059421d10c7b1ca613aa1822c53bfa7f6f53c9566f889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/peft/tuners/loha/layer.py:307-312 | src/peft/tuners/loha/layer.py:340-345 | src/peft/tuners/lokr/layer.py:379-384 | src/peft/tuners/lokr/layer.py:414-419 \u2014 \u0060src/peft/tuners/loha/layer.py\u0060 and \u0060src/peft/tuners/lokr/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7021f3855154a59e29bcb23e0cda11c0c4bcdc5d15af419f303317484c687a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/peft/tuners/lora/arrow.py:201-215 | src/peft/tuners/tuners_utils.py:2327-2341 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/arrow.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7e5bfac340871773435237402b1765d434a136f1daa93053e3db896000bc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/peft/tuners/lora/corda.py:41-47 | src/peft/tuners/lora/loraga.py:31-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/corda.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b45e1e4a5d88a0c31ba6b8686168127438f65b08bc1d06d07806e96ac3df65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/peft/tuners/lora/model.py:676-684 | src/peft/tuners/oft/model.py:162-170 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd4fe5dd8c8d123e7446a9e6d51f4fb5fc5b758ab9a3acad96ecd49895575e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/peft/tuners/osf/layer.py:368-378 | src/peft/tuners/road/layer.py:408-418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/osf/layer.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5933b30cd7011617ccdf93b59106aa4891144b17e3712d5cd140172f5b862d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/peft/tuners/boft/layer.py:249-256 | src/peft/tuners/deft/layer.py:164-169 | src/peft/tuners/hra/layer.py:121-128 | src/peft/tuners/miss/layer.py:131-138 | src/peft/tuners/oft/layer.py:316-323 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fe5ac02ccfc06845df478961cdd635a55bcbd941747d60cfa77c45f7b84691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/peft/tuners/fourierft/layer.py:114-118 | src/peft/tuners/waveft/layer.py:212-216 \u2014 \u0060src/peft/tuners/fourierft/layer.py\u0060 and \u0060src/peft/tuners/waveft/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 52 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/layer.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabbfa9a695ba5fb0cc22d27be1c0774410849e8014a23a2932e8d637fb495cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/peft/tuners/frod/layer.py:172-178 | src/peft/tuners/pvera/layer.py:187-193 | src/peft/tuners/randlora/layer.py:197-202 \u2014 \u0060src/peft/tuners/pvera/layer.py\u0060 and \u0060src/peft/tuners/randlora/layer.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e2444a63f5efd0edde7739af406f5e0c69b39e51815cd297225be13029b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/peft/tuners/glora/layer.py:336-340 | src/peft/tuners/glora/layer.py:374-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6aebdb5597c2a4637ebfa7368f9a8244809520f6cf99768b99e14f6fb9ec1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/peft/tuners/glora/layer.py:343-348 | src/peft/tuners/glora/layer.py:379-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/layer.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dfb502d5d392320df7814a72fe1be502e3945909253e6726b417f15734386c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/peft/tuners/lokr/layer.py:210-215 | src/peft/tuners/lokr/layer.py:226-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lokr/layer.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7478268462d1928b8dcb13af3d66bd3c750ffa3384714005fdda7aad9123b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (9 members, 32 shared lines): examples/deft_finetuning/deft_finetuning.py:37-133 | examples/delora_finetuning/delora_finetuning.py:36-131 | examples/dora_finetuning/dora_finetuning.py:38-150 | examples/gralora_finetuning/gralora_finetuning.py:38-131 | examples/lily_finetuning/lily_finetuning.py:37-129 | examples/peanut_finetuning/peanut_finetuning.py:38-131 | examples/randlora_finetuning/randlora_finetuning.py:41-164 | examples/road_finetuning/road_finetuning.py:49-149 | examples/supertuning_finetuning/supertuning_finetuning.py:36-128 \u2014 These 9 members are variants of one another: a block of 32 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c5af1cc41655cc8ca0e5cfe4c6eddab25fa41bc8e8eeef3a4f7c42f3b9a6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 144 shared lines): examples/boft_controlnet/utils/args_loader.py:42-447 | examples/boft_dreambooth/utils/args_loader.py:41-363 | examples/deft_dreambooth/train_dreambooth.py:75-408 | examples/hra_dreambooth/utils/args_loader.py:43-377 | examples/lora_dreambooth/train_dreambooth.py:75-403 | examples/oft_dreambooth/train_dreambooth.py:76-413 | examples/stable_diffusion/train_dreambooth.py:170-577 \u2014 These 7 members are variants of one another: a block of 144 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4808bdc3209f19b5105ea6ed0b0113facbe4107df9da1e376762c6ee66c1109b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 30 shared lines): examples/alora_finetuning/alora_finetuning.py:38-159 | examples/dora_finetuning/dora_finetuning.py:38-150 | examples/gralora_finetuning/gralora_finetuning.py:38-131 | examples/lily_finetuning/lily_finetuning.py:37-129 | examples/peanut_finetuning/peanut_finetuning.py:38-131 | examples/road_finetuning/road_finetuning.py:49-149 \u2014 These 6 members are variants of one another: a block of 30 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"95519397866fd794284c1a26a96f64bb043c3589fc3ead115ef4e2967674e8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 66 shared lines): examples/glora_finetuning/glora_finetuning.py:47-147 | examples/hira_finetuning/hira_finetuning.py:45-143 | examples/olora_finetuning/olora_finetuning.py:52-142 | examples/shira_finetuning/shira_finetuning.py:50-166 | examples/waveft_finetuning/waveft_finetuning.py:51-134 \u2014 These 5 members are variants of one another: a block of 66 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glora_finetuning/glora_finetuning.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6190ca0c812990e4560f3774acf9c8ff9778e78e23dd9dd0dbe6c4edd75ad89"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 22 shared lines): examples/deft_finetuning/deft_finetuning.py:37-133 | examples/delora_finetuning/delora_finetuning.py:36-131 | examples/paca_finetuning/paca_finetuning.py:36-110 | examples/randlora_finetuning/randlora_finetuning.py:41-164 | examples/supertuning_finetuning/supertuning_finetuning.py:36-128 \u2014 These 5 members are variants of one another: a block of 22 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cc097ebc50d251a9880735420bc79fa859ad8d9871e0cd7568eea0b30aca4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (148 shared lines): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:111-377 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:105-329 \u2014 These two members are variants of one another: 148 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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"778b4db701de49c19685494110e8cc6f2a17ededd030ab56d571f8fe244ada5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (82 shared lines): examples/adamss_finetuning/glue_adamss_asa_example.py:152-378 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:164-407 \u2014 These two members are variants of one another: 82 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":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"36da9ad3f4a6b9fd38ee20e1911fff9f5108c02ba3650263ce9d5e6682d7e2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): examples/boft_controlnet/train_controlnet.py:88-540 | examples/boft_dreambooth/train_dreambooth.py:84-620 | examples/deft_dreambooth/train_dreambooth.py:587-1104 | examples/feature_extraction/peft_lora_embedding_semantic_search.py:211-498 | examples/hra_dreambooth/train_dreambooth.py:84-616 | examples/int8_training/peft_adalora_whisper_large_training.py:424-813 | examples/loftq_finetuning/train_gsm8k_llama.py:298-811 | examples/lora_dreambooth/train_dreambooth.py:582-1103 | examples/oft_dreambooth/train_dreambooth.py:592-1111 | examples/stable_diffusion/train_dreambooth.py:756-1271 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0905bce88efe1e96f8c02be3c46dd3f5e115a1f3ecd8a6898526a208fa4ec0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): examples/boft_controlnet/utils/tracemalloc.py:16-29 | examples/boft_dreambooth/utils/tracemalloc.py:16-29 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:63-76 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:57-70 | examples/deft_dreambooth/train_dreambooth.py:419-432 | examples/hra_dreambooth/utils/tracemalloc.py:18-31 | examples/lora_dreambooth/train_dreambooth.py:414-427 | examples/oft_dreambooth/train_dreambooth.py:424-437 | examples/stable_diffusion/train_dreambooth.py:588-601 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/tracemalloc.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ba34a4b879ed5ec1712e0df35d354faf78a2fbf7c9b6e6ff1666e2baa093c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): examples/boft_controlnet/utils/tracemalloc.py:48-59 | examples/boft_dreambooth/utils/tracemalloc.py:48-59 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:95-106 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:89-100 | examples/deft_dreambooth/train_dreambooth.py:451-462 | examples/hra_dreambooth/utils/tracemalloc.py:50-61 | examples/lora_dreambooth/train_dreambooth.py:446-457 | examples/oft_dreambooth/train_dreambooth.py:456-467 | examples/stable_diffusion/train_dreambooth.py:620-631 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/tracemalloc.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd74fa4f39c6c3a4205a1742362702abd3b6d8550ab9f5cc4c974f055818436b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): examples/boft_dreambooth/utils/args_loader.py:11-27 | examples/deft_dreambooth/train_dreambooth.py:55-71 | examples/hra_dreambooth/utils/args_loader.py:13-29 | examples/lora_dreambooth/train_dreambooth.py:55-71 | examples/oft_dreambooth/train_dreambooth.py:56-72 | examples/stable_diffusion/train_dreambooth.py:70-86 \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":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bb48ae1e65bf3072c174187757a5f5888b83411491639784c825dff636e5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): examples/boft_dreambooth/utils/dataset.py:25-55 | examples/deft_dreambooth/train_dreambooth.py:482-512 | examples/hra_dreambooth/utils/dataset.py:27-57 | examples/lora_dreambooth/train_dreambooth.py:477-507 | examples/oft_dreambooth/train_dreambooth.py:487-517 | examples/stable_diffusion/train_dreambooth.py:651-681 \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":"examples/boft_dreambooth/utils/dataset.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"96072f0c14746e01b5f36258c011541c9dd33e2cfe281438d00a099aca38fd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): examples/boft_dreambooth/utils/dataset.py:61-87 | examples/deft_dreambooth/train_dreambooth.py:518-544 | examples/hra_dreambooth/utils/dataset.py:63-89 | examples/lora_dreambooth/train_dreambooth.py:513-539 | examples/oft_dreambooth/train_dreambooth.py:523-549 | examples/stable_diffusion/train_dreambooth.py:687-713 \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":"examples/boft_dreambooth/utils/dataset.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"711ea95c0982394368ec9984b4add768183cfcdf038f77ebfb5318612a76676f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): examples/boft_dreambooth/utils/dataset.py:91-109 | examples/deft_dreambooth/train_dreambooth.py:548-566 | examples/hra_dreambooth/utils/dataset.py:93-111 | examples/lora_dreambooth/train_dreambooth.py:543-561 | examples/oft_dreambooth/train_dreambooth.py:553-571 | examples/stable_diffusion/train_dreambooth.py:717-735 \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":"examples/boft_dreambooth/utils/dataset.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4def196a6ba50ad99b1b9cc15558447c60e54873b5cbb1b05b999bb6ecd3c07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): examples/cartridge_self_study/arxiv_train.py:27-101 | examples/cartridge_self_study/train_distill.py:132-208 \u2014 These two members are one piece of code written twice and then edited apart: 75 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":"examples/cartridge_self_study/arxiv_train.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e35c99ed3783b4fe144d657fde39347df674adaa45a9c6234fdcd30581317e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (114 corresponding lines): examples/orthogonal_subspace_learning/osf_continual_learning.py:230-380 | examples/orthogonal_subspace_learning/osf_continual_learning.py:395-508 \u2014 These two members are one piece of code written twice and then edited apart: 114 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":"examples/orthogonal_subspace_learning/osf_continual_learning.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d50be7ffc6fc66521017632d155beab3abd20ba4a8c7d66008d7e65e0c5ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): examples/cartridge_self_study/arxiv_synthesize.py:23-91 | examples/cartridge_self_study/synthesize.py:295-364 \u2014 These two members are one piece of code written twice and then edited apart: 69 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":"examples/cartridge_self_study/arxiv_synthesize.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7e437305e83d815573dc028ddbd0c5037edad4415e3aa663dc4f422db40a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): examples/astra_finetuning/preprocess.py:37-86 | examples/corda_finetuning/preprocess.py:39-100 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"examples/astra_finetuning/preprocess.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ca06d5613707ab75e5d6faa0ed2d14cce6b30942b74c7203209c8626beec21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): examples/orthogonal_subspace_learning/utils.py:181-221 | examples/orthogonal_subspace_learning/utils.py:225-266 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"examples/orthogonal_subspace_learning/utils.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"783c9e67bad9fd075bfa9cbce6f1c6a96419b476a59609166cc5bbf5257ceb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): examples/lora_dreambooth/convert_kohya_ss_sd_lora_to_peft.py:40-75 | examples/stable_diffusion/convert_sd_adapter_to_peft.py:126-161 | examples/stable_diffusion/convert_sd_adapter_to_peft.py:165-204 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 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":"examples/lora_dreambooth/convert_kohya_ss_sd_lora_to_peft.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb232904907aa180d9c06242e2cab01da48215d41893f1057feeaa62765a062"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): examples/kasa_finetuning/kasa_finetuning.py:65-92 | examples/mica_finetuning/mica_finetuning.py:49-76 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/kasa_finetuning/kasa_finetuning.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff33f4cf937ffbcd5f8a409096b40a0a55e29c3293697fa3fee0fa66fcf21689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): examples/stable_diffusion/train_dreambooth.py:90-127 | examples/stable_diffusion/train_dreambooth.py:131-166 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/stable_diffusion/train_dreambooth.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3213e2adde94e18267300a4eb92c8d88ff8de89913bfaf4e56112498b6122e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/astra_finetuning/preprocess.py:29-32 | examples/corda_finetuning/preprocess.py:31-34 \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":"examples/astra_finetuning/preprocess.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60c0d945829fb0e4d3652704c41b80ec8b52ed9142f38cc4d34a8bc3ea4606a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): examples/astra_finetuning/datautils.py:81-83 | examples/corda_finetuning/datautils.py:81-83 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"examples/astra_finetuning/datautils.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7785ae2ea81f8653797c0f5d0cba4f0492eb518815c142da9de9ff8adcd55ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:204-272 | examples/corda_finetuning/corda_finetuning.py:204-272 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"073df7f4612ae0da3b0a87b63a32e8800d7b7f52804f08e25c53a82de34d58eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 6): examples/boft_dreambooth/utils/args_loader.py:41-106 | examples/deft_dreambooth/train_dreambooth.py:75-140 | examples/hra_dreambooth/utils/args_loader.py:43-108 | examples/lora_dreambooth/train_dreambooth.py:75-140 | examples/oft_dreambooth/train_dreambooth.py:76-141 | examples/stable_diffusion/train_dreambooth.py:170-235 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 389 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 \u0060examples/boft_dreambooth/utils/args_loader.py:41\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":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df638014f5f85e9c45ede2ffbd2cb81c17732eee5d8c7e050547a6a67adca4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57\u201359 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:455-513 | examples/deft_dreambooth/train_dreambooth.py:932-988 | examples/hra_dreambooth/train_dreambooth.py:456-514 | examples/lora_dreambooth/train_dreambooth.py:925-981 | examples/oft_dreambooth/train_dreambooth.py:939-995 | examples/stable_diffusion/train_dreambooth.py:1087-1143 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/boft_dreambooth/train_dreambooth.py:517\u0060 calls \u0060save_adaptor\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py:990\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f136be7c94781fc0e9951439ac9fa0de5dbc46b1e6443663a32d03a59223dd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201357 lines \u00D7 8): examples/boft_controlnet/utils/args_loader.py:128-184 | examples/boft_controlnet/utils/args_loader.py:192-193 | examples/boft_dreambooth/utils/args_loader.py:198-254 | examples/deft_dreambooth/train_dreambooth.py:253-309 | examples/hra_dreambooth/utils/args_loader.py:200-256 | examples/lora_dreambooth/train_dreambooth.py:248-304 | examples/oft_dreambooth/train_dreambooth.py:258-314 | examples/stable_diffusion/train_dreambooth.py:296-352 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/boft_dreambooth/utils/args_loader.py:255\u0060 calls \u0060add_argument\u0060 and \u0060examples/boft_controlnet/utils/args_loader.py:193\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a0f22ef872387ede24c1cd95e979d8a58f96daaa24af58879706f0e604310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201356 lines \u00D7 2): examples/cartridge_self_study/arxiv_synthesize.py:37-91 | examples/cartridge_self_study/synthesize.py:309-364 \u2014 before extracting anything, compare \u0060examples/cartridge_self_study/arxiv_synthesize.py\u0060 and \u0060examples/cartridge_self_study/synthesize.py\u0060 as WHOLE FILES: 87% 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/cartridge_self_study/synthesize.py:309\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":"examples/cartridge_self_study/arxiv_synthesize.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd22d50efdd43b1df15b4262ce519d38171a31c5603ef9a18bd1b812d6e4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201354 lines \u00D7 2): examples/orthogonal_subspace_learning/osf_continual_learning.py:243-286 | examples/orthogonal_subspace_learning/osf_continual_learning.py:406-459 \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 \u0060examples/orthogonal_subspace_learning/osf_continual_learning.py:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/orthogonal_subspace_learning/osf_continual_learning.py:239\u0060 calls \u0060from_pretrained\u0060 and \u0060examples/orthogonal_subspace_learning/osf_continual_learning.py:402\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":"examples/orthogonal_subspace_learning/osf_continual_learning.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8385cb6d8f9a914bdb6614315ae10b4b99a507cc0ec3f5f7a030004ddb3b3f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): examples/cartridge_self_study/arxiv_train.py:50-101 | examples/cartridge_self_study/train_distill.py:157-208 \u2014 before extracting anything, compare \u0060examples/cartridge_self_study/arxiv_train.py\u0060 and \u0060examples/cartridge_self_study/train_distill.py\u0060 as WHOLE FILES: 85% 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cartridge_self_study/arxiv_train.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0e3fff1686d1dd18d24ece793849498afa5d2851d4408438fb8dc3d6ae31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201351 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:135-184 | examples/deft_dreambooth/train_dreambooth.py:630-679 | examples/hra_dreambooth/train_dreambooth.py:137-186 | examples/lora_dreambooth/train_dreambooth.py:625-674 | examples/oft_dreambooth/train_dreambooth.py:635-684 | examples/stable_diffusion/train_dreambooth.py:799-849 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c6faeb9d00bcc42376f4f77396240223be7ce0e3d2636b6442459ab00419dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:347-391 | examples/deft_dreambooth/train_dreambooth.py:826-870 | examples/hra_dreambooth/train_dreambooth.py:345-389 | examples/lora_dreambooth/train_dreambooth.py:819-863 | examples/oft_dreambooth/train_dreambooth.py:833-877 | examples/stable_diffusion/train_dreambooth.py:981-1025 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7452843f210b1902d5b6c3f7050afcc346ada2521e9c9b0bfde75d812e15cd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:289-333 | examples/hra_dreambooth/train_dreambooth.py:287-331 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:289\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5562fb90ac9b19469a3cd6e4b366a0e6c6d877400a749f45de8276113390aedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:224-265 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:177-218 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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 \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:224\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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30cc7b69a6dfdd932f54f23a70b1c24e9768853e3bee0e9597f0254313c4f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201342 lines \u00D7 2): examples/orthogonal_subspace_learning/osf_continual_learning.py:52-93 | examples/orthogonal_subspace_learning/osf_continual_learning.py:100-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/orthogonal_subspace_learning/osf_continual_learning.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bb6c4047fd711a30a00bde85c59889886811c1bf11185e882a7b116db33f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): examples/glora_finetuning/glora_finetuning.py:60-100 | examples/hira_finetuning/hira_finetuning.py:58-98 \u2014 \u0060examples/glora_finetuning/glora_finetuning.py\u0060 and \u0060examples/hira_finetuning/hira_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glora_finetuning/glora_finetuning.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07dd2ad1ea513fec30de00cad6ea8873cfb1f6db1f4016423ef7e06ad2ba204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 6): examples/boft_dreambooth/utils/args_loader.py:108-147 | examples/deft_dreambooth/train_dreambooth.py:143-179 | examples/hra_dreambooth/utils/args_loader.py:110-149 | examples/lora_dreambooth/train_dreambooth.py:143-179 | examples/oft_dreambooth/train_dreambooth.py:144-180 | examples/stable_diffusion/train_dreambooth.py:238-276 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 389 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 \u0060examples/boft_dreambooth/utils/args_loader.py:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/deft_dreambooth/train_dreambooth.py:179\u0060 calls \u0060add_argument\u0060 and \u0060examples/stable_diffusion/train_dreambooth.py:276\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72585b71c6d0c2a7e07d1829090dee6c7aa646748585ec744fc9a2036ad946b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 3): examples/feature_extraction/peft_lora_embedding_semantic_search.py:65-103 | examples/int8_training/peft_adalora_whisper_large_training.py:113-152 | examples/loftq_finetuning/train_gsm8k_llama.py:115-154 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 148 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:65\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99e7596b7800a4964a59e453aa6f11b82dba5d1757ef63a1013b5e872c94ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 4): examples/deft_dreambooth/train_dreambooth.py:774-812 | examples/lora_dreambooth/train_dreambooth.py:767-805 | examples/oft_dreambooth/train_dreambooth.py:781-819 | examples/stable_diffusion/train_dreambooth.py:929-967 \u2014 \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/lora_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 45 separate duplicated blocks between them, totalling at least 1182 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_dreambooth/train_dreambooth.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcbecc8f2c42470fd7714235f79b1d8d6e87cffa08489b7a238f9dd5d840940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 3): examples/deft_finetuning/deft_finetuning.py:87-124 | examples/delora_finetuning/delora_finetuning.py:85-122 | examples/supertuning_finetuning/supertuning_finetuning.py:84-121 \u2014 \u0060examples/deft_finetuning/deft_finetuning.py\u0060 and \u0060examples/delora_finetuning/delora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_finetuning/deft_finetuning.py:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62dfa704a523dab47de1005ca1db7ab36f1eae78782068772ac686ce17422b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 6): examples/boft_controlnet/utils/args_loader.py:202-238 | examples/boft_dreambooth/utils/args_loader.py:266-302 | examples/deft_dreambooth/train_dreambooth.py:321-357 | examples/lora_dreambooth/train_dreambooth.py:316-352 | examples/oft_dreambooth/train_dreambooth.py:326-362 | examples/stable_diffusion/train_dreambooth.py:364-400 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:202\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fc91dbfee08f630c0e68f71c342dfb1d7e0b66cebd557dca6ce3ac26f1c2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201336 lines \u00D7 5): examples/alora_finetuning/alora_finetuning.py:129-158 | examples/dora_finetuning/dora_finetuning.py:114-149 | examples/gralora_finetuning/gralora_finetuning.py:95-130 | examples/lily_finetuning/lily_finetuning.py:94-128 | examples/peanut_finetuning/peanut_finetuning.py:96-130 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/alora_finetuning/alora_finetuning.py:129\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":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7bc4f9cbfd80f5fbda2b87697b000f43ed648f19a855348068226cbd52a107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (100 lines \u00D7 2): examples/astra_finetuning/datautils.py:107-206 | examples/corda_finetuning/datautils.py:107-206 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e80c4d3f967f4a2d37e5b6264300028e1c6f4ea05148286775927375b085722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:343-377 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:294-329 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d4dc524510ffffa539ddda30081422f811d41b9ca3ae12a044be9613fb5e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 5): examples/glora_finetuning/glora_finetuning.py:110-143 | examples/hira_finetuning/hira_finetuning.py:106-139 | examples/olora_finetuning/olora_finetuning.py:109-142 | examples/shira_finetuning/shira_finetuning.py:128-161 | examples/waveft_finetuning/waveft_finetuning.py:101-134 \u2014 \u0060examples/glora_finetuning/glora_finetuning.py\u0060 and \u0060examples/hira_finetuning/hira_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/glora_finetuning/glora_finetuning.py:146\u0060 calls \u0060from_pretrained\u0060 and \u0060examples/olora_finetuning/olora_finetuning.py:145\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":"examples/glora_finetuning/glora_finetuning.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf5979e02a7e7716de1e1a29d4a1a877a38943e1e525dd8038adee6cc42871d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 5): examples/boft_dreambooth/train_dreambooth.py:572-604 | examples/deft_dreambooth/train_dreambooth.py:1027-1059 | examples/hra_dreambooth/train_dreambooth.py:569-600 | examples/lora_dreambooth/train_dreambooth.py:1026-1058 | examples/oft_dreambooth/train_dreambooth.py:1034-1066 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py: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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea79dfc63ff123f151bb4f29da2d3c708d4f179dd8d35e556e9451fd43ef9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): examples/orthogonal_subspace_learning/utils.py:189-221 | examples/orthogonal_subspace_learning/utils.py:234-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/orthogonal_subspace_learning/utils.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b8f16e8c8a9d3bf35951075d18c1f7035fa81e57565b9df7c1bc9ecaf41fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 6): examples/boft_dreambooth/utils/dataset.py:25-55 | examples/deft_dreambooth/train_dreambooth.py:482-512 | examples/hra_dreambooth/utils/dataset.py:27-57 | examples/lora_dreambooth/train_dreambooth.py:477-507 | examples/oft_dreambooth/train_dreambooth.py:487-517 | examples/stable_diffusion/train_dreambooth.py:651-681 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/dataset.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 3 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":"examples/boft_dreambooth/utils/dataset.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"53720866a9da58d77509387a5e6cb37866c35361c83b63ff25b25a2ae7695365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): examples/orthogonal_subspace_learning/osf_continual_learning.py:338-368 | examples/orthogonal_subspace_learning/osf_continual_learning.py:471-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/orthogonal_subspace_learning/osf_continual_learning.py:373\u0060 calls \u0060unload\u0060 and \u0060examples/orthogonal_subspace_learning/osf_continual_learning.py:504\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":"examples/orthogonal_subspace_learning/osf_continual_learning.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ac3de89ef08547f5f2cf3bfc3764487326ccbf2ffe32e3c255ab11c59ab363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 6): examples/boft_dreambooth/utils/args_loader.py:307-336 | examples/deft_dreambooth/train_dreambooth.py:356-385 | examples/hra_dreambooth/utils/args_loader.py:321-350 | examples/lora_dreambooth/train_dreambooth.py:351-380 | examples/oft_dreambooth/train_dreambooth.py:361-390 | examples/stable_diffusion/train_dreambooth.py:399-428 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 389 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 \u0060examples/boft_dreambooth/utils/args_loader.py:307\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":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a5aae00a3f8b4f2102c3d7dc73b7bac9a982da90cc9b912e969a3778042f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (135\u2013136 lines \u00D7 4): examples/deft_dreambooth/train_dreambooth.py:587-721 | examples/lora_dreambooth/train_dreambooth.py:582-716 | examples/oft_dreambooth/train_dreambooth.py:592-726 | examples/stable_diffusion/train_dreambooth.py:756-891 \u2014 \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/lora_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 45 separate duplicated blocks between them, totalling at least 1182 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_dreambooth/train_dreambooth.py:587\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":"examples/deft_dreambooth/train_dreambooth.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1940be4da748aacfaf9a1c5c554844113228280062dce10f6bd25561b34d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): examples/adamss_finetuning/glue_adamss_asa_example.py:217-245 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:296-325 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2e2214a00bbbd3a048c20bbdbec2b5fa9f00e6e6afb8876b37e9d09d32f2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 7): examples/boft_controlnet/utils/args_loader.py:192-223 | examples/boft_dreambooth/utils/args_loader.py:256-287 | examples/deft_dreambooth/train_dreambooth.py:311-342 | examples/hra_dreambooth/utils/args_loader.py:258-289 | examples/lora_dreambooth/train_dreambooth.py:306-337 | examples/oft_dreambooth/train_dreambooth.py:316-347 | examples/stable_diffusion/train_dreambooth.py:354-385 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:192\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c1059805c09fb0f63cb41f394f002a9227fbb0d11e8334f2d88ff5b910ca00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:110-138 | examples/loftq_finetuning/train_gsm8k_llama.py:219-247 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:110\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fddbcfde067f729866a408c30cc95853e105cc7fa7426342e7a52fceb32f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 6): examples/boft_dreambooth/utils/args_loader.py:336-363 | examples/deft_dreambooth/train_dreambooth.py:385-408 | examples/hra_dreambooth/utils/args_loader.py:350-377 | examples/lora_dreambooth/train_dreambooth.py:380-403 | examples/oft_dreambooth/train_dreambooth.py:390-413 | examples/stable_diffusion/train_dreambooth.py:554-577 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 389 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 \u0060examples/boft_dreambooth/utils/args_loader.py:336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2614a7f9b16f0db6ca019b035501d0fde269c28a19f14fb9a4cfbafbcdaa088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 4): examples/deft_dreambooth/train_dreambooth.py:1077-1104 | examples/lora_dreambooth/train_dreambooth.py:1076-1103 | examples/oft_dreambooth/train_dreambooth.py:1084-1111 | examples/stable_diffusion/train_dreambooth.py:1244-1271 \u2014 \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/lora_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 45 separate duplicated blocks between them, totalling at least 1182 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_dreambooth/train_dreambooth.py"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00f6ca4d014ec15417e039209612d6b2007530d7c30e4ee5b0ceca309db76da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): examples/astra_finetuning/datautils.py:36-63 | examples/corda_finetuning/datautils.py:36-63 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b2ef5faeb760259e6a31762680b80b046dbc2ed95300f28e1558379e9b49cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:249-276 | examples/hra_dreambooth/train_dreambooth.py:247-274 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8623d130a0dfdf0ac044d01e58719d64c6919d7845266fea55ac3a7b21aaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 6): examples/boft_dreambooth/utils/dataset.py:61-87 | examples/deft_dreambooth/train_dreambooth.py:518-544 | examples/hra_dreambooth/utils/dataset.py:63-89 | examples/lora_dreambooth/train_dreambooth.py:513-539 | examples/oft_dreambooth/train_dreambooth.py:523-549 | examples/stable_diffusion/train_dreambooth.py:687-713 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/dataset.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 3 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/utils/dataset.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a88e6e4f8fc25df829283a095fdca3cc2286ef77c10a08c473a582ce12ab65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 4): examples/deft_finetuning/deft_finetuning.py:106-132 | examples/delora_finetuning/delora_finetuning.py:104-130 | examples/randlora_finetuning/randlora_finetuning.py:137-163 | examples/supertuning_finetuning/supertuning_finetuning.py:103-127 \u2014 \u0060examples/deft_finetuning/deft_finetuning.py\u0060 and \u0060examples/delora_finetuning/delora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_finetuning/deft_finetuning.py:106\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":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0669ac76c631b41aa42c84647eb7045599175c2557f138995cecbcd27d95631f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): examples/feature_extraction/peft_lora_embedding_semantic_search.py:220-246 | examples/int8_training/peft_adalora_whisper_large_training.py:433-459 | examples/loftq_finetuning/train_gsm8k_llama.py:316-342 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 148 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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d7357a3cd2112415b43b05f1f1de1bd2e086c6251a8a14462dae365220ca19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): examples/astra_finetuning/preprocess.py:61-86 | examples/corda_finetuning/preprocess.py:74-100 \u2014 \u0060examples/astra_finetuning/preprocess.py\u0060 and \u0060examples/corda_finetuning/preprocess.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 40 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/astra_finetuning/preprocess.py:61\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":"examples/astra_finetuning/preprocess.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51c713341176e5b96d9f16eb382abd7dd1145cdab40e4f76040917ca1a5ff33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:311-337 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:263-289 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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 \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:311\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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a46c22068f7b6232a4ed80780e79c573ad7306834d78f2b2f1d9cc5926471bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): examples/astra_finetuning/datautils.py:210-235 | examples/corda_finetuning/datautils.py:210-235 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e4ca1350cfb9ad08e4d5d7594a498864727a99f708ea70f71b73ad3755c765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:53-77 | examples/sequence_classification/peft_no_lora_accelerate.py:34-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:53\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c0612afbefb404ed08a243b9b10951621f945c8e881ed875e14cc50d5aef47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 5): examples/boft_dreambooth/utils/args_loader.py:165-186 | examples/deft_dreambooth/train_dreambooth.py:218-241 | examples/hra_dreambooth/utils/args_loader.py:167-188 | examples/lora_dreambooth/train_dreambooth.py:213-236 | examples/oft_dreambooth/train_dreambooth.py:223-246 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 389 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 \u0060examples/boft_dreambooth/utils/args_loader.py:165\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":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c2ca93e747012f17591c5811e3f919447ff0c57312cd4ebff9328a15a86e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 3): examples/alora_finetuning/alora_finetuning.py:116-138 | examples/dora_finetuning/dora_finetuning.py:100-123 | examples/road_finetuning/road_finetuning.py:102-125 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/alora_finetuning/alora_finetuning.py:140\u0060 calls \u0060is_available\u0060, \u0060empty_cache\u0060 and \u0060examples/road_finetuning/road_finetuning.py:128\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":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0137a7eda9276b456ffc727c1717be338ecca466140bafdc46ab99d341447cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:98-121 | examples/hra_dreambooth/train_dreambooth.py:100-123 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3d6822611aa3f8ee86c0095cb6e9d0bef339095127dc174a00cff117b9848e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 7): examples/boft_controlnet/utils/args_loader.py:97-118 | examples/boft_dreambooth/utils/args_loader.py:176-198 | examples/deft_dreambooth/train_dreambooth.py:231-253 | examples/hra_dreambooth/utils/args_loader.py:178-200 | examples/lora_dreambooth/train_dreambooth.py:226-248 | examples/oft_dreambooth/train_dreambooth.py:236-258 | examples/stable_diffusion/train_dreambooth.py:276-296 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:97\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8408d99828d35e3d4a59ee0a69a083046392beda6be55ac58f7358f50b7c3929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 5): examples/glora_finetuning/glora_finetuning.py:68-90 | examples/hira_finetuning/hira_finetuning.py:66-88 | examples/olora_finetuning/olora_finetuning.py:76-98 | examples/shira_finetuning/shira_finetuning.py:67-89 | examples/waveft_finetuning/waveft_finetuning.py:68-90 \u2014 \u0060examples/glora_finetuning/glora_finetuning.py\u0060 and \u0060examples/hira_finetuning/hira_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glora_finetuning/glora_finetuning.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b44a6e432745664084f6bde3cf955d7c8ad2c40f2419837353a81c9ed712d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): examples/boft_controlnet/utils/args_loader.py:228-250 | examples/boft_dreambooth/utils/args_loader.py:292-314 | examples/hra_dreambooth/utils/args_loader.py:306-328 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:228\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba5754ec2421b60ac765c4f0b1e3ed643a744fffdd3f46fc4093fed750672f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:39-61 | examples/corda_finetuning/corda_finetuning.py:39-61 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"817a2f85be605b7b86fa4082d7430edd53bd109316e119d32e75b425555a8cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (144\u2013148 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:414-561 | examples/hra_dreambooth/train_dreambooth.py:415-558 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:414\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a73b279bb9939e667c1b497e96d5da672b477cdd8b0566d40cad6f9aa52a3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:344-365 | examples/boft_dreambooth/train_dreambooth.py:395-414 | examples/deft_dreambooth/train_dreambooth.py:874-893 | examples/hra_dreambooth/train_dreambooth.py:396-415 | examples/lora_dreambooth/train_dreambooth.py:867-886 | examples/oft_dreambooth/train_dreambooth.py:881-900 | examples/stable_diffusion/train_dreambooth.py:1029-1048 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"633fc5d56fe6d9d64a3b2747a72773f4e1c7100a877b65ff28d0108669fb2f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 6): examples/feature_extraction/peft_lora_embedding_semantic_search.py:59-77 | examples/int8_training/peft_adalora_whisper_large_training.py:241-261 | examples/loftq_finetuning/train_gsm8k_llama.py:109-127 | examples/lora_dreambooth/train_dreambooth.py:191-211 | examples/oft_dreambooth/train_dreambooth.py:195-216 | examples/sequence_classification/peft_no_lora_accelerate.py:40-58 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 148 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:59\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"452e118e77dfb292fc5997d63154cd29b727d92d2133a72f64550b4c088266b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/adamss_finetuning/glue_adamss_asa_example.py:358-378 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:387-407 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cae5ec0c1da418f66f000dcc86a66201111c89774ea79d0b67fc203600ab3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): examples/alora_finetuning/alora_finetuning.py:51-70 | examples/dora_finetuning/dora_finetuning.py:52-72 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/alora_finetuning/alora_finetuning.py:51\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":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ada47a6696b42fbda3da5fa099bf11b4270151dfc1178e5b876c9ebc2c3a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:122-142 | examples/corda_finetuning/corda_finetuning.py:122-142 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dc51655d054a0a812e80ed15a1fb3399eb9a048df4ca067bf67baf5c62cf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:346-366 | examples/loftq_finetuning/train_gsm8k_llama.py:615-632 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:346\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/loftq_finetuning/train_gsm8k_llama.py:612\u0060 calls \u0060tie_weights\u0060, \u0060ceil\u0060 and \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:346\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28155e54117bd1cb2eeffffaef28a0ace476ad81e5ab31e27004e40a329c084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/frod_finetuning/frod_image_classification.py:147-167 | examples/frod_finetuning/frod_text_classification.py:96-116 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/frod_finetuning/frod_image_classification.py:147\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":"examples/frod_finetuning/frod_image_classification.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"73242075177762f405f832c54dc9cab7e11ddf3f6d7309b959aa98c140684b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 8): examples/boft_controlnet/utils/args_loader.py:225-244 | examples/boft_dreambooth/utils/args_loader.py:289-308 | examples/deft_dreambooth/train_dreambooth.py:344-363 | examples/hra_dreambooth/utils/args_loader.py:282-301 | examples/hra_dreambooth/utils/args_loader.py:303-322 | examples/lora_dreambooth/train_dreambooth.py:339-358 | examples/oft_dreambooth/train_dreambooth.py:349-368 | examples/stable_diffusion/train_dreambooth.py:387-406 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:225\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c681d8633a8d4c6ffa4833ec3643ac18735922e50882941e080196cd9ea734c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): examples/boft_dreambooth/train_dreambooth.py:279-298 | examples/deft_dreambooth/train_dreambooth.py:766-785 | examples/lora_dreambooth/train_dreambooth.py:759-778 | examples/oft_dreambooth/train_dreambooth.py:773-792 | examples/stable_diffusion/train_dreambooth.py:921-940 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92912d9215424e59728324814da59a9b2568c753dffef74ab90dd141a134274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): examples/deft_finetuning/deft_finetuning.py:80-99 | examples/delora_finetuning/delora_finetuning.py:78-97 | examples/randlora_finetuning/randlora_finetuning.py:109-128 | examples/supertuning_finetuning/supertuning_finetuning.py:77-96 \u2014 \u0060examples/deft_finetuning/deft_finetuning.py\u0060 and \u0060examples/delora_finetuning/delora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_finetuning/deft_finetuning.py:80\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a686015ed37c7b7f426009e05b9ccf98816a43c648ea4152cf359279717e09dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): examples/boft_controlnet/train_controlnet.py:255-274 | examples/hra_dreambooth/train_dreambooth.py:281-296 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 180 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_controlnet/train_controlnet.py:255\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":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fa8e6fe43cfaa7db3f3bf197b8b5d6aed58c555cade0543ae5598045184bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 11): examples/boft_controlnet/train_controlnet.py:518-536 | examples/boft_dreambooth/train_dreambooth.py:598-616 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:259-277 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:297-315 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:212-230 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:249-267 | examples/deft_dreambooth/train_dreambooth.py:1053-1071 | examples/hra_dreambooth/train_dreambooth.py:594-612 | examples/lora_dreambooth/train_dreambooth.py:1052-1070 | examples/oft_dreambooth/train_dreambooth.py:1060-1078 | examples/stable_diffusion/train_dreambooth.py:1220-1238 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"54514c587f9688ba23c46e0eaa11247e8cc10be65f48a53784010161cefb224f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:260-278 | examples/boft_dreambooth/train_dreambooth.py:284-302 | examples/deft_dreambooth/train_dreambooth.py:771-789 | examples/hra_dreambooth/train_dreambooth.py:282-300 | examples/lora_dreambooth/train_dreambooth.py:764-782 | examples/oft_dreambooth/train_dreambooth.py:778-796 | examples/stable_diffusion/train_dreambooth.py:926-944 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/boft_controlnet/train_controlnet.py:281\u0060 calls \u0060parameters\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py:307\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de010a2a0eb86103a788369ac35058bb4801836f8de01e2b364f02f02e4afe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 6): examples/boft_dreambooth/utils/dataset.py:91-109 | examples/deft_dreambooth/train_dreambooth.py:548-566 | examples/hra_dreambooth/utils/dataset.py:93-111 | examples/lora_dreambooth/train_dreambooth.py:543-561 | examples/oft_dreambooth/train_dreambooth.py:553-571 | examples/stable_diffusion/train_dreambooth.py:717-735 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/dataset.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 3 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/utils/dataset.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27b993d291a1731573971984f1dfbc095dfe8c0b2a91a2498451e5aeb79022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): examples/feature_extraction/peft_lora_embedding_semantic_search.py:109-127 | examples/loftq_finetuning/train_gsm8k_llama.py:92-111 | examples/loftq_finetuning/train_gsm8k_llama.py:217-236 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cc1757501c932ad63461dc39b9556fcb846b52291a081b09e163f5a62deac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 3): examples/orthogonal_subspace_learning/osf_continual_learning.py:62-80 | examples/orthogonal_subspace_learning/osf_continual_learning.py:109-124 | examples/orthogonal_subspace_learning/osf_continual_learning.py:154-169 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/orthogonal_subspace_learning/osf_continual_learning.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c793d646e7fe7b50f2834af5f6211dfff75e6149c3b4fb09d4c32703a2f3c6d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:116-133 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:112-130 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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 \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:116\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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97794facc19af68b97e80026a38cbce63613548d5240ed976574f04668a7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:198-215 | examples/conditional_generation/peft_lora_seq2seq_accelerate_fsdp.py:54-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e33555c3a4ef2eaa87a450ad285e775b1b572503985d25450ab117c198543a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): examples/stable_diffusion/train_dreambooth.py:484-502 | examples/stable_diffusion/train_dreambooth.py:525-543 \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 \u0060examples/stable_diffusion/train_dreambooth.py:484\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":"examples/stable_diffusion/train_dreambooth.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a6030a0f875cb275165560d872d0f1fe398cc670bed7b829072ff62f3fa681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:325-339 | examples/deft_dreambooth/train_dreambooth.py:801-818 | examples/hra_dreambooth/train_dreambooth.py:323-337 | examples/lora_dreambooth/train_dreambooth.py:794-811 | examples/oft_dreambooth/train_dreambooth.py:808-825 | examples/stable_diffusion/train_dreambooth.py:956-973 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:325\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0d5ba2bd35cb0b168a8b75ca5037a51f340dd6e8b87378af78701067762474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): examples/boft_controlnet/train_controlnet.py:135-152 | examples/boft_dreambooth/train_dreambooth.py:202-219 | examples/hra_dreambooth/train_dreambooth.py:204-221 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_controlnet/train_controlnet.py:135\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":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdada52ead6c7ac995140a0b9bfca931949fceff2dac0d6a5f28e4b07fb8145b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): examples/stable_diffusion/train_dreambooth.py:446-463 | examples/stable_diffusion/train_dreambooth.py:481-498 | examples/stable_diffusion/train_dreambooth.py:522-539 \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 \u0060examples/stable_diffusion/train_dreambooth.py:446\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":"examples/stable_diffusion/train_dreambooth.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e759739bf85fe9115e0c2298d821f926529c9820b638b9499331e9118d11266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:401-418 | examples/loftq_finetuning/train_gsm8k_llama.py:665-682 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"998936869d86fb7be6743079f637a1610f3d532849343868550f9ecdf99eb639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): examples/lily_finetuning/lily_finetuning.py:58-75 | examples/peanut_finetuning/peanut_finetuning.py:60-77 \u2014 \u0060examples/lily_finetuning/lily_finetuning.py\u0060 and \u0060examples/peanut_finetuning/peanut_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 132 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/lily_finetuning/lily_finetuning.py:58\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":"examples/lily_finetuning/lily_finetuning.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"13439a9cb29b798d0b201db6496ee0afd34ec4dc2cd6eea1b9ed136f0f23b519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:305-321 | examples/boft_dreambooth/train_dreambooth.py:341-357 | examples/deft_dreambooth/train_dreambooth.py:820-836 | examples/hra_dreambooth/train_dreambooth.py:339-355 | examples/lora_dreambooth/train_dreambooth.py:813-829 | examples/oft_dreambooth/train_dreambooth.py:827-843 | examples/stable_diffusion/train_dreambooth.py:975-991 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_controlnet/train_controlnet.py:305\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":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d1615c0f47901d3bb7a6c37489f41b122b3a8ba4fc49c1090e6c9a876fda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:569-585 | examples/deft_dreambooth/train_dreambooth.py:1024-1040 | examples/hra_dreambooth/train_dreambooth.py:566-582 | examples/lora_dreambooth/train_dreambooth.py:1023-1039 | examples/oft_dreambooth/train_dreambooth.py:1031-1047 | examples/stable_diffusion/train_dreambooth.py:1189-1205 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/stable_diffusion/train_dreambooth.py:1208\u0060 calls \u0060train\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py:587\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4648d527de9522413a1044be347389f41c09b736e79af8b0489b40243fdc3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): examples/boft_dreambooth/utils/args_loader.py:11-27 | examples/deft_dreambooth/train_dreambooth.py:55-71 | examples/hra_dreambooth/utils/args_loader.py:13-29 | examples/lora_dreambooth/train_dreambooth.py:55-71 | examples/oft_dreambooth/train_dreambooth.py:56-72 | examples/stable_diffusion/train_dreambooth.py:70-86 \u2014 before extracting anything, compare \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 389 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/utils/args_loader.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3f35d9544ca71001fdf6941c5a25f80f66d99c595672c8b7b7e0841ea1772e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:106-121 | examples/boft_dreambooth/train_dreambooth.py:115-128 | examples/deft_dreambooth/train_dreambooth.py:610-623 | examples/hra_dreambooth/train_dreambooth.py:117-130 | examples/lora_dreambooth/train_dreambooth.py:605-618 | examples/oft_dreambooth/train_dreambooth.py:615-628 | examples/stable_diffusion/train_dreambooth.py:779-792 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/boft_dreambooth/train_dreambooth.py:109\u0060 calls \u0060ValueError\u0060 and \u0060examples/boft_controlnet/train_controlnet.py:103\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":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ba779f7b5b5972d53f39910f0455501f49af2a47213c6d04735ea8d7374cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7): examples/deft_dreambooth/train_dreambooth.py:678-693 | examples/feature_extraction/peft_lora_embedding_semantic_search.py:238-253 | examples/int8_training/peft_adalora_whisper_large_training.py:451-466 | examples/loftq_finetuning/train_gsm8k_llama.py:334-349 | examples/lora_dreambooth/train_dreambooth.py:673-688 | examples/oft_dreambooth/train_dreambooth.py:683-698 | examples/stable_diffusion/train_dreambooth.py:848-863 \u2014 \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/lora_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 45 separate duplicated blocks between them, totalling at least 1182 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_dreambooth/train_dreambooth.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda28415eb06f14eaf2e6c06cd73a537b37cc41ec2463c41c8b4eee6968d03fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 6): examples/alora_finetuning/alora_finetuning.py:113-127 | examples/dora_finetuning/dora_finetuning.py:97-112 | examples/gralora_finetuning/gralora_finetuning.py:79-94 | examples/lily_finetuning/lily_finetuning.py:78-93 | examples/peanut_finetuning/peanut_finetuning.py:80-95 | examples/road_finetuning/road_finetuning.py:99-114 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/alora_finetuning/alora_finetuning.py:113\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"200556cf1f02fd3db8d4bfbfbfa1329367a56d1288258e2eda12e04e4db53323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 6): examples/alora_finetuning/alora_finetuning.py:138-151 | examples/dora_finetuning/dora_finetuning.py:123-138 | examples/gralora_finetuning/gralora_finetuning.py:104-119 | examples/lily_finetuning/lily_finetuning.py:103-118 | examples/peanut_finetuning/peanut_finetuning.py:105-120 | examples/qalora_finetuning/qalora_gptq_finetuning.py:256-271 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/alora_finetuning/alora_finetuning.py:138\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":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2bd5a86375d04edb9a28aa698d02ee7be6ccede5dee0a00c6821e163a19e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 5): examples/boft_dreambooth/train_dreambooth.py:543-558 | examples/deft_dreambooth/train_dreambooth.py:1011-1021 | examples/hra_dreambooth/train_dreambooth.py:544-555 | examples/lora_dreambooth/train_dreambooth.py:1010-1020 | examples/oft_dreambooth/train_dreambooth.py:1018-1028 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e54c50dc280b5e15c471cf5f0667e3c230acb8507a63f6d4d5a1324e71f0289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:103-118 | examples/corda_finetuning/corda_finetuning.py:103-118 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe31fab8bf47684fe365a0357d189035da4c6e046d07283d6e42221fae63406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:26-41 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:20-35 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b011764636f4cb530438c3e683b86f28f2e58ff73d629b347aa03fa3131a7b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): examples/deft_finetuning/deft_finetuning.py:63-78 | examples/delora_finetuning/delora_finetuning.py:61-76 \u2014 \u0060examples/deft_finetuning/deft_finetuning.py\u0060 and \u0060examples/delora_finetuning/delora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_finetuning/deft_finetuning.py:63\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":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37d51bf43a9b6d58dfe3dbf8f598539752eb9c7c22d0212384741270c2c213c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 10): examples/alora_finetuning/alora_finetuning.py:145-159 | examples/deft_finetuning/deft_finetuning.py:115-133 | examples/delora_finetuning/delora_finetuning.py:113-131 | examples/dora_finetuning/dora_finetuning.py:132-150 | examples/gralora_finetuning/gralora_finetuning.py:113-131 | examples/lily_finetuning/lily_finetuning.py:112-129 | examples/peanut_finetuning/peanut_finetuning.py:114-131 | examples/randlora_finetuning/randlora_finetuning.py:146-164 | examples/road_finetuning/road_finetuning.py:131-149 | examples/supertuning_finetuning/supertuning_finetuning.py:112-128 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b2097935ec6e8d70aef9e0f45c351186307b1407a0726ad236c2cc3a878407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 10): examples/deft_finetuning/deft_finetuning.py:73-87 | examples/delora_finetuning/delora_finetuning.py:71-85 | examples/dora_finetuning/dora_finetuning.py:89-103 | examples/gralora_finetuning/gralora_finetuning.py:71-85 | examples/lily_finetuning/lily_finetuning.py:70-84 | examples/paca_finetuning/paca_finetuning.py:63-73 | examples/peanut_finetuning/peanut_finetuning.py:72-86 | examples/randlora_finetuning/randlora_finetuning.py:102-116 | examples/road_finetuning/road_finetuning.py:91-105 | examples/supertuning_finetuning/supertuning_finetuning.py:70-84 \u2014 \u0060examples/deft_finetuning/deft_finetuning.py\u0060 and \u0060examples/delora_finetuning/delora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/supertuning_finetuning/supertuning_finetuning.py:67\u0060 calls \u0060print_trainable_parameters\u0060 and \u0060examples/deft_finetuning/deft_finetuning.py:70\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":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edd71dab8dc21a65dc59196ea5c9c514553d2b41ec285360795cb2aeee329f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:130-144 | examples/boft_dreambooth/train_dreambooth.py:197-211 | examples/deft_dreambooth/train_dreambooth.py:694-708 | examples/hra_dreambooth/train_dreambooth.py:199-213 | examples/lora_dreambooth/train_dreambooth.py:689-703 | examples/oft_dreambooth/train_dreambooth.py:699-713 | examples/stable_diffusion/train_dreambooth.py:864-878 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ed186335667b3f24d63bb5506440815410861fa2dad27355746f865e8abb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:423-437 | examples/boft_dreambooth/train_dreambooth.py:452-465 | examples/deft_dreambooth/train_dreambooth.py:929-942 | examples/hra_dreambooth/train_dreambooth.py:453-466 | examples/lora_dreambooth/train_dreambooth.py:922-935 | examples/oft_dreambooth/train_dreambooth.py:936-949 | examples/stable_diffusion/train_dreambooth.py:1084-1097 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b235920ee3688a3337a6ee937cec031f692051be72c0abe78ebd007866bda414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7): examples/boft_controlnet/utils/args_loader.py:83-97 | examples/boft_dreambooth/utils/args_loader.py:129-143 | examples/deft_dreambooth/train_dreambooth.py:164-178 | examples/hra_dreambooth/utils/args_loader.py:131-145 | examples/lora_dreambooth/train_dreambooth.py:164-178 | examples/oft_dreambooth/train_dreambooth.py:165-179 | examples/stable_diffusion/train_dreambooth.py:259-273 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/stable_diffusion/train_dreambooth.py:274\u0060 calls \u0060add_argument\u0060 and \u0060examples/boft_controlnet/utils/args_loader.py:97\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd05ae28f2c86b4a1dc7b8f5e7b147c92b32ac2c0fb31dde7095202a19a9abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): examples/deft_dreambooth/train_dreambooth.py:749-763 | examples/lora_dreambooth/train_dreambooth.py:742-756 | examples/oft_dreambooth/train_dreambooth.py:756-770 | examples/stable_diffusion/train_dreambooth.py:906-919 \u2014 \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/lora_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 45 separate duplicated blocks between them, totalling at least 1182 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_dreambooth/train_dreambooth.py:749\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":"examples/deft_dreambooth/train_dreambooth.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4513090bf23c06e394eae9e845900940ff9d75f8be9fa51f08991f3ec6d6567d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:533-546 | examples/deft_dreambooth/train_dreambooth.py:1001-1014 | examples/hra_dreambooth/train_dreambooth.py:534-547 | examples/lora_dreambooth/train_dreambooth.py:1000-1013 | examples/oft_dreambooth/train_dreambooth.py:1008-1021 | examples/stable_diffusion/train_dreambooth.py:1162-1175 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:533\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, \u0060examples/stable_diffusion/train_dreambooth.py:1178\u0060 calls \u0060eval\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py:549\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4628db8a7e81b98e78119c30a6e91dbe030973a490a89af90896ca714885682c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 5): examples/deft_finetuning/deft_finetuning.py:37-50 | examples/delora_finetuning/delora_finetuning.py:36-49 | examples/paca_finetuning/paca_finetuning.py:36-46 | examples/randlora_finetuning/randlora_finetuning.py:41-54 | examples/supertuning_finetuning/supertuning_finetuning.py:36-49 \u2014 \u0060examples/deft_finetuning/deft_finetuning.py\u0060 and \u0060examples/delora_finetuning/delora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/deft_finetuning/deft_finetuning.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11d89e9bda3fcacc52853cd3d362f12b3c41d5a25b088befeab15caf11dc47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): examples/feature_extraction/peft_lora_embedding_semantic_search.py:64-77 | examples/int8_training/peft_adalora_whisper_large_training.py:112-125 | examples/int8_training/peft_adalora_whisper_large_training.py:246-263 | examples/loftq_finetuning/train_gsm8k_llama.py:114-127 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 148 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py: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. 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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3d5373a5856141b7b8625c735859d6aef697326e73054f5fa87cb440c3c8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): examples/glora_finetuning/glora_finetuning.py:52-65 | examples/hira_finetuning/hira_finetuning.py:50-63 | examples/shira_finetuning/shira_finetuning.py:51-64 | examples/waveft_finetuning/waveft_finetuning.py:52-65 \u2014 \u0060examples/glora_finetuning/glora_finetuning.py\u0060 and \u0060examples/hira_finetuning/hira_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glora_finetuning/glora_finetuning.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e718d2df610bd4a7f69afadc913d8b1053731367678233cf2cf7c7f7b7208368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): examples/adamss_finetuning/glue_adamss_asa_example.py:351-363 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:380-392 | examples/adamss_finetuning/image_classification_adamss_asa.py:426-438 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/adamss_finetuning/glue_adamss_asa_example.py:364\u0060 calls \u0060get\u0060 and \u0060examples/adamss_finetuning/image_classification_adamss_asa.py:439\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":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a8cec7ca8e81a3f6765f272fecff187ddb7e025fd3958eacfa44e970e41c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/adamss_finetuning/glue_adamss_asa_example.py:300-312 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:251-263 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b89e5bd7fac58931a7a7ed12b65e5e62ef48372d9bd111cf453fc960626e22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/astra_finetuning/preprocess.py:37-49 | examples/corda_finetuning/preprocess.py:48-60 \u2014 \u0060examples/astra_finetuning/preprocess.py\u0060 and \u0060examples/corda_finetuning/preprocess.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 40 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/preprocess.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bc72be63f1daa3802b57997d309884d5c7255ec431a359f2907ccbfa24d091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/boft_controlnet/train_controlnet.py:184-196 | examples/boft_dreambooth/train_dreambooth.py:237-249 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b85084340029db1591e3ba2dbc88cde9cb168b2fa1b1ac640ff9e297cc9423a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9): examples/boft_controlnet/utils/tracemalloc.py:48-59 | examples/boft_dreambooth/utils/tracemalloc.py:48-59 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:95-106 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:89-100 | examples/deft_dreambooth/train_dreambooth.py:451-462 | examples/hra_dreambooth/utils/tracemalloc.py:50-61 | examples/lora_dreambooth/train_dreambooth.py:446-457 | examples/oft_dreambooth/train_dreambooth.py:456-467 | examples/stable_diffusion/train_dreambooth.py:620-631 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/tracemalloc.py\u0060 and \u0060examples/boft_dreambooth/utils/tracemalloc.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"examples/boft_controlnet/utils/tracemalloc.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b52257cf9e34267f8905d44602cda2a046e12319a2ecf1c8cf260af897fad79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 6): examples/astra_finetuning/datautils.py:143-153 | examples/astra_finetuning/datautils.py:155-165 | examples/astra_finetuning/datautils.py:168-179 | examples/corda_finetuning/datautils.py:143-153 | examples/corda_finetuning/datautils.py:155-165 | examples/corda_finetuning/datautils.py:168-179 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/astra_finetuning/datautils.py:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f350cf0f2d9931131c844276e195c114c73b7bf785a0b0b2ed55fe538282ab1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:437-448 | examples/deft_dreambooth/train_dreambooth.py:914-925 | examples/hra_dreambooth/train_dreambooth.py:438-449 | examples/lora_dreambooth/train_dreambooth.py:907-918 | examples/oft_dreambooth/train_dreambooth.py:921-932 | examples/stable_diffusion/train_dreambooth.py:1069-1080 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9980af4c2ea3a599b5cd9623f335b7edc7c6800f640c66ef54ecc28e02075b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 5): examples/alora_finetuning/alora_finetuning.py:38-47 | examples/dora_finetuning/dora_finetuning.py:38-49 | examples/gralora_finetuning/gralora_finetuning.py:38-49 | examples/lily_finetuning/lily_finetuning.py:37-48 | examples/peanut_finetuning/peanut_finetuning.py:38-49 \u2014 \u0060examples/alora_finetuning/alora_finetuning.py\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 144 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/alora_finetuning/alora_finetuning.py:49\u0060 calls \u0060encode\u0060 and \u0060examples/dora_finetuning/dora_finetuning.py:52\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/alora_finetuning/alora_finetuning.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b1745a40e4cdbbd7c2ebf83a9b9a0a4bf46789c5439a3e9fd1f396fb7d5e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/stable_diffusion/convert_sd_adapter_to_peft.py:165-179 | examples/stable_diffusion/convert_sd_adapter_to_peft.py:208-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060info\u0060 to \u0060dict[str, LoHaInfo]\u0060 in one and \u0060dict[str, LoKrInfo]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/stable_diffusion/convert_sd_adapter_to_peft.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1cc2c9eb9ff72fb62125aeb089681ed150c5b364684d1129ee327376a2d8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): examples/boft_controlnet/utils/tracemalloc.py:19-29 | examples/boft_dreambooth/utils/tracemalloc.py:19-29 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:66-76 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:60-70 | examples/deft_dreambooth/train_dreambooth.py:422-432 | examples/hra_dreambooth/utils/tracemalloc.py:21-31 | examples/lora_dreambooth/train_dreambooth.py:417-427 | examples/oft_dreambooth/train_dreambooth.py:427-437 | examples/stable_diffusion/train_dreambooth.py:591-601 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/tracemalloc.py\u0060 and \u0060examples/boft_dreambooth/utils/tracemalloc.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/boft_controlnet/utils/tracemalloc.py:18\u0060 calls \u0060collect\u0060 and \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:65\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":"examples/boft_controlnet/utils/tracemalloc.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c49d41a00a0e9a1ee5a95faadb71284812537c6db625bf769f0fcdab604723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:418-428 | examples/deft_dreambooth/train_dreambooth.py:897-907 | examples/hra_dreambooth/train_dreambooth.py:419-429 | examples/lora_dreambooth/train_dreambooth.py:890-900 | examples/oft_dreambooth/train_dreambooth.py:904-914 | examples/stable_diffusion/train_dreambooth.py:1052-1062 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb2aca3f9146bee37dba277e170ba8cc44f9e79f22f0b13161fdd02bf5d00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/adamss_finetuning/glue_adamss_asa_example.py:227-237 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:307-317 | examples/adamss_finetuning/image_classification_adamss_asa.py:330-341 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/adamss_finetuning/glue_adamss_asa_example.py:227\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":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87b3dbe4727e5d936f4eff1382e9f512df27315ddf0ff279e44109367acd8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/adamss_finetuning/glue_adamss_asa_example.py:299-309 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:250-260 | examples/adamss_finetuning/image_classification_adamss_asa.py:368-378 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/adamss_finetuning/glue_adamss_asa_example.py:299\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":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec865d8e07a7213be4bfbc7a0de4371d2828dd0800b57a4d7e2a1c639ee61d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:150-160 | examples/corda_finetuning/corda_finetuning.py:150-160 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abeb9f564630b038a062e90da1530ccb0ad9dbbc20e774e330351c002fe610e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:170-181 | examples/corda_finetuning/corda_finetuning.py:170-181 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a238c111d3e31287f5ffbaefae6f52e05d7b5a5b53fc9a169291b7e37f8cad28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/astra_finetuning/datautils.py:67-77 | examples/corda_finetuning/datautils.py:67-77 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15c2ed0e555d6bef8d9530ac8bd10f101ec92a255afea156953531ce49afeae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/boft_controlnet/utils/args_loader.py:402-413 | examples/stable_diffusion/train_dreambooth.py:553-563 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/stable_diffusion/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 218 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 \u0060examples/boft_controlnet/utils/args_loader.py:402\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e14d6bffea9e264b2ed0d2c08f2716e700b825e514dce469b54abd1052cd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:145-156 | examples/conditional_generation/peft_lora_seq2seq_accelerate_fsdp.py:49-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_fsdp.py:48\u0060 calls \u0060tokenizer\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:145\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2697efe237b155f281440cb2818ece413072b212b1d6d8305dc57505c8523a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:446-456 | examples/loftq_finetuning/train_gsm8k_llama.py:709-718 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad5b9278c8a3f00dbd696213f722d78e0641cce4d8616012d314fdf9b97c695"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 5): examples/glora_finetuning/glora_finetuning.py:51-60 | examples/hira_finetuning/hira_finetuning.py:49-58 | examples/olora_finetuning/olora_finetuning.py:52-60 | examples/shira_finetuning/shira_finetuning.py:50-58 | examples/waveft_finetuning/waveft_finetuning.py:51-59 \u2014 \u0060examples/glora_finetuning/glora_finetuning.py\u0060 and \u0060examples/hira_finetuning/hira_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glora_finetuning/glora_finetuning.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c8aeef8ed4f8e51fce898b57eb405476d5307d6a2b7a850ff12f55ddda84ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): examples/boft_controlnet/train_controlnet.py:283-293 | examples/boft_dreambooth/train_dreambooth.py:307-316 | examples/hra_dreambooth/train_dreambooth.py:305-314 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/boft_controlnet/train_controlnet.py:281\u0060 calls \u0060parameters\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py:305\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":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dd4274d1f05a1bccdc66827af4bf2f30258ca35ac17700321d82a400a162a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:71-80 | examples/hra_dreambooth/train_dreambooth.py:71-80 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"24777dbf7749da3117cbcebe0d1d2e8ad088b3d239cbeafa40f5818f217f41f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:382-391 | examples/loftq_finetuning/train_gsm8k_llama.py:642-651 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8ea4937d6c04af40f5722270831e1e18b205147d9be6ad9a011b02c05ddd6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/kasa_finetuning/kasa_finetuning.py:75-84 | examples/mica_finetuning/mica_finetuning.py:59-68 \u2014 \u0060examples/kasa_finetuning/kasa_finetuning.py\u0060 and \u0060examples/mica_finetuning/mica_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/kasa_finetuning/kasa_finetuning.py: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":"examples/kasa_finetuning/kasa_finetuning.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53029c7ee1ee2a74fd0c75847db58eb5a378eb2b1226adc1ff9488185d46b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/stable_diffusion/train_dreambooth.py:473-482 | examples/stable_diffusion/train_dreambooth.py:508-517 \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 \u0060examples/stable_diffusion/train_dreambooth.py:473\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":"examples/stable_diffusion/train_dreambooth.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e4deda464c783e4cf0d339a8b4c295ce7ece5df71153794bebb8459e855250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): examples/orthogonal_subspace_learning/osf_continual_learning.py:88-96 | examples/orthogonal_subspace_learning/osf_continual_learning.py:131-139 | examples/orthogonal_subspace_learning/osf_continual_learning.py:179-187 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/orthogonal_subspace_learning/osf_continual_learning.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3887f054c6a375568a504467cb757a56744c3794683f488a173c92358669cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/boft_controlnet/train_controlnet.py:407-415 | examples/stable_diffusion/train_dreambooth.py:1068-1076 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/stable_diffusion/train_dreambooth.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 140 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/stable_diffusion/train_dreambooth.py:1065\u0060 calls \u0060train\u0060 and \u0060examples/boft_controlnet/train_controlnet.py:406\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":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21ebaf0bd892e438442a471bbfa3e62d5973becac1f7652faf8137a45dbf743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/cartridge_self_study/arxiv_train.py:33-45 | examples/cartridge_self_study/train_distill.py:138-150 \u2014 before extracting anything, compare \u0060examples/cartridge_self_study/arxiv_train.py\u0060 and \u0060examples/cartridge_self_study/train_distill.py\u0060 as WHOLE FILES: 85% 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cartridge_self_study/arxiv_train.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e983af8f64981b4d63a8464a4b0bdc1d7722ef651b279d0e246dfce8abbb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:330-338 | examples/loftq_finetuning/train_gsm8k_llama.py:592-600 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:330\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6882f7aa8f0fcfdc85dfb0c3551244d338a018b54487f7e191d46baea65d7106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/int8_training/peft_adalora_whisper_large_training.py:734-742 | examples/int8_training/peft_adalora_whisper_large_training.py:758-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/int8_training/peft_adalora_whisper_large_training.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"077bd4a6a0a2bc3532ac05d0e561c48b7cb561cf293a5ef2e9093f8880256ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/kasa_finetuning/kasa_finetuning.py:65-73 | examples/mica_finetuning/mica_finetuning.py:49-57 \u2014 \u0060examples/kasa_finetuning/kasa_finetuning.py\u0060 and \u0060examples/mica_finetuning/mica_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/kasa_finetuning/kasa_finetuning.py:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/kasa_finetuning/kasa_finetuning.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b46cdbdead37d629dd938ffb6a170aa3c9bc3f24673e868055794c0c711944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): examples/orthogonal_subspace_learning/utils.py:83-91 | examples/orthogonal_subspace_learning/utils.py:109-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/orthogonal_subspace_learning/utils.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"342d04855de28be58cb07656c11d2c176676687216cef196eb6ef3e08f0f22ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): examples/boft_controlnet/train_controlnet.py:408-415 | examples/boft_dreambooth/train_dreambooth.py:437-444 | examples/deft_dreambooth/train_dreambooth.py:914-921 | examples/hra_dreambooth/train_dreambooth.py:438-445 | examples/lora_dreambooth/train_dreambooth.py:907-914 | examples/oft_dreambooth/train_dreambooth.py:921-928 | examples/stable_diffusion/train_dreambooth.py:1069-1076 \u2014 \u0060examples/boft_controlnet/train_controlnet.py\u0060 and \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 173 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a03da1962832b4bbbe901c5d5e0afb26a8c0304b517516fb8f273fd17435d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:216-222 | examples/deft_dreambooth/train_dreambooth.py:716-723 | examples/hra_dreambooth/train_dreambooth.py:218-224 | examples/lora_dreambooth/train_dreambooth.py:711-718 | examples/oft_dreambooth/train_dreambooth.py:721-728 | examples/stable_diffusion/train_dreambooth.py:886-893 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/deft_dreambooth/train_dreambooth.py:716\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/boft_dreambooth/train_dreambooth.py:211\u0060 calls \u0060import_model_class_from_model_name_or_path\u0060, \u0060from_pretrained\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py:716\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6da4458cca6a588b3c5ad58867e983ff0d333da095313252388e3690aabb321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): examples/boft_controlnet/utils/args_loader.py:396-403 | examples/boft_dreambooth/utils/args_loader.py:160-167 | examples/lora_dreambooth/train_dreambooth.py:184-191 | examples/stable_diffusion/train_dreambooth.py:439-446 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ef8569851b3ee2d95d189219033521cceaf10a38e700bbefbd053c3b75be84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): examples/feature_extraction/peft_lora_embedding_semantic_search.py:98-103 | examples/int8_training/peft_adalora_whisper_large_training.py:146-153 | examples/loftq_finetuning/train_gsm8k_llama.py:148-155 | examples/sequence_classification/peft_no_lora_accelerate.py:60-66 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 148 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 \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py:98\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd699188e339dc7f914a5c09aeb590ecd618f7f1af14f4e1fe5a0ab400caf79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:322-329 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:274-281 | examples/conditional_generation/peft_lora_seq2seq_accelerate_fsdp.py:119-126 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fb895b1636a6bdd5c442932e4e8757f2a5516193a3ca3a04fd6ee79f04e1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): examples/feature_extraction/peft_lora_embedding_semantic_search.py:379-388 | examples/int8_training/peft_adalora_whisper_large_training.py:656-664 | examples/loftq_finetuning/train_gsm8k_llama.py:639-647 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 148 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/loftq_finetuning/train_gsm8k_llama.py:638\u0060 calls \u0060info\u0060 and \u0060examples/int8_training/peft_adalora_whisper_large_training.py:655\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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fd7706d50a9f8c3fa2361c44a97d647a89c276c2306442781c456eb22b502b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:84-91 | examples/hra_dreambooth/train_dreambooth.py:84-91 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:84\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"da841d992f8ebd0a3a0f29b139a10d673f70ef25a2c7137d7723da3d65b44462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): examples/boft_dreambooth/train_dreambooth.py:191-197 | examples/deft_dreambooth/train_dreambooth.py:688-694 | examples/feature_extraction/peft_lora_embedding_semantic_search.py:248-254 | examples/hra_dreambooth/train_dreambooth.py:193-199 | examples/int8_training/peft_adalora_whisper_large_training.py:461-467 | examples/loftq_finetuning/train_gsm8k_llama.py:344-350 | examples/lora_dreambooth/train_dreambooth.py:683-689 | examples/oft_dreambooth/train_dreambooth.py:693-699 | examples/stable_diffusion/train_dreambooth.py:858-864 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb5c1422679d3f869854615ddea6803405b8ee1034ce3aa9303bd6f6a80db4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): examples/astra_finetuning/datautils.py:146-152 | examples/astra_finetuning/datautils.py:158-164 | examples/astra_finetuning/datautils.py:172-178 | examples/astra_finetuning/datautils.py:187-194 | examples/corda_finetuning/datautils.py:146-152 | examples/corda_finetuning/datautils.py:158-164 | examples/corda_finetuning/datautils.py:172-178 | examples/corda_finetuning/datautils.py:187-194 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/astra_finetuning/datautils.py:187\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e398524c2ac64f1efad84c6d97bf18b95b7fe5ccf6a45c943abdb08c6552d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): examples/boft_dreambooth/train_dreambooth.py:519-525 | examples/deft_dreambooth/train_dreambooth.py:990-996 | examples/hra_dreambooth/train_dreambooth.py:520-526 | examples/lora_dreambooth/train_dreambooth.py:989-995 | examples/oft_dreambooth/train_dreambooth.py:997-1003 | examples/stable_diffusion/train_dreambooth.py:1151-1157 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 449 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:519\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, \u0060examples/boft_dreambooth/train_dreambooth.py:517\u0060 calls \u0060save_adaptor\u0060 and \u0060examples/deft_dreambooth/train_dreambooth.py:988\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a34421cdd2548a81861c3f06f55f593214df896d8333edf7c42b7cbd7a424f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:155-161 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:174-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9662eaf3ce5434ac2bb4af0967644108c5eef7d3d85c04da4c58bfd1d4cbb15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:238-244 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:286-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:237\u0060 calls \u0060TorchTracemalloc\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:285\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":"examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"066d9a514bb672617aa2f0013e40a6966e0828dd5a2bbc05261bd8f41388b8ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): examples/boft_controlnet/utils/args_loader.py:94-102 | examples/boft_controlnet/utils/args_loader.py:390-395 | examples/boft_dreambooth/utils/args_loader.py:154-159 | examples/stable_diffusion/train_dreambooth.py:273-281 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:94\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/stable_diffusion/train_dreambooth.py:271\u0060 calls \u0060add_argument\u0060 and \u0060examples/boft_controlnet/utils/args_loader.py:93\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8936fccc7235894bd2bfd33b31b68265d8a7554a968413fbe7a8d68f1e1936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:285-291 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:334-340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:284\u0060 calls \u0060TorchTracemalloc\u0060 and \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:333\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":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"462edc214042c0aa7da47223dea167eba4666128130c8592693641e230e5ea66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/feature_extraction/peft_lora_embedding_semantic_search.py:394-399 | examples/loftq_finetuning/train_gsm8k_llama.py:653-658 \u2014 before extracting anything, compare \u0060examples/feature_extraction/peft_lora_embedding_semantic_search.py\u0060 and \u0060examples/loftq_finetuning/train_gsm8k_llama.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 272 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":"examples/feature_extraction/peft_lora_embedding_semantic_search.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c0851b1c3767762c3db8d2d5bbe5dbb3f9b5fc97c3d22e00bf02e81da134e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): examples/boft_controlnet/utils/args_loader.py:396-400 | examples/boft_dreambooth/utils/args_loader.py:160-164 | examples/lora_dreambooth/train_dreambooth.py:184-188 | examples/lora_ga_finetuning/lora_ga_finetuning.py:48-52 | examples/stable_diffusion/train_dreambooth.py:439-443 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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 \u0060examples/boft_controlnet/utils/args_loader.py:396\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":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf5f63eeada03bb7feefe0e87363868bae2b363d5b7503eeb29a9734fb23b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/adamss_finetuning/glue_adamss_asa_example.py:257-261 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:329-333 | examples/adamss_finetuning/image_classification_adamss_asa.py:414-421 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/adamss_finetuning/image_classification_adamss_asa.py:414\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":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"714d9ed35e2ad327f5fd13604c80f5741940e9454befec579ab60a7758aec92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): examples/stable_diffusion/convert_sd_adapter_to_peft.py:137-144 | examples/stable_diffusion/convert_sd_adapter_to_peft.py:176-183 | examples/stable_diffusion/convert_sd_adapter_to_peft.py:219-226 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060info\u0060 to \u0060dict[str, LoRAInfo]\u0060 in one and \u0060dict[str, LoHaInfo]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/stable_diffusion/convert_sd_adapter_to_peft.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1af5d6f9171ed616131ce0578563d35bb89d1c42d2c9419e607faaac5e5c0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/beft_finetuning/beft_finetuning.py:36-43 | examples/conditional_generation/peft_adalora_seq2seq.py:69-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/beft_finetuning/beft_finetuning.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea5a6b3e89247d66843fb88c2020580c6c750c69adac177dc4b6778eab6256a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/boft_dreambooth/train_dreambooth.py:563-572 | examples/hra_dreambooth/train_dreambooth.py:560-569 \u2014 \u0060examples/boft_dreambooth/train_dreambooth.py\u0060 and \u0060examples/hra_dreambooth/train_dreambooth.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 731 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/boft_dreambooth/train_dreambooth.py:563\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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a91bbb3069b2e450613e8245c0484f5db81a25230fe4a80657fb49ce807daaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:90-95 | examples/corda_finetuning/corda_finetuning.py:90-95 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04acbbf6a02671f86de56a4f4510060ca12a723e22215c6cd5b5b040c329cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/astra_finetuning/astra_finetuning.py:185-195 | examples/corda_finetuning/corda_finetuning.py:185-195 \u2014 \u0060examples/astra_finetuning/astra_finetuning.py\u0060 and \u0060examples/corda_finetuning/corda_finetuning.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 169 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/astra_finetuning.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5e620d22dcc4fb1ba0493da9af75a435cc2eec3707f0df0032bc6338e0c290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/astra_finetuning/datautils.py:87-95 | examples/corda_finetuning/datautils.py:87-95 \u2014 \u0060examples/astra_finetuning/datautils.py\u0060 and \u0060examples/corda_finetuning/datautils.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 194 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/astra_finetuning/datautils.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cbef51105963d75c44c35077b67671f76c9dda08a2b70dca4536d03ca7d6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/boft_controlnet/utils/args_loader.py:10-16 | examples/boft_dreambooth/utils/args_loader.py:31-37 | examples/hra_dreambooth/utils/args_loader.py:33-39 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/args_loader.py\u0060 and \u0060examples/boft_dreambooth/utils/args_loader.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 236 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39e0f1e3cffb605ec436679137ee579bb734838e94ee096853445072230b638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): examples/boft_controlnet/utils/tracemalloc.py:36-45 | examples/boft_dreambooth/utils/tracemalloc.py:36-45 | examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:83-92 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:77-86 | examples/deft_dreambooth/train_dreambooth.py:439-448 | examples/hra_dreambooth/utils/tracemalloc.py:38-47 | examples/lora_dreambooth/train_dreambooth.py:434-443 | examples/oft_dreambooth/train_dreambooth.py:444-453 | examples/stable_diffusion/train_dreambooth.py:608-617 \u2014 before extracting anything, compare \u0060examples/boft_controlnet/utils/tracemalloc.py\u0060 and \u0060examples/boft_dreambooth/utils/tracemalloc.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/tracemalloc.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"932c282f263269d3b071ec9c11c1203d19cd4ac01935b6a20a2cc9406b0ea782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py:45-52 | examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py:39-46 \u2014 before extracting anything, compare \u0060examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py\u0060 and \u0060examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 208 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed523c1db8a25c1ab9428a36cea30e376812c5a8d62b8962c7447bf8e61fc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/adamss_finetuning/glue_adamss_asa_example.py:291-296 | examples/adamss_finetuning/glue_adamss_asa_manual_example.py:337-342 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/adamss_finetuning/glue_adamss_asa_example.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6de199ffa212e83129de17df38653638928c206c0005ab4fc5e1ec11cb26ab9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/eval.py: 0.0% line coverage (0/120)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/eval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28c39e0ec90e6c4427b3ab5b0a6f12a10a1550b4b846df9fe8027fd5640030d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/train_controlnet.py: 0.0% line coverage (0/265)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/train_controlnet.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0953f3d4ac88d31148d167e802cd19ace24e13c611906e7248fcc83cccafe4c4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/utils/args_loader.py: 0.0% line coverage (0/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/args_loader.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b58de7ca05a6b796863ffdc97ff131910a81a5259f46fbb6b52404b24e8f3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/utils/dataset.py: 0.0% line coverage (0/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/dataset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6464eccf9ecc18c0dd606b9dacaa39bae3d29e01535efb6ea2601fa8df2cabf3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/utils/light_controlnet.py: 0.0% line coverage (0/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/light_controlnet.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0de77e1e5d9edba127745330a1e0770f63256eb2d35cc34f0127f90eb2f7965"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/utils/pipeline_controlnet.py: 0.0% line coverage (0/129)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/pipeline_controlnet.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49be5b57434175550c4226191dfeb17c288afdcf313dbbb4604fb498f8b521c5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/utils/tracemalloc.py: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/tracemalloc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba75b0af797b5f9e0beb4d2028d67b2cb449229b32f70ab9a370f65865e024"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/boft_controlnet/utils/unet_2d_condition.py: 0.0% line coverage (0/101)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/utils/unet_2d_condition.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f924f73966fdda6fc38e6b2831ad109ea183532e79c97d77b168f083726d9a16"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: method_comparison/app.py: 0.0% line coverage (0/275)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/app.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885134dc761955cc37905c56b3b1d065218b280101816a37d764328a2517bf8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: method_comparison/app_embed.py: 0.0% line coverage (0/86)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/app_embed.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b7f47637ee435962e8f995762adad3f5232b4ce94a615cbad9cb2734ada853"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: method_comparison/processing.py: 0.0% line coverage (0/131)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/processing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5b1f189c27df899b46613c822645f7d2065826ede03cd2dd3e654fb059846f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: setup.py: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438f0bdce8e8ba6e181e92d9a76cceb66bd86def2a774b9aa82b0f3e5949039d"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_subfolder: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Test is flaky on CI\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_hub_features.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66a5e2a7f9ca9dbd3b392c9a9f54a5317fc0d7763440aeaec2829d60f501241"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_save_load_with_weight_conversion: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Skipping random\u002Bweight_svd combination due to non-deterministic behavior\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_lora_ga.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0bb65ac8e3ffb042cd8249d40488d26ba08087be69300ee15d250d85136db1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/tuners_utils.py: src/peft/tuners/tuners_utils.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in BaseTuner.inject_adapter at line 843. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/tuners_utils.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e96be66e9ec3db43ff2e4f6ecc23968bdf3d5bc0d0f8654c7b5669fc6e7a2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/peft_model.py: src/peft/peft_model.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PeftModel.from_pretrained at line 477. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/peft_model.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"128491c4e60187c9d2ed406b2da5068992253faf79ab14a6624ec0450356fc9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/lora/layer.py: src/peft/tuners/lora/layer.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LoraLayer.update_layer at line 223. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/lora/layer.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7049e8f6f4260c7546bd0a219f1673520004bbcbad5599db34d1c6ae5ecea63e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/utils/save_and_load.py: src/peft/utils/save_and_load.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in save_and_load.get_peft_model_state_dict at line 202. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/utils/save_and_load.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1f6f4990bc1f77e2d4633e43de558cff99fbc74c7d120936727561882985cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/utils/other.py: src/peft/utils/other.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in other.prepare_model_for_kbit_training at line 164. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/utils/other.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4528b9c20eb30db3258cde48afddfe4b4864ed1df50391899d4b6528d5f63cb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/lora/model.py: src/peft/tuners/lora/model.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LoraModel._create_and_replace at line 284. 9 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/lora/model.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dbfea16d38488bde3f7dad7ed3f1c4e14bc0ae4f75226261fbd7895818d640"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/lora/config.py: src/peft/tuners/lora/config.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in LoraConfig.__post_init__ at line 1107. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/lora/config.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/config.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98ce2e327487768eb9c61ecfab009f079fc99eb5589c6ad8826473f12f33056"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/lora/conversion.py: src/peft/tuners/lora/conversion.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in conversion.convert_to_lora at line 128. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/lora/conversion.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/conversion.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80006551debb406e2666d3019d41b0a294228df05132eb393e2e13e11a20699"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/triage_prs.py: scripts/triage_prs.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PullRequestTriage.triage_pr at line 339. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- scripts/triage_prs.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/triage_prs.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e7b1957c693343a904fe1b90a4f4dc509bc0f775cf80beb4dfb361bdab335a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/utils/hotswap.py: src/peft/utils/hotswap.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in hotswap.hotswap_adapter_from_state_dict at line 426. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/utils/hotswap.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/hotswap.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24de49f1602e52788399bffde029d350cba94156dca887ef7fcbbb838525ff7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/boft/layer.py: src/peft/tuners/boft/layer.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Conv2d.update_layer at line 699. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/boft/layer.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da74c4f4b57bd909f052ef1051e19fd9aafffe2880547efcfe8d2297dcaf726"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/utils/transformers_weight_conversion.py: src/peft/utils/transformers_weight_conversion.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in transformers_weight_conversion._convert_peft_config_moe at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/utils/transformers_weight_conversion.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cfcd6f159f324b84cd56cb27400ec1e0111e8769c5337eeead05dbc8afe5bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/lora/tp_layer.py: src/peft/tuners/lora/tp_layer.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LoraParallelLinear.update_layer at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/lora/tp_layer.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/tp_layer.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c360e634c8fb3e127c4d6db18562d9e11eb10e8024e7c67800e7577babed43e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/optimizers/lorafa.py: src/peft/optimizers/lorafa.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LoraFAOptimizer.step at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/optimizers/lorafa.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ab5d4a1307f108e36e5869cdb2cbadf92d3159e0fa3cabb3b2e2588bc05bb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/peft/tuners/lora/intruders.py: src/peft/tuners/lora/intruders.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in intruders.reduce_intruder_dimension at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/lora/intruders.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/intruders.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7203811dd244036dc0e5703fc1d8883e9bb8ed260b5cb1291548b4662a1d540"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/peft/tuners/ia3/layer.py: src/peft/tuners/ia3/layer.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Linear.merge at line 96), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFIX Make FSDP2 merges reach the sharded parameters (#4077)\u201D; \u201CFIX IA3 safe merge bias validation (#3694)\u201D; \u201CFIX IA3 grouped convolution feedforward merge (#3575)\u201D; \u201CFix IA3 Conv3d error message to reference Conv3d (#3505)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/ia3/layer.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdf8d8374935bfdab195d5e2cebe6893312841051fd9b8938351a7c694c7b77"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/peft/mixed_model.py: src/peft/mixed_model.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is PeftMixedModel.from_pretrained at line 409), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFIX prepare_model_for_kbit_training defaults to use_reentrant False (#4146)\u201D; \u201CFIX Preserve trainability when loading mixed adapters (#3862)\u201D; \u201CFIX Reject duplicate adapter names early (#3559)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/mixed_model.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"26190d7020a747dfaeed8aefd00a5b2b89bde48d54bd8292c8a9697c650b5ff1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/peft/tuners/loha/layer.py: src/peft/tuners/loha/layer.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is LoHaLayer.update_layer at line 103), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFIX Several fixes to Conv2d layers, extend test coverage (#3837)\u201D; \u201CFIX LoHa wrong gradients with use_effective_conv2d=True (#3869)\u201D; \u201CFIX Make LoHa/LoKr merge and unmerge deterministic (#3589)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/loha/layer.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1823d30343462650edcdc77e7bbddb025eda7a31c731f32d705ccc8feb8bfd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/peft/import_utils.py: src/peft/import_utils.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is import_utils.is_gptqmodel_available at line 67), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFIX Old, unused torchao install breaking adapter injection (#3989)\u201D; \u201CFIX Proper handling of named device mesh for TP (#3790)\u201D; \u201CFIX Support torchao v0.18.0 (#3571)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/import_utils.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/import_utils.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a53573b6f14375bfef65bd2c070168157623efccc08445bb51620dbcec1ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/peft/tuners/trainable_tokens/layer.py: src/peft/tuners/trainable_tokens/layer.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TrainableTokensLayer.forward_adapters at line 235), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFIX Trainable Tokens adapters with disjoint targets (#3848)\u201D; \u201CFix Trainable Tokens output-head bias (#3688)\u201D; \u201CFIX Trainable Tokens merge-unmerge roundtrip (#3656)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 13:39:14 \u002B01:00\u0027 --until=\u00272026-11-16 13:39:14 \u002B01:00\u0027 --full-history --no-merges -- src/peft/tuners/trainable_tokens/layer.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/trainable_tokens/layer.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9044d00dbc997491d56e1b49a815c203e0fdd5a20d927c1550275739a8f2c60c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: method_comparison/peft-shop/app.py, scripts/triage_prs.py, method_comparison/image-gen/evaluate.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea1e136f7aff494dbb724fde47a5d05dac2c191c5fbc26e1f16731d4cab8c0b2"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 3 significant file(s) lose their only recent owner: method_comparison/app_embed.py, method_comparison/MetaMathQA/run_with_jobs.py, method_comparison/sanitizer.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"004aca247bff257ac86d296041fc29ed6597e64fe71b46f8754ba93636c7ce7b"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (7 single-owned of 224 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 224 of the 287 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/peft/optimizers/riemannian.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this once support for PyTorch 2.2 (the latest one still supported by GitHub MacOS x86_64 runners) is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/conftest.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecb2b10fbf1777049b35c2d2ddda32b8023b73923a7acc311e8cda0ba334dcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO currently this fails because scores are zeroed out: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_adaption_prompt.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"43270897be0792efb72e8a300bffa14c064354617a8437e9ea2000598b29ea9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Missing from this list are LoKr, LoHa, LN Tuning, add them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_decoder_models.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"387e535628a20f7d524872460af37312949686ea96f226308632cfff9d2ea5cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Missing from this list are LoKr, LoHa, LN Tuning, add them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_feature_extraction_models.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5722824ce63016de7d7de4325d901d7304252016014fa35489e93836f0997b2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove if torch can be upgraded on MacOS or if MacOS CI is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_decoder_models.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7f19fe8a06b47d6c9c51360eae5fa19c040815b43b15db27c9f04bf8bfb9cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Missing from this list are LoKr, LoHa, LN Tuning, add them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_encoder_decoder_models.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c1ae3886ca3020f6255c9ddce74934d89a7204e14cf07138bf4c2331d83590"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO skipping to see if this leads to single GPU tests passing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168e972817b21338bbf976320b80e2b3db3b0fb80b49643bc03484d3a3b5e34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO sanity check: model is quantized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b556d5ac0ab0d2d3d72ae38bb87c478e0c5a1c6a28d4f345e94ee9f71d1ef6e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deal correctly with this case in transformers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"022029ea910f6cc1a28fc39aecc99d948836ed4dd05110780b80206abcc0eb0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove try/except once/if EETQ kernel for CUDA 13\u002B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":4599}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf27f51c05c98781d391fb133ee6c6ee1b6d20805267174326e8180293b0f5e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove try/except once/if EETQ kernel for CUDA 13\u002B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":4659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1efeee62f9a29f52e5e77102b92de6d1bcd04400e1949ef3b6059f9e89b9dce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Once proper torchao support for int4 is added, remove this test and add int4 to supported_quant_types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":4890}}}],"partialFingerprints":{"codehealthFindingId/v1":"123afdb1f7f2bd3e071316f1ac101e17962aae1e1d4e51e4d2956c4c7fb23fa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Once proper torchao support for int4 is added, remove this test and add int4 to supported_quant_types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":5009}}}],"partialFingerprints":{"codehealthFindingId/v1":"8427e1c7d813c28e52397030e3a89ac0a77ea10b95a6ca5e9671d81141a9c854"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if torchao removes the side effect, this fixture can be deleted. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":6160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c50502b59a0664ccf9182b8ec27010764fb2dd7ac011ce04a2bc297e5639f1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: once dtype != float32 works, merge this test with the one above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"013de75d4db6d5e73b2b638e96e2da2e17f33606835311b12fd4a19c5a1becb3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: once dtype != float32 works, merge this test with the one above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_gpu_examples.py"},"region":{"startLine":6787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eac9173e97f7cf04f3b82be8b986badad17a2084b220a04fe008a04c2eb442e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove when/if Hub is more stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_hub_features.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d88f897af7260b49d1affa5d6ddc544643ec7d7e96354e3137ad6a6a601a9c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once huggingface_hub \u003C 1.0.0 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_initialization.py"},"region":{"startLine":3809}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7fd41fd4c223d0133474d91ae22115c3e7ec2bb8e8e799c26d472b08dbd15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Remove this once patch_moe_parameter_targeting is removed from Transformers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_integrations.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b96935cee3c0c6eba76c34240235ec4f7276f8ea07d8cb03b44bc06068b0a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove once patch_moe_parameter_targeting is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_integrations.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d372d483bc450ac29b17b7146c4eb9f792463156729ce6354ad6a38c19c1dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove after 2026-11-01 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_lorafa.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ff30dff8375ff17657322c2633f725c4e666267230a34e831b9bab26aa42bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove after 2026-11-01 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a776dadd27fb272d61324e5d27805a0f521522849f1fb775f53678df47f05f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove after 2026-11-01 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b14fed14750ee973299a86e17bf677414d845a4f1122a56afd804d6e730b36e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: theoretically, we could allow this if it\u0027s the same target layer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_mixed.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3269248b52ca77b6fad8f23bd465399836f25bb28cfae4eea21de3ea95a799fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove this distinction once transformers \u003C5.1.0 is not supported anymore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_other.py"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"158fa1f7f71570667586a47f4a3ef06c2deb0f52264f399e984f0a2b8197da8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove this once transformers \u003C5.6.0 is not supported anymore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_other.py"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5f826d5305edc27948a52fc445de6f45df7aba8438693d3ab2f8b5002bbe4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove mapping when transformers \u003C5 is not supported anymore as it is the default \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_other.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb93d6e4b42e85f62fd5d993f5320f7f65c3a56921314e7d97851586cfd2868"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Diffusers 0.40 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_stablediffusion.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c8c4ebc1e4bd8d1bad87b6acde7328ba11456172c443a83dc4d9fe489e7b2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Diffusers 0.40 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_stablediffusion.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b814c3769b8dd2460c6f3abc7b32387a823b8b532dd03edbf8b520d44d809fa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Diffusers 0.40 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_tuners_utils.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ac9f0ce36ca69cebb8122f6fa32880fac90ae56bf41ed797546b14aa926959"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Diffusers 0.40 is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_tuners_utils.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"11724eac24c55cb6dc81a8680d3875faca23e171f66bafe807fc38cdaa9b54bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Merging the text_encoder is leading to issues on CPU with PyTorch 2.1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_stablediffusion.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d8acc9bcd31333dc4df339a4602799c83dacaf02f42efc11db3085412a0357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Merging the text_encoder is leading to issues on CPU with PyTorch 2.1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_stablediffusion.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a399e2854c9951fc95c756e8f3e9e89eeb3d4c4c37de18e13c0072196b8775c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove when transformers \u003C5 is not supported anymore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_trainable_tokens.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"9159e658253df1b71ce2b4dce975c6d58e7678b711e8c02913cd111f63d2aaf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is this expected? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9485bbfbe53ae7b25c3f2bca4450629434155ab97b5056530148f3cf18b1e6ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is this expected? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3302cada1b2c3b1896e4c219e009489f069ecbf07592993d9604fc9554c750"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: no gradients on the \u0022dense\u0022 layer, other layers work, not sure why \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d2a2d5e3e19c725a20d7512d69b1e18099cbd72dc60f865da8cf82766f7b4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: no gradients on the \u0022dense\u0022 layer, other layers work, not sure why \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fdc564d31210d915ccf08675a8240e546c8bcc0f32397c4d37d69b03c0b817"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: prefix tuning fails with roberta, deberta, etc., requires investigation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b96059b5391a66f565538523a5a3e0f87d68875e111c1ff30fe4c8110b0af85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: raises an error: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99d60fd135b6b2506ccf4430da84b92dc465ef16d18863c502ce99afe665db5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO investigate why these methods are flaky \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7459873eeeaedfa6987d0a2945451bba1af8aa59c66239b04fadaa8b4a692e3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once transformers \u003C 5.0 no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"838b0a0df3fe9b8ddb3118a8e38d0b43a79fdc0f028f088378593cfc567ca41f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add tests to check if disabling adapters works after calling merge_adapter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_common.py"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"49eb985511ad2d9d7c603f8a9c08459279295f61795d9e9118a257d4d90a4a8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove if transformers \u003C= 4 no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testing_utils.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b0c9beb0d4b9c338e121aedc597768034622867ce0577f371ab0ec7d363e26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/regression/test_regression.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4a1cd3ce9b1400b1e90882c56774ae4c3a05b85fe2616531d4a0809d0cfa6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/regression/test_regression.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352ee483386f0c04a65eff2c23f201fba3601062b27a4766c1657b02851af93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/regression/test_regression.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"337a09d699f71657d6d257a81e6b06d4b24fa674a92a4c4bcb75e29863fb130b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/regression/test_regression.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af132772032e9914e1f3f1ae19eb2a76a1b289ec63a5085363528e8e6d8cd56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/regression/test_regression.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb329278a723197055fd525245d65528ed4092e2352e06e750ce517489583fb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/regression/test_regression.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5751c8ad8ed6ee87555a531a18a93bb76910d95d245016625ba074ebda84605e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"720f11c5fb5bb69063101dee3ffde8b8e090e1eb676ebdcd2a053f139f5904b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Avoid circular dependency .. TODO: fix this with a larger refactor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/config.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb095cafce24c44238d63d9de223fcfb23e9022ba4b8687816667463b6fe9499"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this hack is needed to fix the following issue (on commit 702f937): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/config.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3abacfb63ee9df60d17645e009fbace54c7909d415ebb8037962c4101c851a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Skip this workaround for use_reentrant=False if Transformers exposes a public API to check it. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c8fc234f8cfcec950f79b37a71eb142b4fadc201b2e8c49cb41cf3fc3358b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Skip this workaround for use_reentrant=False if Transformers exposes a public API to check it. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"98392d9e23bbeebc524b92813424fbd73f77cdb03a3773aa2ce4386cf2e0ca66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not quite clear why this is necessary but tests fail without it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"569e41d0a9023a6b0cdd5751e58edf827ed7cb1d312a27aabbaa93730fff31ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this function once Transformers v4 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2c625c70590d3a23ca8d5a02fe36aea17a312c26ec905cb04b71a67fbb8670"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this logic once transformers \u003C 4.56 is dropped \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7b675cb138191b0b16a56c3b7fd93522379b60406643a307385a7af87d3e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove from_legacy_cache once transformers \u003C 4.56 is dropped \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0872886d9eaf215206ffa1b31e5e7e038703dbd0cef7d4f4de2b6ba4b9ce166"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove from_legacy_cache once transformers \u003C 4.56 is dropped \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77dc1eebee2757a69257003e587d8650dc8d93a244760c122e8850a56959995"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove check for _supports_cache_class once transformers 4.53 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fb7f9908ca732d76fc497ea0ba398e34f9eb1aa3ea20758376d2e7a0356186"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider replacing this patching of methods with a more robust mechanism: setting a flag and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"0260a4cf1e4a9ce98d3c8310c567dabdd8a33bd540453dcd492bc74cb685d9ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: starting with transformers 4.38, all architectures should support caching. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"939b414befde185567208921ef7d4f2fd820c39084ffe4d8d7c12bef74371a4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider adding info about tied modules (_get_module_names_tied_with_embedding) and DTensors here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/peft_model.py"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9d9547f1ef1ccc950f22b35c5d6407a9cd1eadd532a6b5254437bed65196d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this once transformers 4.53 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/constants.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e872e556014c5a9266a3a39541166edf11566ecc8b20bc0573df7ff28b25a35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is a very rough check only for LoRA at the moment. Also, there might be some options that don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/hotswap.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4980ca4a38293b5836bfe9aae01d3e4893f9998b3a35ad6ba3ffd149c243c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove if we drop support for transformers \u003C= 4.55 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/integrations.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca64d64af1bbe495fda20a96fe0574d7ee6897cb0fce787222a93ddfac3ccd1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Transformers \u003C v6 is no longer supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/integrations.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8df3d153a85cf5ee100b345c5a5a28b6df2a5cca101414912fb71d7b8026d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Transformers \u003C v6 is no longer supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/integrations.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51dbc0e07af5f95eb3fd8554a7121294392010fbee6f87f4c732a01088f1ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove gradient_checkpointing_kwargs in v1.2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"55471611e3d306f05a01a3c8e4f8a7621230d4f6ea5bd963490ed428319feed4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once Transformers \u003C= 4.34 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dc224b52cc65faf919c36cd3f389db2a48df7749730ca6c92c0c2ec5e1ef52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove the whole \u0060else\u0060 branch once Transformers \u003C v6 no longer supported enable gradient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"90616fef9aac664e1d19bcf3ffdb1bbdb33fe8caf8a99c8e8f85bea2dcc68db8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not sure if this is still a sensible thing to do. We would basically have to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cfe9612a9ffb2306a9d11c78b47cec442dfe8fe25a381258bd8409950a1d26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this does not support deepspeed/fsdp since it is missing a context manager \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfe111b8a9fbbcf5df80419077496b00879a2e73d6f2dd62cdb297e3a072d39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO In theory, multiple active trainable tokens is fine when the indices don\u0027t overlap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"07deaafc8f2273a9c47fb4d01b82acd734f6fb39ccb21abcf69a5aae129c3b3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove once transformers \u003C5.1.0 is not supported anymore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"414e8fbaf639dceaf598c7ef3b6383f54f09f8743c8082c33a682fc3528615d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove check for _prepare_4d_causal_attention_mask_with_cache_position once Transformers \u003C= v5.2 is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cc9294a1d3160e5d3d8dac3cfea6ba6bb87f4784bd9d282c19003cb8eae5c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove this when transformers \u003Cv5 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/other.py"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489dac750ad6d1f86ee7e6ffdda7a520207b5d0a31a60b755d5a100247278a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this function, use vanilla torch.load as soon as torch \u003C 2.6.0 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/save_and_load.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d8f955fec1a79fb054ae7fb9b889882a9570adb5f3416f39918207d254760e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: lora_embedding_A and lora_embedding_B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3517192fb43aef682e634ae946eb570cb4c79ecfe64f9cf4fade96ca30db0631"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: lora_embedding_A and lora_embedding_B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fce11a96894c2730ac9d20b06edcf6038a4e152864fb62d1c023a0f7a1ea2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this assumption may not hold for models != mixtral \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b2bc8c10d26bf113ab508ea248bed8733120127f71558dd6e454e41dfba7a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this assumption may not hold for models != mixtral \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabdcd08ffc0d82975bfa2695e270a8b1a618a9cebf7e5d9325521cd06f46860"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: by adding the leaf names here, we may match too broadly if only specific layers ara targeted, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410daa1100159c0a5df4e64412e0784288b680c47fff6911a68d5d0dc2f8e24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if there is already a rank or alpha pattern for this module, we should update that instead, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/transformers_weight_conversion.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3831d48d492aefdeb01f93abb28ad6838f0cd02e56316baa2db3e92cf59a0046"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: To be removed once (if) https://github.com/pytorch/pytorch/pull/37385 lands"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/_buffer_dict.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf9ae395162553b5ea55d4659b94ccb20f48fba9a98e7a541db4655d0bbf06f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: refactor LoRA to use the same approach \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lycoris_utils.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b534e2f3fb734579b3ae2a28ae60d68573faf2abe553cf4d2bbea403a75fbf28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate in favor of enable_adapters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30e1a0ca978b587c4a79984f9322f39c3065ad51d3642f225e1545b8e28d68b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate in favor of enable_adapters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"44956ccacc74a8f9f5dfa5113ccf6e9b3f6df348faafd25574db28e9766c1187"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove once transformers \u003C v5.0 is no longer supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"deef489519ae7842d15a6da528c411d4c2e414d45ba32a724bb69b535134992f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check if this the most robust way \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fe2280f16461d9c29743ba10fbfd1747e04b6c6b860e1e29f3ecbe6ee90188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO very simple matching, might not cover all use cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7101bf1279878a7bde6e587eccf69e5e76780f6cb93d30aa495a64ec86486bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update docstring about the interaction of active/merged adapters for PEFT v1.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"956ed648699b025e00d515285c77475d9153b3d5a1cbf81251cc4c09ad524d1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: It\u0027s still unclear how empty layers_pattern (None, [], or \u0022\u0022) should behave \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tuners_utils.py"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f9efcc3a88c7d58cc38e53c29dd2712b736e9d2778d4c333232375082d6499"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement X-LoRA with Lora\u002BDora layers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/layer.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fe13ea98256f6f5ea50e4acfa7f028cd5a442f6420b8339baef67afb2943bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement X-LoRA with Lora\u002BDora layers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/layer.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc4c7c88f4fc60b8c100383117790acbfe268194dea4d6003ac6815032cd9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement X-LoRA with Lora\u002BDora layers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/layer.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b99964edfe4b3a1bed0f7ddef725baac6978c89b609e70c5ed0492e4378ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: adding vera_A and vera_B to \u0060self.get_base_layer\u0060 would \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/vera/model.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b06e8384d1213d8540b9a0eebef32de6d8b12a8bb9409da452b2f7972fe8f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add quantization support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/vblora/model.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"222a92306659bd249f1e73c9016297f85a71fda5d08746c78b9747a47cf4f57b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: the isinstance checks, especially the one for nn.Linear, may not hold for quantized layers; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/trainable_tokens/layer.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7465053336983bc6271c34fb77d31cd5a20d6d373a87d081967cd9b26bba71b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we may need to find a better way to detect quantized layers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/trainable_tokens/layer.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6862747a801abc6387637fa20e9ceb09c41fbdd3493b382033bfed17c2c3eb97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO LoRA also has hooks for beam search, ignore this for now \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/road/model.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90e9200b2b562042b5f2d4e7928a3c604486261c23e010ede837d5f0437f259"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: adding pvera_A and pvera_B to \u0060self.get_base_layer\u0060 would \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/pvera/model.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa30942dac79884c1dd779cf6a23c4a9668bf7c3fb57f9099a9a705e98b61e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO maybe not necessary to have special treatment? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/mixed/model.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d83c33b629deef2eaf22b1cb143d3363c1160e03be159c101e682bf5a5e0d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove if/when we remove support for bias completely \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/conversion.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4691ae1a76a0accc16b54a047a414e8e39709fc3b01ece252e2b2cc4c5735a00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: no dtype conversion here, unlike in Linear, is that correct? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"441656386970214db42460355d87f87b0cdb4c57f02bf89df0076df5e52d8ec5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO work with separate weights \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5769fe8011eb1ce259d84dc8437ef6c38a95884ff9c526bbb5689c8684724f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO work with separate weights \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0205b540fca612e6984a5be9519b59e8fbbde6291ea548100d494f59816c2107"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO work with separate weights \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ced7b3d7ac22d681af1ec56919e2f5b137ba4be470567799f97c3e60c793dcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: probably not so hard to implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4873c6fd697a181d3d11df758f84021073f82475ba7dc16b51cd9e8737ed6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: work with separate weights \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9979dabd9ab19202b2d5d8e176581a201ff0a0036be5c05e6ac2f773bb838dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: work with separate weights \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"572b1184fb5295fdfa9f41eed68ce0c54005d4f51f42664e9ca1b12f6ccad808"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: work with separate weights \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e150b2c5ff371698aa4267793524477725d34af9cd82a71ad2ec0fb5469bf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove once transformers 4.52 is no longer supported. Note that 4.52.0 is yanked, so 4.52.1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5931d030caba748fc27ac7eae5b0a388d5fba78848a272225cc72b91f6845c96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Not required once int4_weight_only is properly supported by torchao \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/torchao.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae9011662f21ee3f69f139b0586b59a34704a378520772d53139f4373bb7041"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: once (if) torchao supports directly mutating the data, use that instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/torchao.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eac61dbc0500020617735545f69eff39f1ab21b1ae2cdfc5d95e08f46aa0ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: once (if) torchao supports directly mutating the data, use that instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/torchao.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cbb1d46f4d3e82c11421d27c0bf2f01dc326213300cb889f6af5f11211b76f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Investigate if there should be a scaler like in normal dropout during training \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c37e82ad34ef31c8acc132b49d18861a5f049099ec4365052ed5ce66c0c367"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: weight.dtype can be != self.ia3_l[self.active_adapters].dtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd6a00c64e83771db491e652212751f2560152e581c3919f137d1e2c3853de7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: weight.dtype can be != self.ia3_l[self.active_adapters].dtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/layer.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"29011ce416649b6d0d9323945a11a2771fd4843d4c2562b4e5d3977e6ae75bf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO we assume that position_ids is not None here, not sure if that is safe but the old code also did that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adaption_prompt/utils.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75e4f3db7b62f3c6a5475af8407b757bf596aaf19d3acf2fcb23ed6e209563b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if all subspaces have equal output dimensions, this loop could \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/layer.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9273ea69981bcae7da659e2e6c3391c0a688d949ae8d77a363df1862af745d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: here, the dtype conversion is applied on the *whole expression*, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/gptq.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"095198a6aa42615261b617daf7da86b6e2c8d3e52a807af3f3bfffa24d2586a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove after 2026-11-01 and default to \u0060group[\u0022scaling_factors\u0022] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/lorafa.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2c0865f3f9e352d8d139ab0b1bf8d94c1646cf6a291db8a612f50545347060"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Note that the longest sequence in the batch won\u0027t have any PAD/EOS token at the end, this is fine if \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":"method_comparison/MetaMathQA/run.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d10b71a2212582995988eecd2a380b666d85fb54d96436ff42c636fb7190490"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO remove once this issue is resolved \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":"method_comparison/MetaMathQA/run_with_jobs.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa8a2f9290f1bb349d0c065edd518448c70d15e1c1180ca8b9fd4ad074556bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (patil-suraj): Remove this check when gradient accumulation with two models is enabled in accelerate. \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":"examples/stable_diffusion/train_dreambooth.py"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae70c0c57136686a531b0b3bb4beb1ab04783c0deabd36fb14461cfa0f87f946"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (patil-suraj): Remove this check when gradient accumulation with two models is enabled in accelerate. \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":"examples/oft_dreambooth/train_dreambooth.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec492ea0ced716d52353d27287766aec67d7c81029813d49138bae69e7a4b70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (patil-suraj): Remove this check when gradient accumulation with two models is enabled in accelerate. \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":"examples/lora_dreambooth/train_dreambooth.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd81538a9bb6b019951d469263759afa363a0f7f13022cf27f3a0a5a304e6ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (patil-suraj): Remove this check when gradient accumulation with two models is enabled in accelerate. \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":"examples/hra_dreambooth/train_dreambooth.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcbfda6856e56a3f913a8167411b2de208f7d94b3771bd1c0668438089f5530"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (patil-suraj): Remove this check when gradient accumulation with two models is enabled in accelerate. \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":"examples/deft_dreambooth/train_dreambooth.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be28305ca71d8b4239d25477589712b4b3cca82f7ff90e50064af26eeab8f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (patil-suraj): Remove this check when gradient accumulation with two models is enabled in accelerate. \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":"examples/boft_dreambooth/train_dreambooth.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cabbd0f5d3818de11702ffba99153e0a645fac3317b0a8df3f223538d3021db"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # --token XXX \\ \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":"examples/loftq_finetuning/quantize_save_load.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9c2fbf5435f2d63ed15c77a0d24b4dc16ca155bfa1dd5137147e975fb8dbe6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: xpu support in facealignment will be ready after this PR is merged:https://github.com/1adrianb/face-alignment/pull/371"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/boft_controlnet/eval.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0600de6d73f78c5ad40da74beea0ea128f128678f86ca3954ccfb96d5154d40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # 7. Prepare extra step kwargs. TODO: Logic should ideally just be moved out of the pipeline \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":"examples/boft_controlnet/utils/pipeline_controlnet.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"695f85989d7d3917dad51f87b433c9575ae60092e9c0729d952343118bbefd12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this requires sync between CPU and GPU. So try to pass timesteps as tensors if you can \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":"examples/boft_controlnet/utils/unet_2d_condition.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1100635e2ace32e0b7199fc2d1e7c87b2c734a30f8e5213a5591cdaf8e6ab609"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (76811 LoC, 564 module-visible types across 96 directories) overshoots its size bounds. 1 of 4 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4842ad367a78941ccec73d857627e21e838b932492f4ae73cdd87ada79a9f00"}},{"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":"f78fa224ed155e45796e82d008ff6560d24844db2854164e888528602d882270"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"2fb98c37474ed8f41ac30929936c7f7e3e26f4de4b5fd1f5fc1431c94739d472"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"84ba764edea49d7dc57957c79c6d1de313235db50826bf4fe43f538809018214"},"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":"e108808a72d689026e6365be51f1c4dec977231e598df62c9a2f48914017c933"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"34dad068a5d43b70a4c57b200cee88d0e5baef116608c724d003570cd4abadd6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"481219c4dd32a830b49cd216cb9a3ac33ec6b3d213b39ff0dc190d55119179ca"},"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":"fcaa09a2d10e227bdf502bd0570df6df5c1a528541d96aa71f0e2b0b216dc689"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"a2b07406cd1c131c78ec03d3762e62475a9d139305d056cf6efc9392367e6893"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"2371d950244939bb9863a216f87d2900e3e84feb96db6ca3797fe25247aa997a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"b8c8862342cd115ea388d28dd9f54f474d2392d97e14293f97f8bc89843f8ce6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"76425a7266913861afbc839475954efc28d5f77b43525f6852cd6fc56efbab61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"dcc4be7ba60ba8972e747cc256a9cb7b7ebf7c39290f48da22fea0ccb94c9628"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"d6631fb0691a511d9bf9fbdb8fba7ca7da8371c7e958a5f7d3c25d77def7d6ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"00b181ccf57f2aa8588be1da2b55296e4e5195a27e41f6841bed9659b6089a2c"},"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":"91e48962996878d8ae3cdc843716a56b3cce4f004556edb0c7cc3d2114bfd2d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"b0bd73a018cbfa376b10a44a5aaa7a4b9d6f4c743f8c977a51a794c0e75a29e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"0df4736104ef6ad380d5cb7e0a6cccf41a96aa723fd737c390c27500573cd47f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"25446ec5273e282adb18b1dc6a7c0de9923e7f7de62a2ac39a70df2860de4060"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"efd0de5d7912e2b70a2cb60adf5b46bff6036924537def30bda5e110f7905abf"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"0bd18a72214848465c843fec0ada388a6aae3e4b430d76b506aaa87f10387c57"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"d1bf98c6d75a2dbcbc9181e77bd38e5c27030d53d8f538508e4f52be1a142cb8"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"4fd45b279ee713fcdb8f171510bc8163e7e59513fae998f9210d9c0c61541f8e"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"85020cc31447ff9512110876ab7bc35248289d501b262b5fc7e49b01ed03e827"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"dbf9fc8368e86234d720d395214ae0c2bd8903f9b7294e0cc208f659c512060c"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"5fb18101ec8c7cf8e6fa7ee28ff70a7ecc2d9cdfdc395b116d851093fc58358e"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c3062bd400f1bdb05939dcc1c506e5e0bf7a83da94b1dcd24dcd995ce4c9cc"},"properties":{"dependency":{"package":"diffusers","version":"0.34.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2446","PYSEC-2026-40","PYSEC-2026-41"],"severity":"high","fixedVersion":"0.38.0","relation":"direct","declaredRange":"0.34.0","reachability":{"kind":"production","file":"examples/boft_controlnet/train_controlnet.py","line":25}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b533e4c7aab1fb904c392de7fcc267e299f5a49e8e699779e3043056692a010f"},"properties":{"dependency":{"package":"transformers","version":"4.54.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-211","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2026-2288","PYSEC-2026-2289","PYSEC-2026-2290","PYSEC-2026-3929","PYSEC-2026-4174"],"severity":"high","fixedVersion":"5.3.0","relation":"direct","declaredRange":"4.54.0","reachability":{"kind":"production","file":"examples/boft_controlnet/eval.py","line":30}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8207b5370752aac31ab826c28f1136fae7f401e1a9af83910f8b56ab7c8a14c"},"properties":{"dependency":{"package":"transformers","version":"4.54.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-211","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2026-2288","PYSEC-2026-2289","PYSEC-2026-2290","PYSEC-2026-3929","PYSEC-2026-4174"],"severity":"high","fixedVersion":"5.3.0","relation":"direct","declaredRange":"4.54.0","reachability":{"kind":"production","file":"examples/boft_dreambooth/train_dreambooth.py","line":32}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edf0fa357227b4765a331af4b5d66e69308f5949ae493a7f98c0951d2341017a"},"properties":{"dependency":{"package":"diffusers","version":"0.34.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2446","PYSEC-2026-40","PYSEC-2026-41"],"severity":"high","fixedVersion":"0.38.0","relation":"direct","declaredRange":"0.34.0","reachability":{"kind":"production","file":"examples/boft_dreambooth/train_dreambooth.py","line":27}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db04f16d15344bcb3105f6a658ddb7ba2a6b43e5e2688f5ba5b0d309f92f787f"},"properties":{"dependency":{"package":"transformers","version":"4.55.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2026-2288","PYSEC-2026-2289","PYSEC-2026-2290","PYSEC-2026-3929","PYSEC-2026-4174"],"severity":"high","fixedVersion":"5.3.0","relation":"direct","declaredRange":"4.55.0","reachability":{"kind":"production","file":"examples/hra_dreambooth/train_dreambooth.py","line":32}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91e0ebbab2c998c3f5bcbbbdde12d05bb8a2de5064ab6c32ed0ba9f83e209869"},"properties":{"dependency":{"package":"transformers","version":"4.52.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-211","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2026-1980","PYSEC-2026-1981","PYSEC-2026-1983","PYSEC-2026-1988","PYSEC-2026-2288","PYSEC-2026-2289","PYSEC-2026-2290","PYSEC-2026-3929","PYSEC-2026-4174"],"severity":"high","fixedVersion":"5.3.0","relation":"direct","declaredRange":"4.52.4","reachability":{"kind":"production","file":"examples/int8_training/fine_tune_blip2_int8.py","line":17}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e51c4401de2dd3fc8cede3839942f41dd2da6ac4c72a0762d90496b31e9fe1ae"},"properties":{"dependency":{"package":"datasets","version":"2.16.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"2.16.1","reachability":{"kind":"production","file":"examples/boft_controlnet/train_controlnet.py","line":24}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab18354c9564399f3fd8a3dda1299dbd07309893c71462a22e26356ef8b55fc4"},"properties":{"dependency":{"package":"accelerate","version":"1.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3804"],"severity":"medium","relation":"direct","declaredRange":"1.9.0","reachability":{"kind":"production","file":"examples/boft_controlnet/eval.py","line":26}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"002a2239bc70a60ad08bc1fa6d0ac9570304ff33aec54f335e31919e16698377"},"properties":{"dependency":{"package":"accelerate","version":"1.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3804"],"severity":"medium","relation":"direct","declaredRange":"1.9.0","reachability":{"kind":"production","file":"examples/boft_dreambooth/train_dreambooth.py","line":33}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"523034a771422de10c9fb6ce1ea307166c068b8947ba47e476d11c2995b685eb"},"properties":{"dependency":{"package":"datasets","version":"4.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"4.0.0","reachability":{"kind":"production","file":"examples/boft_dreambooth/train_dreambooth.py","line":26}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5042a53e47261fdb823f85701f39ce08fceaf70a543732e5944044d9b4e0b40"},"properties":{"dependency":{"package":"datasets","version":"3.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"3.6.0","reachability":{"kind":"production","file":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py","line":9}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b54de56ede2c73ae9d76bb5b4cb75fc444c42c21f5fe40bedd17a3709ee3b668"},"properties":{"dependency":{"package":"datasets","version":"2.18.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"2.18.0","reachability":{"kind":"production","file":"examples/feature_extraction/peft_lora_embedding_semantic_search.py","line":22}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a741b411c9c6a67f723b00138f611ad24458591f6170f67c77bae6be336f160"},"properties":{"dependency":{"package":"accelerate","version":"1.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3804"],"severity":"medium","relation":"direct","declaredRange":"1.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9154374a24cace8ea4fdb43139f39ef9f540fca8ed90db0d87b4cec79f90a362"},"properties":{"dependency":{"package":"accelerate","version":"1.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3804"],"severity":"medium","relation":"direct","declaredRange":"1.9.0","reachability":{"kind":"production","file":"examples/hra_dreambooth/train_dreambooth.py","line":33}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b852aaf61f5fc2b23ca5ff0d07fd29f83bd1f6726578c202a25be80f4350169"},"properties":{"dependency":{"package":"datasets","version":"4.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"4.0.0","reachability":{"kind":"production","file":"examples/hra_dreambooth/train_dreambooth.py","line":26}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6df46837b48db71502e1fb010f3d6c4df7dc236b79189264ce46222f9639dd17"},"properties":{"dependency":{"package":"datasets","version":"3.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"3.6.0","reachability":{"kind":"production","file":"examples/int8_training/fine_tune_blip2_int8.py","line":15}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6aeb98388ad8516aa34c2b1147162fb2f1806949d67754dfbb87b0b9b6f53a48"},"properties":{"dependency":{"package":"gradio","version":"6.2","advisory":"PYSEC-2026-211","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","relation":"direct","declaredRange":"6.2","reachability":{"kind":"production","file":"method_comparison/peft-shop/app.py","line":60}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41e50582a4cba75b03190dc70b825683b12daa758ecb4634c1d0c3e1e59d9070"},"properties":{"dependency":{"package":"gradio","version":"6.0.2","advisory":"PYSEC-2026-211","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"adbc25e24d7f1f4d48ac17af22b61f81486c3ec8fd33dc17b9fa0ef60e6fa70c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc60a5b11543f211e2ba1489d97199d644d163ccd52e9c3eb78912b90db39a08"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53c9c1de81eeb5fb7faf960f162e7ed8983afa7322491fcb5feb3c2873459521"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8285ddde0f53e4b8d0ea9ab055fdf0e890e5abb503937d636352fb1ef78d289"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d68294f7ba4e4ca08825a33b9f824023b19a3cb5bc4ef6b4b914784eb87c5112"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecb4f639e6d1114d566453f094a4a7ef0034689cf5656a2d36b01801d6d3b9f0"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89dbe44cb5b4e60024f52382151e9a4973d56b8653a49dc5241381ff5ae6f467"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cec101231c42c8bc010e5d0ef10bc5b644b973217039ad6146b83833b591c041"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7b83e8d3aa2d3f38fb9398dc0ad345af95d7f4901ef97f3004d2fad151e42d3"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc8fbcd5144751ff6409eaac26e1d0b2adccd226e8a3d76ecf1f6ab1da1fe241"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8118275fdf23ce0d0115c10e34fe4661f4254b080bc0591bd96cf90463761131"},"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":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/bnb.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0318d7f83005de4b0dc140e9293d545f1d26f52ee7f143d1d6a4bdbb99950188"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/bnb.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5794cfa6f5c189d9e3658a722e5a1b62bd96a6b2ae90e9b30dc22ea0251ad16"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 67 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: method_comparison/text_generation_benchmark/utils.py, src/peft/tuners/road/layer.py, src/peft/tuners/lora/corda.py, method_comparison/text_generation_benchmark/run.py, src/peft/tuners/waveft/layer.py, src/peft/tuners/waveft/waverec2d.py, src/peft/tuners/adamss/model.py, src/peft/tuners/delora/layer.py (and 59 more) (69 orphaned of 224 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 224 of the 287 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"971a7046a7d8eb7ac68554c8eb67578b2a256fde4b54002f82bf94cfcfdffa78"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/road/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14452cc2ac9220754823420d759438d31d93ff0f860c4d1a530b9b441467d8e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/corda.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fe666ab871270e90e1c4c8cd7bf6ed7d150db7a616b7509d8062f72497b638"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7df1c6b0f7ea36965853105c0521f48033281a1b28c16039f6d8b0bd12c6aa1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5738a4b1837b7ca907835d3d50b828161b4f8359aa98f76d47c2af5ec3291858"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5176d898cd21691ecc013b4a9bd045e7ffec4dbfee328d5c7af85b75c86c5773"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8220c36f8002dcb1c8b4d411f722dedbeff13eab02a4c115a5144d04c25336e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/fourierft/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fca2fa1afc53875b15e4be1b4ddfc57444b12aa427bb1878f6c0230afc7119"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/waverec2d.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb734b5233a5483a2505c688383f3a2907a8bdadd4a3ebb378f8eb491454169"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6978c0a89fc4689b679435d51a584661569d68f0af8371d006ca140b361684e9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/delora/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cae0be2b62cb9a3a64a3bd3d090405134e7ec1d51df4ce6abbf88f9e5b798c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/vblora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ac36915d695ae7237627cf091b55c6828ceb0b103e9825bdc19d11aa354ef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/hqq.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e06de2029895e649fb012d97a822552b2a98e5f0f5e18cdfd9cdbd212706c0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/tinylora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"631693268c4db7011167ef7583c009c8952f027ef8aac52c0be09acbc5bde36f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/monteclora.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a44c4f154245dca14dfc9b7493454bed32dc6d2cafce4797187de044b727ff"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/randlora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"671a329aa91cb622b9c33e1ba120e8109f6c2dc20f63ee4c25dc852dfcb57c92"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/utils/merge_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a65cfbe69686a868ceaae1604deeb67b143483dbd193cae092e0ec2af4d8bdc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/cartridge/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6af70433bbd182540d6257fdffeed85228b144f0f2e7194600276eb93683053"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b87de5c45bb1a36814e6938f70cf10bb6fa3284a83e2c5170eca74611b6fe27"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eb28531d356526cbbdc6aba5dfb9ef17cb9d34a6a53635c87166f801158d29"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/unilora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e18e5f7a7911132b6744cf700bda5f616136e46c58a84fadadf512edc583d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/peanut/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc42919419fb7b6c52a600ff918d4cbc94dd1300b602bedacafbd53857ca493d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a0378f6777e974e3222780049925d027fca38522012acac1fa5dc8b4cfce57"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/delora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d2ed29e21266ac6c6bcfc9e7894583100f9a652b43d36c7169b5b39f8709d0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcec4d47d51acd4b76c4e417fcb4cd9f4165aeedd6d6c4ee5784b6e8d158007e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/cpt/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc829fa0838eaa78d5b2c17ded1de88ec171d75f201c234b9c319ef4141898a2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb10def186e9c8cc9e711f39860c0f9df0d0c588dcc003dce624f74a03d53f0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/loraga.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de756b070d1a4b466e23a1d2175d942a3d5594d6ffd251f63d96ce3c0b0bb580"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7264e7f37ae50b5959bb648a3aba15de17fc9968d0523a601db9b5cdc018401d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/classifier.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ea76e4cd2fdd38d2d0574f45894dfb4ff5ba1eeab28053062e9df5a29192c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/run_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8b1ea60170df8fc8a0b0ddc3934d01534ef4056ec4edb30cd0d3ec545c3ce9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f69390d19d9cac2e2137bb3b508a5bc027aa2543bd74f1326a7628e5e23e030"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/road/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ad00b8ff5f0bbbdf29d9187a1b2efadbc7153045d717a3bad456aca1a6df1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hra/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be45fded6bbbe52b250fedf277376a347ab80cb5b715fc4bd2b847019165d5d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fed2c9280f91b5e6a2ad3b58851ac255d5df3881d7a63244919f4bd25934d87"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shira/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15f41b9c2afb9767e17db2c365c1c0dbf6143611c8429696cba9f356e97357b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/poly/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e31c5f28a0dc54bcfe0c1ffe6b8d0412a255f82294f89b21c07f0ab9e80e883"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/layer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3573466e4a67fb50a50555df28e9341566c14ad5df0fa3c014572719f93e2eb1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef524a61e062dfff95622b7720f5cafba708addcd822457076c037a3e7e4b6c6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lily/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31a59731de9cb7e831871b3e1c5773cd7cde8c020890d57e43bf7904d9db01b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/p_tuning/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a40a93070d72a6b7048061f805ee844e73c6b0a5b298a0b39ab61d70d39d0b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/optimizers/loraplus.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08fbbd042a0086404aff8027b44e71e89a4282a120e41d6a06953138a0d6070"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/cartridge/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590066cb9ad96c533e83d5ccac8e9cd325e60f46ae99a35622661182c40d4e88"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/log_reports.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b175b1a1900848dd370a4da6966203db26b404f4c6086c28741fb1a49f33a5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/prompt_tuning/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4183b50068ca9cd07e29568b775463eec0f662d165c3150653169b0b0c0e198"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/xlora/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e485a74caf6fef3ab8b088288dde07d1e6461c8b4cb6e801cabbb50b8e19837b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/poly/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31001f3ad7b8852972ecfafe8bbd45b1aa3c4a2482022b5539f20e51c7b6112"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/prefix_tuning/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df3bf897049f7ca0e2fa583b9c24bc72d37a8a1bf9dd7471820b7d3c3c4ddcc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/te.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9413406cc9e8065e664b73ad4c559984a0ecb96eb38194ca845647d523d2fea9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03587a42d5644c5dd0436cdac97eccf23bda14cca8ce4767b33f870e98effa1e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/deft/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aa8b8e7f30216d48ab89cd07fa637f85f76abee3b3c2b296c1a52ea09515ad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/glora/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19c8524a4a5b2f8d7ea0467214e8983db779bf517b181db20ae7eab781b31a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/cpt/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aedcc3a10a460bd19f499e7c78423ef6ef4df30ec4429999ef97caff42e1966"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/velora.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb70ca335eb0de320b60b209d44f114be1b8c162aa04af93eb054b91201327ac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/osf/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed595e7557dabf1af738a63304a657a6c0de8d896b423124817933dc36b443dc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07fca8f1e37429fee6166fa5658d8ac0cdb4da26348d2c6fcddc48325d97199"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/text_generation_benchmark/data.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1e7740538714d7a2573b858dec424e502b1989cad07d8af1ffc9e763bf744e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/cartridge/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b8a9c788616c382a55bec70827b4773177b1b2a0b4156787bb4e0adbee1b37"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ln_tuning/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"064a4056851b3ac34001b6e4dd02d9115d24ee141a3ef8a8824e2ffd22546201"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/beft/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a604fb721e167599680f94adb8948c9dbe119a364f77d7585138886c072892"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/aqlm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"298ae96048bd0bdafc9d694e69005013cb5d6d9b18061ba7e0f30f28ae512b4e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adamss/asa_callback.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37870f5f3f03e294bc004b49259d9fdf2f609ea432e42efd682c4da2b3361fc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shira/mask_functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ea08559449101b2760dac5fb3a0b9008743ee68962aacb7fa7413f6e2d208a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/inc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ad015f46b88bf51292352aebfbb1c4cbe68c1c8dec211de7761fe4a6005673"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/psoft/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7a134abf6c7b1bcbc794aa63a363ff53d5a2c4e79f7f335edc2f5c01b06ebb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/poly/router.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3a867d7eb5703e75424be902e2b82f8b81688b8c0afd4d475824575d331e37"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/waveft/constants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd156395d00dc67bb4c7a7c1e22aaef55a687ba3b18029558fcc4a277068ebd0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: model.py \u2194 model.py: \u0060src/peft/tuners/p_tuning/model.py\u0060 and \u0060src/peft/tuners/prefix_tuning/model.py\u0060 change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00604ddb88b4\u0060 Refactor state dict handling (#3490); \u0060622a5a23\u0060 clean up docstrings (at that commit the files were still \u0060src/peft/tuners/p_tuning.py\u0060 and \u0060src/peft/tuners/prefix_tuning.py\u0060); \u0060416a0400\u0060 addressing comments and bug fixes (at that commit the files were still \u0060src/peft/tuners/p_tuning.py\u0060 and \u0060src/peft/tuners/prefix_tuning.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/p_tuning/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c72bd52f713082ae0a390b40edcb12d5890ab1e861bb5504882ad0c1210c42"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: model.py \u2192 model.py, model.py, model.py: \u0060src/peft/tuners/boft/model.py\u0060 changes together with 3 other files \u2014 \u0060src/peft/tuners/adalora/model.py\u0060, \u0060src/peft/tuners/ia3/model.py\u0060, \u0060src/peft/tuners/vera/model.py\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc9954ba3e3ae28a1f1234ee6a6d877935ef8398601ba1ba4dc75224c92967b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: model.py \u2194 model.py: \u0060src/peft/tuners/prefix_tuning/model.py\u0060 and \u0060src/peft/tuners/prompt_tuning/model.py\u0060 change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00604ddb88b4\u0060 Refactor state dict handling (#3490); \u0060622a5a23\u0060 clean up docstrings (at that commit the files were still \u0060src/peft/tuners/prefix_tuning.py\u0060 and \u0060src/peft/tuners/prompt_tuning.py\u0060); \u0060416a0400\u0060 addressing comments and bug fixes (at that commit the files were still \u0060src/peft/tuners/prefix_tuning.py\u0060 and \u0060src/peft/tuners/prompt_tuning.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/prefix_tuning/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5310ce1b3747bbbf5d8122d62ffa0f1dc12fbec1276b41bbfd1136705eb0f40d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: model.py \u2194 model.py: \u0060src/peft/tuners/p_tuning/model.py\u0060 and \u0060src/peft/tuners/prompt_tuning/model.py\u0060 change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00604ddb88b4\u0060 Refactor state dict handling (#3490); \u0060622a5a23\u0060 clean up docstrings (at that commit the files were still \u0060src/peft/tuners/p_tuning.py\u0060 and \u0060src/peft/tuners/prompt_tuning.py\u0060); \u0060416a0400\u0060 addressing comments and bug fixes (at that commit the files were still \u0060src/peft/tuners/p_tuning.py\u0060 and \u0060src/peft/tuners/prompt_tuning.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/p_tuning/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441c31785e42566af453043530fdbdd5ac56fea5018e09096951542ae2966d2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: model.py \u2192 model.py, model.py, model.py, model.py, model.py, model.py: \u0060src/peft/tuners/lora/model.py\u0060 changes together with 6 other files \u2014 \u0060src/peft/tuners/boft/model.py\u0060, \u0060src/peft/tuners/ia3/model.py\u0060, \u0060src/peft/tuners/oft/model.py\u0060, \u0060src/peft/tuners/p_tuning/model.py\u0060, \u0060src/peft/tuners/prefix_tuning/model.py\u0060, \u0060src/peft/tuners/prompt_tuning/model.py\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45694e49fcd13b667015c53dd56ee6a29b886aa13d30cb1cbbd7b600de1e3928"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","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":"5e4607103018ccbf4772504c4475df05c43062f243e17471503584c98dc62fdc"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060method_comparison/MetaMathQA\u0060, \u0060method_comparison/image-gen\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 17 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/build_pr_documentation.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf68ee1ea2969cbbdae4336ca738b5320c565628ea6ee894219d523831dd0f17"}},{"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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022site-packages\u0022 in module_path or \u0022dist-packages\u0022 in module_path\u0060 appears character-identically in 2 files \u2014 method_comparison/MetaMathQA/utils.py, method_comparison/image-gen/utils.py. 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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"768d8ce1efb9b30167039b5a8732e8868093a2546f3665d7cc5fc06bdd9bcea8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(in_features is None) or (out_features is None)\u0060 appears character-identically in 4 files \u2014 src/peft/tuners/boft/layer.py, src/peft/tuners/miss/layer.py, src/peft/tuners/unilora/layer.py, src/peft/tuners/vera/layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/boft/layer.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85ba396a3136b870d9e44197f266f4169d8c66c2f5d4229160f7a1c2d1bdd0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(len(path_parts) != 3) or (path_parts[-3] != \u0022experiments\u0022)\u0060 appears character-identically in 2 files \u2014 method_comparison/MetaMathQA/utils.py, method_comparison/image-gen/utils.py. 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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"31165bcd38bfca11e9ac529a3a66cb057915b53a04848ae56274bd6938667895"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(name == \u0022Linear4bit\u0022) and is_bnb_4bit_available()\u0060 appears character-identically in 5 files \u2014 src/peft/tuners/hira/__init__.py, src/peft/tuners/ia3/__init__.py, src/peft/tuners/lora/__init__.py, src/peft/tuners/randlora/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/__init__.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25c595ee668cf41607d09229a86101c8309e2f7a62e2fcea63f1ec1814b595c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(name == \u0022Linear8bitLt\u0022) and is_bnb_available()\u0060 appears character-identically in 5 files \u2014 src/peft/tuners/hira/__init__.py, src/peft/tuners/ia3/__init__.py, src/peft/tuners/lora/__init__.py, src/peft/tuners/randlora/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/__init__.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a9aa781a3cc853a0e500ced8ca7e1911cf0712bb3a1bfd248a2863a2f23d5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(not cast_input_dtype_enabled) or (x.dtype == dtype)\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/arrow.py, src/peft/tuners/tuners_utils.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/arrow.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbe948bcea14569f49b989faf2ea9dbab32d585cd00b58ce0c9760dbc24e696"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(self.prefix in name) or (\u0022ranknum\u0022 in name)\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/hira/model.py, src/peft/tuners/lora/model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/model.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6945500bdf0c688139fb860d0121c944cc44452b2d506b045e4d0e1c501bb1b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060LoraModel._check_target_module_exists(config, name) and isinstance(module, (nn.Linear, Conv1D))\u0060 appears character-identically in 3 files \u2014 src/peft/tuners/lora/astra.py, src/peft/tuners/lora/corda.py, src/peft/tuners/lora/loraga.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a19292a8d7d5f76b54124449677ef170e1e397ba389673d80d33e437000804"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base_dtype.is_floating_point or base_dtype.is_complex\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/frod/layer.py, src/peft/tuners/frod/model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/layer.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9210513076f54c35fa7c3c7a70f9d1c3d40bc355e45e8b877ddc825364f2655"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cache_file is not None and os.path.exists(cache_file) and os.path.getsize(cache_file) \u003E 0\u0060 appears character-identically in 3 files \u2014 src/peft/tuners/lora/astra.py, src/peft/tuners/lora/corda.py, src/peft/tuners/lora/loraga.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec44f66777778ec3db1644195a954db92e0dacbbcc73a97fe98c41c71895196"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.is_prompt_learning and is_trainable\u0060 appears character-identically in 2 files \u2014 src/peft/mixed_model.py, src/peft/peft_model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d823e0ba11894e10dd74de9602b0159fa65546b40fc4a2dea7f9388031d323"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.save_projection and not has_projection\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/frod/model.py, src/peft/tuners/tinylora/model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/model.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdbebe677a89fe9090b1c3f8f27589816e13f4ae4898687099f9d38b1bf4dc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060covariance_file is not None and os.path.exists(covariance_file) and os.path.getsize(covariance_file) \u003E 0\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/astra.py, src/peft/tuners/lora/corda.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d15839c464432b2aec21131963eb390b61a330771fe1c94b088051b88cf55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype == torch.float16 or dtype == torch.bfloat16\u0060 appears character-identically in 15 files \u2014 src/peft/tuners/gralora/layer.py, src/peft/tuners/hira/layer.py, src/peft/tuners/lora/layer.py, src/peft/tuners/lora/tp_layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/gralora/layer.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c39db0ce4ba1b55e6720749fa57cd2245ee9287bd9d2bcb17a6b8341db2b3ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(model, \u0022is_loaded_in_8bit\u0022, False) or getattr(model, \u0022is_loaded_in_4bit\u0022, False) or getattr(model, \u0022is_quantized\u0022, False)\u0060 appears character-identically in 2 files \u2014 src/peft/mixed_model.py, src/peft/peft_model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d217d858dd18cb3b7f8fd63b69d485013886649960e4023ee122658315a7247c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(peft_config, \u0022modules_to_save\u0022, []) or []\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/model.py, src/peft/tuners/tuners_utils.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/model.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2454aa0a666c8658b7d195656663a054020631b7218c5aa1efd88a3c3d3b3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(base_layer, \u0022in_features\u0022) and hasattr(base_layer, \u0022out_features\u0022)\u0060 appears character-identically in 4 files \u2014 src/peft/tuners/hira/layer.py, src/peft/tuners/lily/layer.py, src/peft/tuners/osf/layer.py, src/peft/tuners/peanut/layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/layer.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fef0ff798b7f716392c8ef61f80cbdf4ec0b3bff42ca3939435cc0a06907c23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(self.base_model, \u0022config\u0022) and hasattr(self.base_model.config, \u0022pretraining_tp\u0022)\u0060 appears character-identically in 2 files \u2014 src/peft/mixed_model.py, src/peft/peft_model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3bbea268d6855cbe935fbac9409866368dafbfe46028af7bd28310397555e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(target, \u0022bias\u0022) and target.bias is not None\u0060 appears character-identically in 9 files \u2014 src/peft/tuners/frod/model.py, src/peft/tuners/miss/model.py, src/peft/tuners/pvera/model.py, src/peft/tuners/randlora/model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/model.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f7bfd881929f49933a913d47a3fb8c4ea8931dd6b39440f0540f620724f941"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(init_lora_weights, str) and init_lora_weights.lower() == \u0022olora\u0022\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/layer.py, src/peft/tuners/lora/tp_layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d450556fa59efd09e5ff23bf94c5fe3db93d0fdbf877acc6fe0381e2dc05df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(init_lora_weights, str) and init_lora_weights.startswith(\u0022astra\u0022)\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/layer.py, src/peft/tuners/lora/tp_layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d1591ddeb8340851f533ad736eab89071318ae3adcefb282237871f170bcf5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(init_lora_weights, str) and init_lora_weights.startswith(\u0022corda\u0022)\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/layer.py, src/peft/tuners/lora/tp_layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbd0d02a104d5cc037fbc02fa5ee77e9c8a6c2235b13b10716bba6df3fc596b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(init_lora_weights, str) and init_lora_weights.startswith(\u0022pissa\u0022)\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/layer.py, src/peft/tuners/lora/tp_layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/layer.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f8a7ec44d96e98fb9b1f122da131d194123dfd754f02222c2907c582835b67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(self.target_modules, str) and self.layers_pattern is not None\u0060 appears character-identically in 11 files \u2014 src/peft/tuners/c3a/config.py, src/peft/tuners/deft/config.py, src/peft/tuners/fourierft/config.py, src/peft/tuners/hira/config.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/c3a/config.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a336f0429e99e6cc47f03d4ac7ef397dcf6ed5b08d3a4d3e93518ddfcfa6378"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loaded_in_4bit and is_bnb_4bit_available() and isinstance(target_base_layer, bnb.nn.Linear4bit)\u0060 appears character-identically in 4 files \u2014 src/peft/tuners/adalora/model.py, src/peft/tuners/hira/bnb.py, src/peft/tuners/lora/bnb.py, src/peft/tuners/road/bnb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aa7763d792f2298c071b45baac0ad92fc578d02c122e1ac93b4bc59abac4bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loaded_in_4bit and isinstance(target_base_layer, bnb.nn.Linear4bit)\u0060 appears character-identically in 3 files \u2014 src/peft/tuners/ia3/model.py, src/peft/tuners/pvera/model.py, src/peft/tuners/randlora/model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/ia3/model.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a3e43590229f0ea128de170f9a30ad6700962dd3eb45a0e6202223e206575"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loaded_in_8bit and isinstance(target_base_layer, bnb.nn.Linear8bitLt)\u0060 appears character-identically in 7 files \u2014 src/peft/tuners/adalora/model.py, src/peft/tuners/hira/bnb.py, src/peft/tuners/ia3/model.py, src/peft/tuners/lora/bnb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/model.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"753bf334f674108d45fb5dd3dd49f1374c7738b69067db7899ee1280c3e7275d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not config.save_projection and has_projection\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/frod/model.py, src/peft/tuners/tinylora/model.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/frod/model.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf5f096f116d3aa5d764e07fe792ebeafb9f8eb7a40b1817dac6012e6807272"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060num_params == 0 and hasattr(param, \u0022ds_numel\u0022)\u0060 appears character-identically in 3 files \u2014 src/peft/mixed_model.py, src/peft/peft_model.py, src/peft/utils/other.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/mixed_model.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"99389ee06b616f93b49e5a961ff8d17a3309fc3d148d3b722d07b27a19197857"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.returncode != 0 or result_cached.returncode != 0\u0060 appears character-identically in 2 files \u2014 method_comparison/MetaMathQA/utils.py, method_comparison/image-gen/utils.py. 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":"method_comparison/MetaMathQA/utils.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de6fe5ab65df1697a29d4077cf407102a6a74d36606e20648f939d20789e983"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060safe_merge and not torch.isfinite(w_data).all()\u0060 appears character-identically in 6 files \u2014 src/peft/tuners/hira/bnb.py, src/peft/tuners/lora/bnb.py, src/peft/tuners/lora/hqq.py, src/peft/tuners/pvera/bnb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/hira/bnb.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf0261197d0dbf7f58ece20861d6391dd23db49a6f16effd2c9a25c1a8cb3b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.layers_pattern and self.layers_to_transform is None\u0060 appears character-identically in 21 files \u2014 src/peft/tuners/adalora/config.py, src/peft/tuners/boft/config.py, src/peft/tuners/deft/config.py, src/peft/tuners/delora/config.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/adalora/config.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dbb293a9f8bb6ee1bdd47e1b3e5b5a08ca13760d42542581551201de91e536"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.training and bool(self.rank_dropout[adapter_name])\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/loha/layer.py, src/peft/tuners/lokr/layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff30c11764986241a1328d3100af514a9d548fdc2eb3d6deba61b0125a0b67f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.training and torch.rand(1) \u003E module_dropout\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/loha/layer.py, src/peft/tuners/lokr/layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97ec6749f3b29b0f20c23b31522c1e6cd0b5328481068457c9fba99d21d2cbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060torch.cuda.is_available() or torch.xpu.is_available()\u0060 appears character-identically in 2 files \u2014 method_comparison/text_generation_benchmark/run.py, method_comparison/text_generation_benchmark/run_base.py. 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":"method_comparison/text_generation_benchmark/run.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"57381b78bf4cbfdfaee2a35f09c6d2b69bc9b018f912423a464276c793f25966"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060torch.isnan(covariance).any() or torch.isinf(covariance).any()\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/lora/astra.py, src/peft/tuners/lora/corda.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/lora/astra.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccca8ed8dc082d731fec7b98c5283c518d42c3b96cedd75f7fe430380c933bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060use_effective_conv2d and base_layer.kernel_size != (1, 1)\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/loha/layer.py, src/peft/tuners/lokr/layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"617eef5712d3fd152fa77e8b3979bfd50bbf1b8c4c3e79a3bba1dfccdaa12a7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060use_effective_conv2d and base_layer.kernel_size[0] != 1\u0060 appears character-identically in 2 files \u2014 src/peft/tuners/loha/layer.py, src/peft/tuners/lokr/layer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/loha/layer.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e2fcee9ececfa567808606ef4381d2f141e6c8060cab8c07e8488d2c119bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/peft/tuners/shadow/model.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"527a0e4752cb7648f1cadac66e2ee1cf6dad62e37a21ab30446a2265a8d3d998"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 203 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/peft-shop/app.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b6bfa3ba347bafb56c7ff9232735d268e15772c40f453c6fcadf18bff7b081"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 258 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/peft-shop/app.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfd0990766bcd6037c6e2a6f0637116b5c3331f238836a5cf91bfa02a63711c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 278 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/peft-shop/app.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d118e9a731f1448546c23487f9ac9fedceb3abf911ad44c21290bf8ea11a342"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 1320 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"method_comparison/peft-shop/app.py"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"32395d52df5f3be1880ff02c4cd60acbe3c1a01acfb42b9d1ef13135e89ecfbf"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":61,"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."]}]}