{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"narrowphase.func_add_polytope_vertex_contacts_sdf (cyclomatic 137): narrowphase.func_add_polytope_vertex_contacts_sdf has cyclomatic complexity 137 (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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b15fb84f80bc03a6ecc8c8a077dff628b10705fcf2f4136e236a441b12106"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_contact_overlap_axes (cyclomatic 132): narrowphase.func_contact_overlap_axes has cyclomatic complexity 132 (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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abd4256a8c59d845ddb51166570ccde725a1b79d36ae69e55035ddef24aec02"}},{"ruleId":"D1","level":"warning","message":{"text":"box_contact.func_box_box_contact (cyclomatic 129): box_contact.func_box_box_contact has cyclomatic complexity 129 (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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1185447cfdda40af05823207b9cfff251c789c46f17dad165389072d0c5aacf9"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicEntityDescription._parse_scene (cyclomatic 98): KinematicEntityDescription._parse_scene has cyclomatic complexity 98 (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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de3c0facfed236c9571bbcb40ddf89d269fc349a0a7fbd6089bbc4d31deeff"}},{"ruleId":"D1","level":"warning","message":{"text":"contact.func_clamp_prune_contacts_coop (cyclomatic 80): contact.func_clamp_prune_contacts_coop has cyclomatic complexity 80 (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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab5d559b041aac4b8923a3c2195b535206b50a8689d58a5b141e03d248946e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Data.__init__ (cyclomatic 79): Data.__init__ has cyclomatic complexity 79 (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":"genesis/utils/data.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698fc471f44ac8d85f203f58b72b7c421510fee539362d5a13cc99f463f1e63"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_geometry.parse_prim_geoms (cyclomatic 78): usd_geometry.parse_prim_geoms has cyclomatic complexity 78 (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":"genesis/utils/usd/usd_geometry.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a8199e04af0c9b1346b23c7648879f2c46880f8da8a8f3f6306adea481aee6"}},{"ruleId":"D1","level":"warning","message":{"text":"SAPCoupler.build (cyclomatic 75): SAPCoupler.build has cyclomatic complexity 75 (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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"366447986a5636da7ce9b992ff32cf275512681d3f8fa09c10a808f0f9ff3247"}},{"ruleId":"D1","level":"warning","message":{"text":"linesearch.func_linesearch_islands_coop (cyclomatic 70): linesearch.func_linesearch_islands_coop has cyclomatic complexity 70 (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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10e5dea96358a003fa876c5f31ebe0217e224d25c18dc42bbf33cc90c0a3e94"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_add_polytope_vertex_contacts_sdf_shell (cyclomatic 69): narrowphase.func_add_polytope_vertex_contacts_sdf_shell has cyclomatic complexity 69 (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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"230a9f3c9c09cfe2bee1c254dc093724bb17f60eea8d3aefc758725e8f83af1c"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_island_assemble_factor_solve_tiled (cyclomatic 68): solver.func_island_assemble_factor_solve_tiled has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"103e841c6e2f2af43eba3eddd1a48098a0be0d34f9c5e4b3f91e2f8f7ec5f92a"}},{"ruleId":"D1","level":"warning","message":{"text":"mesh._postprocess_collision_geoms_impl (cyclomatic 67): mesh._postprocess_collision_geoms_impl has cyclomatic complexity 67 (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":"genesis/utils/mesh.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"13be8425e9b618c8ed874716f19d966b2d82646bc5a60b64cc66b310f0f60099"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.assign_indexed_tensor (cyclomatic 66): misc.assign_indexed_tensor has cyclomatic complexity 66 (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":"genesis/utils/misc.py"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade88624bd7b42497385dc44ed23bef0be65260a13f3f1446520d1020f49d0fa"}},{"ruleId":"D1","level":"warning","message":{"text":"genesis.init (cyclomatic 64): genesis.init has cyclomatic complexity 64 (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":"genesis/__init__.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6b511238a97de38cfff4bbf2e65f970adeb2a2277933a3d467dcc8eece962b"}},{"ruleId":"D1","level":"warning","message":{"text":"multi_contact.func_multi_contact (cyclomatic 64): multi_contact.func_multi_contact has cyclomatic complexity 64 (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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b4d435df2b35abe06a5a017f3cf6281c162170864a59a493cf9242b594a92b"}},{"ruleId":"D1","level":"warning","message":{"text":"Collider.get_contacts (cyclomatic 60): Collider.get_contacts has cyclomatic complexity 60 (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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bef377b0638c5000db5fb63d2dcaaa237cea39294eb26483d80de46d3949a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_rigid_entity._parse_link (cyclomatic 60): usd_rigid_entity._parse_link has cyclomatic complexity 60 (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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b88f036cdb4377de5c91e76ef89f9626a74c815f02f59f0e5415a35f8a6a56e"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_recompute_perturbed_contact (cyclomatic 59): narrowphase.func_recompute_perturbed_contact has cyclomatic complexity 59 (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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"31943b22a2343373258071b26df1cc5965843fe591bd6f1c255f8c7ce986e8d0"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver._build_config (cyclomatic 59): RigidSolver._build_config has cyclomatic complexity 59 (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f773d04110063447df6b76a87c76c7d802cc15253cbce0f7b7bfcd838b0e9999"}},{"ruleId":"D1","level":"warning","message":{"text":"island.func_build_islands_coop (cyclomatic 58): island.func_build_islands_coop has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bab72c3420e7e3d56747d1cfda920c62586e2a1f0772c5d2524ecec4ce2e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"urdf.parse_urdf (cyclomatic 58): urdf.parse_urdf has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/urdf.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3185decd87074f616f0c1a0c5b18ae6737796d1f9071ffbfb1273afb383c8a27"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_convex_convex_contact (cyclomatic 56): narrowphase.func_convex_convex_contact has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"133466994b87a600f0c34b7d3328f808e3b6c33c8c08b50e5eb7153ed44b0146"}},{"ruleId":"D1","level":"warning","message":{"text":"backward.kernel_manual_add_equality_constraints_bw (cyclomatic 54): backward.kernel_manual_add_equality_constraints_bw has cyclomatic complexity 54 (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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"4302efbc8af30e2f47297432e623595ee781e8d63bdf21485d0fb48d117412a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Collider._compute_collision_pair_idx (cyclomatic 52): Collider._compute_collision_pair_idx has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3923fb4d0dda289ff34b99b93f59fddcd4db665ed77bea3189409f359f7373c"}},{"ruleId":"D1","level":"warning","message":{"text":"inverse_kinematics.func_inverse_kinematics (cyclomatic 51): inverse_kinematics.func_inverse_kinematics has cyclomatic complexity 51 (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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe56403075076aa3fe0dffa6d4a8024c91cde5917ed452921995853a19e9fc"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy_coupler.kernel_sph_boundaries_impulse (cyclomatic 48): legacy_coupler.kernel_sph_boundaries_impulse has cyclomatic complexity 48 (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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfd3b909b94b8f58ff3cad5c14e93971b635930f0049e0c4318d9941cc3417e"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_narrowphase_multicontact (cyclomatic 48): narrowphase.func_narrowphase_multicontact has cyclomatic complexity 48 (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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3995}}}],"partialFingerprints":{"codehealthFindingId/v1":"262841256b12339fb9de60a889f79c82cfb43caa2a288612b96e1f68b8538be6"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase._func_multicontact_detect (cyclomatic 47): narrowphase._func_multicontact_detect has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4897315f9bfe4a0be0505b57252c4e729d3a02ac14107786ac98bfad4e278d"}},{"ruleId":"D1","level":"warning","message":{"text":"bvh.func_build_bvh (cyclomatic 46): bvh.func_build_bvh has cyclomatic complexity 46 (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":"genesis/engine/bvh.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b6223ac978bdfc52d4f7c29958878ae8d7ee96fd8d61ce057ae2f36ad40a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_hessian_direct_batch (cyclomatic 46): solver.func_hessian_direct_batch has cyclomatic complexity 46 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"b639532e094f26b990df4e1ed0f1f0bba5c88cc3e49adfa658781c2a5c2df463"}},{"ruleId":"D1","level":"warning","message":{"text":"mjcf.parse_link (cyclomatic 46): mjcf.parse_link has cyclomatic complexity 46 (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":"genesis/utils/mjcf.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"923921c57872947f962aae8594963fd5cc6fcbc971d5876f1534d99dccddc516"}},{"ruleId":"D1","level":"warning","message":{"text":"contact.func_contact_support_hull (cyclomatic 44): contact.func_contact_support_hull has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5333d3afff9fe3e90330152b0ebaa560384de33d013f994c56fad47677726875"}},{"ruleId":"D1","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_entity_browser (cyclomatic 44): ImGuiOverlayPlugin._render_entity_browser has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"681c659e9c1c9d6fb4e9661d79046d91fa5829426721bbe134bedd25311cd109"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.indices_to_mask (cyclomatic 44): misc.indices_to_mask has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abb4a9851c14ba390303af44d9d82afd68806f9b0dcd73764e60d8b354bc618"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_collision.apply_collision_filtering (cyclomatic 44): usd_collision.apply_collision_filtering has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_collision.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0727462811d72ea7d3b6718af03a46897f200967fe40e1d870ac5cc2b5eaae50"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.kernel_order_constraints (cyclomatic 43): sap_coupler.kernel_order_constraints has cyclomatic complexity 43 (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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a932f773426e2a0f5bdcd14859d62ea7a5bffdab41a5372e9966964ef856307"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicEntity.attach (cyclomatic 43): KinematicEntity.attach has cyclomatic complexity 43 (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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"63832e553bc289a23b57eb3c12f14438f4c3818eb09e58dbe2c0abe03cdda869"}},{"ruleId":"D1","level":"warning","message":{"text":"solver._add_collision_constraints_per_contact (cyclomatic 43): solver._add_collision_constraints_per_contact has cyclomatic complexity 43 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ecf347e722c9144d4d8e728f5ec5399bb555432eb86de5ed1b8d47f196f3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Camera.set_pose (cyclomatic 43): Camera.set_pose has cyclomatic complexity 43 (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":"genesis/vis/camera.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"471af1dca50cd7511b0191076d7256d58558377551b1f539d4d458a2b84065ad"}},{"ruleId":"D1","level":"warning","message":{"text":"mpr.func_mpr_contact_from_centers (cyclomatic 42): mpr.func_mpr_contact_from_centers has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ace82ec1e2a1cc445eac5e9b51a9c2f2938cdbb7d896f4c60131eecc5ea6675"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_contact_mpr_terrain (cyclomatic 42): narrowphase.func_contact_mpr_terrain has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d80c7187940f26e1b5286c00f5d0d7207364adec87964b03fda955739366a6"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree_shared (cyclomatic 40): forward_dynamics.func_factor_mass_tree_shared has cyclomatic complexity 40 (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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"9643adb5aba05c60a542d7c7d8a20831d3a981811e7855017ce1a42811136d94"}},{"ruleId":"D1","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_scene_editor (cyclomatic 40): ImGuiOverlayPlugin._render_scene_editor has cyclomatic complexity 40 (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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"3317ef736e0829de9d90c88c7e07c8a76e2648edb5c031abfb96d0aca3b20c51"}},{"ruleId":"D1","level":"warning","message":{"text":"epa.func_safe_epa (cyclomatic 39): epa.func_safe_epa has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede4a0cdab799136046608080581025f12cdbefbb9b51cd346e7b8019d37d2af"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_island_hessian_assemble_block (cyclomatic 39): solver.func_island_hessian_assemble_block has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8e85afad232bc98250fb1f225e46a91845658521c8ac8d327a3e29149a669f"}},{"ruleId":"D1","level":"warning","message":{"text":"serialization._load_value (cyclomatic 39): serialization._load_value has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/serialization.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"214a1e2abbccd5454bc456fae5b0c33a4ad02b5f604797a525bf693a2d9be788"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy_coupler.kernel_place_sph_boundary_segments (cyclomatic 38): legacy_coupler.kernel_place_sph_boundary_segments has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c738bab52719aa9c37493d8f8fec31eb7478614c00053f6e8004339559b20d"}},{"ruleId":"D1","level":"warning","message":{"text":"gltf.parse_glb_material (cyclomatic 38): gltf.parse_glb_material has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/gltf.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49cc90cf4b24dbc568d89589b745cc0d8ce71ec9698e21dc464b0d05e3ab2b9"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_midpoint_free_body (cyclomatic 37): forward_dynamics.func_midpoint_free_body has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"512ce4caba60f13e7dcfb4fc8278c95f0ad3ceaf8af87ba546eb8284ca99aaec"}},{"ruleId":"D1","level":"warning","message":{"text":"contact.func_clamp_prune_contacts (cyclomatic 37): contact.func_clamp_prune_contacts has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94b03a700cadf6eee5cdce71a06c636c06713d161b6344bc458a5300199a04e"}},{"ruleId":"D1","level":"warning","message":{"text":"island.func_build_islands (cyclomatic 37): island.func_build_islands has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5643cb69c02fb2b9f52dc0b7dfd3fa09acecb97f6f16cb676e69e37202071ede"}},{"ruleId":"D1","level":"warning","message":{"text":"kernel_writes.get_written_paths (cyclomatic 37): kernel_writes.get_written_paths has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/kernel_writes.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a45a6dd46e8238a274f22e9a0e8183e0f55e67155022b3fffc79b400adc2b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"mjcf.build_model (cyclomatic 37): mjcf.build_model has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/mjcf.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"db10ae658389c1956172e4669300903e4c45313bada178ad9e1fac08cc21d35c"}},{"ruleId":"D1","level":"warning","message":{"text":"IPCCoupler._add_rigid_geoms_to_ipc (cyclomatic 36): IPCCoupler._add_rigid_geoms_to_ipc 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede39bccc8e5a8d48c438e8968b19a80557b55086d891b2fe703a67fcf8ed8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_torque_and_passive_force (cyclomatic 36): forward_dynamics.func_torque_and_passive_force 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4150de1aeb2a375000a43fbcd37f2952ad04751e3201c334487392de5ed295"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_solve_init (cyclomatic 36): solver.func_solve_init 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ed55870ea4dbe4b437d0e1fbf5df8c8a78c61e9e944ea804fb59e427c6efb"}},{"ruleId":"D1","level":"warning","message":{"text":"gltf.parse_mesh_glb (cyclomatic 36): gltf.parse_mesh_glb 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":"genesis/utils/gltf.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ca2770e5d6f7ce53c4b5fe34c67e555cd75f86cab02286cefb6cae55a0f85a"}},{"ruleId":"D1","level":"warning","message":{"text":"island.func_reorder_island_dofs (cyclomatic 35): island.func_reorder_island_dofs has cyclomatic complexity 35 (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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"682bf8a88a7ce92c24c4e26c262cdf540071cca5f210c1c6078024d0a6656b52"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyCoupler._build_sph_boundaries (cyclomatic 34): LegacyCoupler._build_sph_boundaries has cyclomatic complexity 34 (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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb126fc7f78fee5899d49121182e88aee1c83310c97d3d565921a065cb9e7af"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy_coupler.func_project_on_bounds (cyclomatic 34): legacy_coupler.func_project_on_bounds has cyclomatic complexity 34 (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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d850e10b6ffa8eadeec9bea56cbf1fcc50529b949a48ec0d4b678ffe6267fb6c"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_update_envs_active (cyclomatic 34): sap_coupler.func_update_envs_active has cyclomatic complexity 34 (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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3fb067f9e9896b3f874e5707cac67b21adc94ea4c022eda8090427fab4b52"}},{"ruleId":"D1","level":"warning","message":{"text":"solver._add_friction_constraint (cyclomatic 34): solver._add_friction_constraint has cyclomatic complexity 34 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"871cfdf6065f47a3e371741b25b6e5c25ad7cb1d7740a3dd9ec647157949d5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer._get_primitive_program (cyclomatic 34): Renderer._get_primitive_program has cyclomatic complexity 34 (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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0d3d74a336de60fd698f436cc049d10e82a5de4f9daada610072cdc91acc78"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewer._render (cyclomatic 34): Viewer._render has cyclomatic complexity 34 (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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc889ee7f4137e42d8e8f6e0e2c226b68fd077182a649dce74b21e860bee9558"}},{"ruleId":"D1","level":"warning","message":{"text":"Raytracer.build (cyclomatic 34): Raytracer.build has cyclomatic complexity 34 (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":"genesis/vis/raytracer.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c640ac61299de9b65f1bb059ccb3951e893757571d86927d23d903293b3c6af"}},{"ruleId":"D1","level":"warning","message":{"text":"Mesh.from_trimesh (cyclomatic 33): Mesh.from_trimesh 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":"genesis/engine/mesh.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b56f2663a796309fc840920724fbf750bc029ba66cfc65104e25c56f3a3b50a"}},{"ruleId":"D1","level":"warning","message":{"text":"fem_solver.func_accumulate_vertex (cyclomatic 33): fem_solver.func_accumulate_vertex 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a428bd21d3003c353350d24ce1f7d552e9f9f1cc18b77074f549d37fe2237c"}},{"ruleId":"D1","level":"warning","message":{"text":"multi_contact.func_clip_polygon (cyclomatic 33): multi_contact.func_clip_polygon 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f163246c9b3d84862325290fec951a3d34ff4ddb153364786dae2859a5f5832"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver.build (cyclomatic 33): RigidSolver.build 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"db34d3495aaa5f7f85c78003f5b9b5cb9986be42b8983677aae5e0810ccf5543"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver.set_base_links_quat (cyclomatic 33): RigidSolver.set_base_links_quat 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f714cbe3aa9933053d2e59ba63cd1720681ff00382cdb56c479df4765962e9"}},{"ruleId":"D1","level":"warning","message":{"text":"data._allocate (cyclomatic 33): data._allocate 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":"genesis/utils/data.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac697eae3ca6f6ed9e286c12ab07d85679f1356753be494ffb886b4cbe690cf"}},{"ruleId":"D1","level":"warning","message":{"text":"mjcf.parse_geom (cyclomatic 33): mjcf.parse_geom 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":"genesis/utils/mjcf.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda12a1bcae889a35296b67f1e511cbedb1e0083fe81f98c6cb293615b8336a"}},{"ruleId":"D1","level":"warning","message":{"text":"Entity._get_global_idx (cyclomatic 32): Entity._get_global_idx has cyclomatic complexity 32 (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":"genesis/engine/entities/base_entity.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86e20da4b8ce5db142756edcdb530f794451ca63aa68e517c9323cb25259142"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicEntityDescription._load_heterogeneous_morphs (cyclomatic 32): KinematicEntityDescription._load_heterogeneous_morphs has cyclomatic complexity 32 (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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"649e9ca85381ebfbae20891a14f60abda397ada70fd0863eb4d1d42f3ba6fbde"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver._jacobi_mass_spread_bound (cyclomatic 32): RigidSolver._jacobi_mass_spread_bound has cyclomatic complexity 32 (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"094fd46b85dbb172a1f2120ad9de0ea56882c388327f2b70020d4bde3bd9343e"}},{"ruleId":"D1","level":"warning","message":{"text":"_trimesh_patch.load_obj (cyclomatic 32): _trimesh_patch.load_obj has cyclomatic complexity 32 (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":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b082d7c106d9a1f45f8d5cfef19bd888c3975f8317111766848508e0b376e4d3"}},{"ruleId":"D1","level":"warning","message":{"text":"TrajectoryFileWriter.build (cyclomatic 32): TrajectoryFileWriter.build has cyclomatic complexity 32 (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":"genesis/recorders/trajectory.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90cfed0248acd7aec18faa002f7bdb6f3321af119419ec2e8aef2fcde48cac"}},{"ruleId":"D1","level":"warning","message":{"text":"diff_gjk.func_gjk_contact (cyclomatic 31): diff_gjk.func_gjk_contact 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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26035e6a46146bcad08551f5b513f515031cae2967b7b6baab55d0b397cd2db"}},{"ruleId":"D1","level":"warning","message":{"text":"gjk.func_gjk_contact (cyclomatic 31): gjk.func_gjk_contact 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc9b31b0751712dda4aac0e92ddf3659cdd00f0268b0a852dceb4fbee7dc2b0"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver._set_links_info (cyclomatic 31): RigidSolver._set_links_info 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"b664d79206c53b615711856c0ee7ebbed6fc26b012151455b1e082414c71d845"}},{"ruleId":"D1","level":"warning","message":{"text":"JITRenderer.set_primitive (cyclomatic 31): JITRenderer.set_primitive 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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e7ab7e9146d574472592db5947593e8a6f73ba1bf1add1fbe5713cd562dfb5"}},{"ruleId":"D1","level":"warning","message":{"text":"Simulator.build (cyclomatic 30): Simulator.build 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":"genesis/engine/simulator.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b0b77b8a940a08677bd71046618ed7300025293cc81a3c27f3e96d15b9455f"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_narrowphase_contact0 (cyclomatic 30): narrowphase.func_narrowphase_contact0 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8077740439602ee8f582a4723cdbff5965156dd72c056b2bad6c04c6b222892"}},{"ruleId":"D1","level":"warning","message":{"text":"linesearch.func_ls_state_advance (cyclomatic 30): linesearch.func_ls_state_advance 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0caecbaca0b9307713a1f40c5128b2781402b5b385bb5886a32cbc2e3ebd497"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver.set_base_links_pos (cyclomatic 30): RigidSolver.set_base_links_pos 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79830bcd4311b9d2c6b85958ffc11eee45eb00ce9bd13fd3a9703046d710095"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewer.start (cyclomatic 30): Viewer.start 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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83683d07062cede3a8bb95a27ecb51eab0769af91ff775459ba5ed718fbe084"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicEntityDescription._align_free_roots (cyclomatic 29): KinematicEntityDescription._align_free_roots 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a8db7040970bed6404c4dfd7c3d129a10ff54bd98be9215fe26d872b28dbca"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidEntityDescription._describe_link (cyclomatic 29): RigidEntityDescription._describe_link 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"d512746ce00b34c49eabaf264ae2b43a75cefcde1b5b279f209b4e088c36ed18"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointMixin.save_checkpoint (cyclomatic 29): CheckpointMixin.save_checkpoint 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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cb876fff5cb00fd607bf956b2e3afdfa60a90943fd4fef2e7d52285b7a7f44"}},{"ruleId":"D1","level":"warning","message":{"text":"_trimesh_patch.export_obj (cyclomatic 29): _trimesh_patch.export_obj 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":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8077c0f143c667f82b4410498d9be3f193c3db11eaa33ec49d827a2bbec5273"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer.render (cyclomatic 29): Renderer.render 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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d08fcfd109b31ca6e88abf499e8cbcf1108305da7d155376dd57cb7782159cb"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_material.parse_preview_surface (cyclomatic 29): usd_material.parse_preview_surface 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":"genesis/utils/usd/usd_material.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a55eb89bf21e692016ed6549baea14dcabe8ac1fd20a1ef13e195b82b535860"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_link_point_delassus (cyclomatic 28): sap_coupler.func_link_point_delassus 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f182aa52da6e34c18ee139b5850a51af1f4fabe0813d617a3d47beecc7d665"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_compute_vertices_dofs (cyclomatic 28): sap_coupler.func_compute_vertices_dofs 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3831}}}],"partialFingerprints":{"codehealthFindingId/v1":"76978f88cc3a1da935ca710ee8f05be46249c99ec828493ccc9ffb849db73e6c"}},{"ruleId":"D1","level":"warning","message":{"text":"fem_solver.func_build_coarse (cyclomatic 28): fem_solver.func_build_coarse 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0e6796d96e20ff6230eb255f3074a21ae158dd84c2630d47d5d00d83b57cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"fem_solver.func_precondition_env (cyclomatic 28): fem_solver.func_precondition_env has cyclomatic complexity 28 (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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e20276e70b06d2785d1e1231e3a3e0a76e86209b60e5d85150d120aacb14a38"}},{"ruleId":"D1","level":"warning","message":{"text":"mpm_solver.kernel_transfer_particles_to_grid (cyclomatic 28): mpm_solver.kernel_transfer_particles_to_grid 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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a4bdb56e9f8355fd739aab081eae36540e71e3b5119817b42fa65ac6e10462"}},{"ruleId":"D1","level":"warning","message":{"text":"gjk.func_safe_gjk (cyclomatic 28): gjk.func_safe_gjk 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"108b89755e6f96b709d02d5cc06eb21b5d04c5db6159fa1422bf3e7d2c3963cb"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_narrow_phase_nonconvex_vs_nonterrain (cyclomatic 28): narrowphase.func_narrow_phase_nonconvex_vs_nonterrain 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aff2ed6b5c34006464cb19733913d54abfbd429246c27404678d75ad98312e0"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.kernel_init_sap_solve (cyclomatic 27): sap_coupler.kernel_init_sap_solve 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1280c98de7f7234f0c2668612ee5dc9901f483c2e56e5026207b8e8f6fcf760"}},{"ruleId":"D1","level":"warning","message":{"text":"multi_contact.func_potential_box_normals (cyclomatic 27): multi_contact.func_potential_box_normals 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee1fa44d1c1f99b48aa58f91d5191f4b016f5804b71bd90122d6250682f6a4"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.sanitize_index (cyclomatic 27): misc.sanitize_index 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":"genesis/utils/misc.py"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c06a7948d6cb5a69263a2943927e295e6e10ef3cb633b6ed14a542689f2de1"}},{"ruleId":"D1","level":"warning","message":{"text":"watertighten._quadric_decimate_loop (cyclomatic 27): watertighten._quadric_decimate_loop 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":"genesis/utils/watertighten.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f8d7d5af4e09056c3090086a082e6d8e2b20e5d4194501acfa934bdb91ab87"}},{"ruleId":"D1","level":"warning","message":{"text":"Raytracer.update_scene (cyclomatic 27): Raytracer.update_scene 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":"genesis/vis/raytracer.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3651f69cdeb151f6dc8ad38adebb96ca8e43b05e229ae7bb77e6fbf572d173"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicEntity.inverse_kinematics_multilink (cyclomatic 26): KinematicEntity.inverse_kinematics_multilink 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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3bf0535d58829f47025a49faeb786decea50d756d2a72726b651c50fae8bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree_tiled (cyclomatic 26): forward_dynamics.func_factor_mass_tree_tiled 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3514a8962df4ef4dd2978d49b14183e6bb2cf8bd9c5de06a8b2853318f3287"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_integrate (cyclomatic 26): forward_dynamics.func_integrate 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5a735e7a4770e30ba22e2d808fa9fa97186b5b155c0092c3b6d87209fcb16"}},{"ruleId":"D1","level":"warning","message":{"text":"diff_gjk.func_extended_epa (cyclomatic 26): diff_gjk.func_extended_epa 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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f04f5f73401662d6d48660c348c9463e563f27ec266dad298cdf75bfad7a76"}},{"ruleId":"D1","level":"warning","message":{"text":"epa.func_epa (cyclomatic 26): epa.func_epa 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7bb3e586462d33a6c09c8d2f5bc38f10abea26a984ee63a825192a9923c995"}},{"ruleId":"D1","level":"warning","message":{"text":"Primitive._add_to_context (cyclomatic 26): Primitive._add_to_context 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":"genesis/ext/pyrender/primitive.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f93171925f9a00dd85ef7b26be32c76d351fce113c532c7754407d9bd64fa84"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy_coupler.kernel_fem_surface_force (cyclomatic 25): legacy_coupler.kernel_fem_surface_force 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5342ae1d7fdaa7c98980abe4ff3a427159bae26801b282cad38feb3272b911f8"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_gather_fem_vertex (cyclomatic 25): sap_coupler.func_gather_fem_vertex 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f52532415f52c8013ce9b3a057cdf3920dc098e53daa1da77fd3abf2e04e14"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_one_exact_linesearch_iter (cyclomatic 25): sap_coupler.func_one_exact_linesearch_iter 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4944}}}],"partialFingerprints":{"codehealthFindingId/v1":"f444b9539e8397587ce754d36576e188a63d33e2cc046c237e3a75816c6cf3fb"}},{"ruleId":"D1","level":"warning","message":{"text":"FEMSolver.build (cyclomatic 25): FEMSolver.build 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"87197aaf695c781258c6c91c26cdea95cc1a3da1565dea9240bde3c0e62d5881"}},{"ruleId":"D1","level":"warning","message":{"text":"linesearch.func_row_alpha_terms (cyclomatic 25): linesearch.func_row_alpha_terms 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3539376a4c4dbefc1737062969a4b6305411c95464698bdfc063445bacef98a"}},{"ruleId":"D1","level":"warning","message":{"text":"solver._sort_contacts_and_build_islands (cyclomatic 25): solver._sort_contacts_and_build_islands 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"87330a5d0de047ec522ba93ecdb5058db0626757c38980077f6743ae947df5d0"}},{"ruleId":"D1","level":"warning","message":{"text":"RRTConnect.plan (cyclomatic 25): RRTConnect.plan 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":"genesis/utils/path_planning.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"e106fadb55b8192309752afdcda9fe46d93beea74e8ecaf42afcea2d9d2e7563"}},{"ruleId":"D1","level":"warning","message":{"text":"FEMSelfContactHandler.detection (cyclomatic 24): FEMSelfContactHandler.detection 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4be7c0250128d650f6b201a7f0a241ae1eba8da51f901cd85ab3beb2ead495"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidRigidContactHandler.detection (cyclomatic 24): RigidRigidContactHandler.detection 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":7304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2728ebf19c9d936effef4d32e84d3e4e3e120ced5b52e36e75776dc3afb7d67"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicSolver.build (cyclomatic 24): KinematicSolver.build 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fa63446467dceb2878f4b76cdb4b107e5308faa88e79e97848b9cf9ff34253"}},{"ruleId":"D1","level":"warning","message":{"text":"epa.func_epa_init_polytope_3d (cyclomatic 24): epa.func_epa_init_polytope_3d 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2e1a8fdb8255c768f2a48aad935d2cd515b841fd98b255ca9d8504d1c4f4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_add_dynamic_constraint_rows_batch (cyclomatic 24): solver.func_add_dynamic_constraint_rows_batch 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba8c6a6c1b89f175d294e6e9c9042e83a8564cacdab63f874bcbec09d1810c"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer._bind_and_draw_primitive (cyclomatic 24): Renderer._bind_and_draw_primitive 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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"556146895910fa111e65f022b86ea769641ba0de904dfe320174b5fa87a0fc14"}},{"ruleId":"D1","level":"warning","message":{"text":"terrain.parse_terrain (cyclomatic 24): terrain.parse_terrain 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":"genesis/utils/terrain.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5bdf7689577c05ad7e925cd4f6aa3855db169764b5e1f2fbe3875c221c95fa"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidFEMContactHandler.detection (cyclomatic 23): RigidFEMContactHandler.detection 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6970}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3e6a6a1faf3e873a311bb4e2d5b11c24a80a3358de76635f671d697ab956ca"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_invert_rigid_hessian (cyclomatic 23): sap_coupler.func_invert_rigid_hessian has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2fb4f7de91335e2f139b5be6adc736b32015cd27011051e3124d6434f7933f"}},{"ruleId":"D1","level":"warning","message":{"text":"KinematicEntityDescription._resolve_geoms_values (cyclomatic 23): KinematicEntityDescription._resolve_geoms_values 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a56c8bce45872e18373b7e1b712ffc4cea069e91e1502e7ced28ef45eb300"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree_global (cyclomatic 23): forward_dynamics.func_factor_mass_tree_global 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"582a3ebaf6886c6d38c203f4852a6976b84b7722fa33ec9bd75f501ccde614fc"}},{"ruleId":"D1","level":"warning","message":{"text":"surfaces._make_rgba (cyclomatic 23): surfaces._make_rgba 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":"genesis/options/surfaces.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"125945eba9985f88e46410e3c61d57f590fa60f303885f71d09455a5ea288426"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.broadcast_tensor (cyclomatic 23): misc.broadcast_tensor 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":"genesis/utils/misc.py"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"519548408e65d0d227ee271425f92512b7d7a3d92166310b593c98590a067b46"}},{"ruleId":"D1","level":"warning","message":{"text":"RRT.plan (cyclomatic 23): RRT.plan 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":"genesis/utils/path_planning.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fa80cfe98355b05ed29ed8ee4bfd59303e45d1c6b315b23bbd587f0d302f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"UsdContext.find_all_materials (cyclomatic 23): UsdContext.find_all_materials 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb34b54d57d5d27f3369109a863d600b11579919acf9b64f0fa951df781445fd"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractiveScene._apply_rebuild (cyclomatic 22): InteractiveScene._apply_rebuild 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":"genesis/engine/interactive_scene.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187d162ed08080f52bbcd9278cdd317247aed2ebbf68402dfca8c1afcad3ec8"}},{"ruleId":"D1","level":"warning","message":{"text":"point_cloud_tactile._kernel_point_cloud_proximity_taxel_bvh (cyclomatic 22): point_cloud_tactile._kernel_point_cloud_proximity_taxel_bvh has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c93fdc0b9d65a8fbf450b41b1d86da6db07c3ce9a2e933c8c9b059d7f41762c"}},{"ruleId":"D1","level":"warning","message":{"text":"fem_solver.func_linesearch_iter (cyclomatic 22): fem_solver.func_linesearch_iter 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0b62dd04c296b71b58053923d2d5b1af72d1f1d56ccd5270f6054f9a53f479"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_kinematics.func_sweep_links_by_level (cyclomatic 22): forward_kinematics.func_sweep_links_by_level 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28106904e2674d1fc965076df9967aa06639fe8f641008b77f6356383c11782"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_bw.func_forward_kinematics_link_bw (cyclomatic 22): manual_bw.func_forward_kinematics_link_bw has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"29eae11a2db6763e337b5c83fc40d7ceacccab41d7a6401130637951304981ba"}},{"ruleId":"D1","level":"warning","message":{"text":"linesearch.func_search_single_island (cyclomatic 22): linesearch.func_search_single_island 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfec1c3abf4de62dc8a708bdc74c898e512084a0a0a17bc9584b1d93e4f96a"}},{"ruleId":"D1","level":"warning","message":{"text":"noslip.func_noslip_update_row (cyclomatic 22): noslip.func_noslip_update_row 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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d8280c9acdbbfc03aeffd87db23f5238e2d65a3860e95e1f7c351d0244a2d7"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver._set_dofs_info (cyclomatic 22): RigidSolver._set_dofs_info has cyclomatic complexity 22 (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f119cbcde405a606a4585f6e8dca25ce71356e5b805388d07b67650872f595dc"}},{"ruleId":"D1","level":"warning","message":{"text":"JITRenderer.update_context (cyclomatic 22): JITRenderer.update_context has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48bfd2e1a9d1cf87510586b767fcc5f3ae748c9a9081405be7bc75976d545d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Mesh._get_trimesh_props (cyclomatic 22): Mesh._get_trimesh_props 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":"genesis/ext/pyrender/mesh.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e442b854288017983790768ce76f7d7fa08659f6fc164eef6a016ad15c81f6"}},{"ruleId":"D1","level":"warning","message":{"text":"OffscreenRenderer.render (cyclomatic 22): OffscreenRenderer.render has cyclomatic complexity 22 (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":"genesis/ext/pyrender/offscreen.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7815c5de2603366713d8539d157b5fc32a75dec533411cae0f0a6a0c0ea8b91d"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.format_texture_source (cyclomatic 22): utils.format_texture_source 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":"genesis/ext/pyrender/utils.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ffb54f522194644a3e485173bd62c258ec1d0b2ee5bb3073e1c8f15e2b5813"}},{"ruleId":"D1","level":"warning","message":{"text":"MPLLinePlotter._update_plot (cyclomatic 22): MPLLinePlotter._update_plot 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":"genesis/recorders/plotters.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e459256a2d24a06f96adf9379f6f910b868b80a8e05148e760a6cc0526db1"}},{"ruleId":"D1","level":"warning","message":{"text":"RasterizerContext.update_rigid (cyclomatic 22): RasterizerContext.update_rigid 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0d14aefc8084cedb9b0a304a0ea41759155ed7e8cb85b802d661c8fc56fce1"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.kernel_update_vel (cyclomatic 21): sap_coupler.kernel_update_vel has cyclomatic complexity 21 (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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1ba08009e33e297d4a9a7b6e6cc88f835e618d9dbe5e3d3b47ac6e6116e1cf"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_kinematics.func_forward_kinematics_link (cyclomatic 21): forward_kinematics.func_forward_kinematics_link 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8346d0efc905271e962c5bee7cf354924c057820c6b601d9e1f4ec7533d508"}},{"ruleId":"D1","level":"warning","message":{"text":"gjk.func_gjk (cyclomatic 21): gjk.func_gjk 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d054e14a1cd8816e72f883d7b276f21a8edf014eee0b3721c9d4667f5c32008e"}},{"ruleId":"D1","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_file_browser (cyclomatic 21): ImGuiOverlayPlugin._render_file_browser 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"28207437b2786fffa4c6f61afc5022f9cb76a5a4bc0a68b7ba1a29667c449c86"}},{"ruleId":"D1","level":"warning","message":{"text":"geom.func_sort_particles_by_slot (cyclomatic 21): geom.func_sort_particles_by_slot has cyclomatic complexity 21 (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":"genesis/utils/geom.py"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a9255c0b996bd6a42f2031d8611fd68ec2c8bd255c8ff5cfe96ddc21400802"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.get_gpu_shared_tile_sizes (cyclomatic 21): misc.get_gpu_shared_tile_sizes 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":"genesis/utils/misc.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e6f7585e7869bb21b17a3e366696137ef661c9e76ef7f7232a146d555ec0ce"}},{"ruleId":"D1","level":"warning","message":{"text":"serialization._export_value (cyclomatic 21): serialization._export_value has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/serialization.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce76a08c7a3b12c79ec9eeb56b1d09e167284b606fd1c6cd0230a9bf4bb87456"}},{"ruleId":"D1","level":"warning","message":{"text":"GenesisGeomRetriever.retrieve_rigid_meshes_static (cyclomatic 21): GenesisGeomRetriever.retrieve_rigid_meshes_static 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":"genesis/vis/batch_renderer.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"764715c8311441bcb32b266f80475648203d76df5f0026eb6708d28ad51278d7"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.kernel_sum_contact_patches (cyclomatic 20): sap_coupler.kernel_sum_contact_patches 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c08677439ffddf16be45c019799fe33b48bdf68e400f45cb677d8be87f4383b"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_compute_link_wrench (cyclomatic 20): sap_coupler.func_compute_link_wrench 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b8ebc4dc83f8b36893f8f05fda79244b257e00bccde5bfb65fa24055aa7ce7"}},{"ruleId":"D1","level":"warning","message":{"text":"SensorManager._resolve_sensor_cls (cyclomatic 20): SensorManager._resolve_sensor_cls 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":"genesis/engine/sensors/sensor_manager.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca76d5770c0b8ba6f870965486bf9f8075d59e4b6da2e77a5d62498e5cf1875"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_refresh_links_invweight_and_meaninertia (cyclomatic 20): forward_dynamics.func_refresh_links_invweight_and_meaninertia 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"216bb2e83c492cda9b13327b1020e2b69b1c30fc4d5ebe0dd458ba6f2a1bf5c5"}},{"ruleId":"D1","level":"warning","message":{"text":"backward.kernel_manual_add_collision_constraints_bw (cyclomatic 20): backward.kernel_manual_add_collision_constraints_bw 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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba8a42a56850f2bc2e598ba5a3737e60494581b3adf58cb0fe64832110b965f"}},{"ruleId":"D1","level":"warning","message":{"text":"noslip.func_refresh_qacc_batch (cyclomatic 20): noslip.func_refresh_qacc_batch 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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eaa45b82323deeaddd75829fca43f0f0aaa7f289f961ac39e8e5bd51af1d49"}},{"ruleId":"D1","level":"warning","message":{"text":"solver._func_contact_row_direction (cyclomatic 20): solver._func_contact_row_direction 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc141ac0890e6634dbc31c305585606caba7c1448b2eb68cc2f4fa22f5a0942c"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_cholesky_solve_batch (cyclomatic 20): solver.func_cholesky_solve_batch 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc1d984975024363b2d0f8c18bf51dde7c5b1ef198ad87abfd55e2e642b05c"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene.add_node (cyclomatic 20): Scene.add_node 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":"genesis/ext/pyrender/scene.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b034ee0b67885fa54a8e73fc9e7a5c063e025bc982c1df3848b36ccb93aead5d"}},{"ruleId":"D1","level":"warning","message":{"text":"URDF.animate (cyclomatic 20): URDF.animate 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdaef17e05ca22ce6e3b724e9c8cb6a75bad7834e3aa9d1e6f9d92720eafe036"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchRecorder.insert (cyclomatic 20): LaunchRecorder.insert 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":"genesis/grad/bridge.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eb38ade7ff0a9ab014146b36b8308e5f05500c6d9ae8f55ccc19790ecf8ab3"}},{"ruleId":"D1","level":"warning","message":{"text":"Options._validation_error (cyclomatic 20): Options._validation_error 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":"genesis/options/options.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"94580b9c7f856917f0e4edeca197e327f26273c737427b7db139de646b08663c"}},{"ruleId":"D1","level":"warning","message":{"text":"Trajectory.__init__ (cyclomatic 20): Trajectory.__init__ 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":"genesis/recorders/trajectory.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab987fab42228483e7a670839220d6f3692a428c2821fd601dd4fd63fa16dab"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameImageExporter.export_frame_single_camera (cyclomatic 20): FrameImageExporter.export_frame_single_camera 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":"genesis/utils/image_exporter.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7e0e30259c184641f94713cbea84ee791a9bc96a46c0cd0faacb7f13dda98"}},{"ruleId":"D1","level":"warning","message":{"text":"mesh._cast_rays_bvh (cyclomatic 20): mesh._cast_rays_bvh 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":"genesis/utils/mesh.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"88008c5ca72927b84d60a8332e411c32e3f769f09c47d73ecad99189ac0419f5"}},{"ruleId":"D1","level":"warning","message":{"text":"particle._advect_foams (cyclomatic 20): particle._advect_foams 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":"genesis/utils/particle.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"912a9d1260d46f2f4e37dee92b0524754cede39ddba44bd7cc7962cb4efc63ba"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_rigid_entity.parse_usd_rigid_entity (cyclomatic 20): usd_rigid_entity.parse_usd_rigid_entity 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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c314cc1946820776a9186674155d1fed811b1c33d6538b3731e4917bda0e5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_stage._find_connected_components (cyclomatic 20): usd_stage._find_connected_components 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":"genesis/utils/usd/usd_stage.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9e31d9720d5cc8667594b23f1dc91bd7be8e85c2fe1748d803d89f2c4b2dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"Camera.render (cyclomatic 20): Camera.render 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":"genesis/vis/camera.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e547d38e0ea77f4e16ed8913884d51fd8e3bce19675f5432565748d9028ec4"}},{"ruleId":"D1","level":"warning","message":{"text":"SensorManager.build (cyclomatic 19): SensorManager.build 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":"genesis/engine/sensors/sensor_manager.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a408e4998103550f442d0e59cc74a55ef085168d73e5813e2bf743f4b7898b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"TemperatureGridSensor.build (cyclomatic 19): TemperatureGridSensor.build 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":"genesis/engine/sensors/temperature.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f007e181a21af2c6591748c889a6c47ad30ba04c50fe38f42eac497cf90d5926"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_init_dofs_invweight (cyclomatic 19): forward_dynamics.func_init_dofs_invweight 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9108e4a96e4d6252eaf4e54e1f3ff027fbff93a8b5dca8142b2fa01bb26b245c"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_bw.func_forward_velocity_link_bw (cyclomatic 19): manual_bw.func_forward_velocity_link_bw has cyclomatic complexity 19 (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":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd25a13ae7aa269cd603683a4b6dabd21727b951542c5f233846da05810b226e"}},{"ruleId":"D1","level":"warning","message":{"text":"gjk.func_gjk_subdistance (cyclomatic 19): gjk.func_gjk_subdistance 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dd6b50cbe76dcc00499178990867e005873a5058bd94df4a96827c4c688d70"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_factor_island_incremental_or_direct (cyclomatic 19): solver.func_factor_island_incremental_or_direct 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf49ee20ee32ba449ce94d636172db0003d16d302081b2f6d39a5555009a859b"}},{"ruleId":"D1","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_sim_controls (cyclomatic 19): ImGuiOverlayPlugin._render_sim_controls has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb4c3c77eca377626096ea1cff6650297f2d99a51836d97c10bc9a7a30a3b27"}},{"ruleId":"D1","level":"warning","message":{"text":"Texture._add_to_context (cyclomatic 19): Texture._add_to_context has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/texture.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd04096ca74f5d68dcade0187e67d33a3e83cedc1456dd614ce6d9dcca832b9"}},{"ruleId":"D1","level":"warning","message":{"text":"TrajectoryFileWriter._compress_frames (cyclomatic 19): TrajectoryFileWriter._compress_frames 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":"genesis/recorders/trajectory.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1fac41bec79ad1fc728a0adfe1baa27be63e0ba561e4cf446d1e91f6d27fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"particle._relax_volume_sampling (cyclomatic 19): particle._relax_volume_sampling has cyclomatic complexity 19 (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":"genesis/utils/particle.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"911038188a0515136b17a46ecee6332537779688986f96f5ac5fd09a1d5f2c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"usd_rigid_entity._parse_articulation_structure (cyclomatic 19): usd_rigid_entity._parse_articulation_structure 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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"097d42341ff3973e54f5a33b3def80f265aaf7c2b804c1da688e7b26f0c8a45d"}},{"ruleId":"D1","level":"warning","message":{"text":"sap_coupler.func_init_exact_linesearch (cyclomatic 18): sap_coupler.func_init_exact_linesearch 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59b13358a30ae847af7f23c0a977ac84538c9e0187f70a1cdb624d2f2ea0455"}},{"ruleId":"D1","level":"warning","message":{"text":"ElastomerTaxelSensor.build (cyclomatic 18): ElastomerTaxelSensor.build 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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe574c0c21f2230ed1a8b9acce905e29e270868f938a17c6777ea64e96b17c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver._sanitize_io_variables (cyclomatic 18): Solver._sanitize_io_variables 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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1cc1b7a23804937c6a6cbcc983fc181a333a2c12b55d272e245c2931224c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"mpm_solver.func_gather_particles (cyclomatic 18): mpm_solver.func_gather_particles 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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"da39714485b961e6f3677b139b97deb0a5774c00ca05725a455d4e6f5f56d4ac"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.kernel_refresh_invweight_and_meaninertia (cyclomatic 18): forward_dynamics.kernel_refresh_invweight_and_meaninertia 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0812a221d88f27527c845e698ec27b46b0e0c48e791e9e4b34f94c708db3f48"}},{"ruleId":"D1","level":"warning","message":{"text":"Collider._init_config (cyclomatic 18): Collider._init_config 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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e74f9ca2408010696c261a26470504e2d4a541d9e1f300c299ede19006e8c"}},{"ruleId":"D1","level":"warning","message":{"text":"epa.func_epa_init_polytope_2d (cyclomatic 18): epa.func_epa_init_polytope_2d 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"941cd37147e56b99ad49f43945c150fca32bd3bcfbb8f9acf52d704b980d2205"}},{"ruleId":"D1","level":"warning","message":{"text":"linesearch.func_exit_islands_coop (cyclomatic 18): linesearch.func_exit_islands_coop 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c767d2b2b80d2abc45c76b1d50470ecc5613f8e9f6d71b2dd5be65299d80a624"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_island_hessian_patch_block (cyclomatic 18): solver.func_island_hessian_patch_block 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b73556046cd36a170077ee4714c6f11131c446f792e4b0310c9eea962705ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_apply_staged_rank_updates_island (cyclomatic 18): solver.func_apply_staged_rank_updates_island 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a79bb9a37f07d31a2cacddc8f56ec46829857a4580f586870628b9cd0eb47e0"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_cone_rank_update_island (cyclomatic 18): solver.func_cone_rank_update_island has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"687a3b2c2eadf74f1ad48ad2ab2541e0522aa2528ce20027786b61f10949fd33"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_update_constraint_batch (cyclomatic 18): solver.func_update_constraint_batch 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e208252cc27753ab973837f6d33d20e351b663a705e073f3813617c08cf80b32"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver.__init__ (cyclomatic 18): RigidSolver.__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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b40b100f7bb154983aec4794d18bad35ac4b7f3c2d42f4b1f5d35372b34c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewer.on_close (cyclomatic 18): Viewer.on_close 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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"82168a58cfef6fd04475f78fe1dc2341d1598da8d844a463cb620213c1d5c05a"}},{"ruleId":"D1","level":"warning","message":{"text":"URDF.link_fk (cyclomatic 18): URDF.link_fk 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. This shape REPEATS in the file: one other method here (URDF.link_fk_batch) 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b516b2730a483c4dffe472a424c62d83588d9d71f110fda973507e49f4e76f7"}},{"ruleId":"D1","level":"warning","message":{"text":"URDF.link_fk_batch (cyclomatic 18): URDF.link_fk_batch 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. This shape REPEATS in the file: one other method here (URDF.link_fk) 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff07b7af2be0408305fb24c2585beca1bd5eb4c7ad0dec78cc6283dc56e8876"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageTexture._validate_and_load (cyclomatic 18): ImageTexture._validate_and_load 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":"genesis/options/textures.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f414dad603f2afd9fcaca47091717f5c9fa81012e26992fe5d5da38eb951725"}},{"ruleId":"D1","level":"warning","message":{"text":"data.iter_data (cyclomatic 18): data.iter_data 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":"genesis/utils/data.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa1d660d5c89c0abfa19815264fcf1a50468ea07e95e745e33c214b7242889"}},{"ruleId":"D1","level":"warning","message":{"text":"geom.trans_R_to_T (cyclomatic 18): geom.trans_R_to_T 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":"genesis/utils/geom.py"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62a8bb505583b97abc36051be8b52fcf34ca64803ea29f5a61a1ba45cd8f596"}},{"ruleId":"D1","level":"warning","message":{"text":"RRTConnect._kernel_rrt_connect_step1 (cyclomatic 18): RRTConnect._kernel_rrt_connect_step1 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":"genesis/utils/path_planning.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fcda81f5b3031e0d8605895dc8d12ee7ca5fcc8a5c5329f5d7578c91a815eb"}},{"ruleId":"D1","level":"warning","message":{"text":"watertighten._collapse_safe (cyclomatic 18): watertighten._collapse_safe 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":"genesis/utils/watertighten.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f84ec05cc32d17b50e02b291154ccb11d8fb5b7a6b926a621db26ccba04626"}},{"ruleId":"D1","level":"warning","message":{"text":"Camera.build (cyclomatic 18): Camera.build 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":"genesis/vis/camera.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa76593dcf11c979e15537e0b1c4cd1fe6a96cae405ee8625d4081d339840d2"}},{"ruleId":"D1","level":"warning","message":{"text":"IPCCoupler._add_articulation_entities_to_ipc (cyclomatic 17): IPCCoupler._add_articulation_entities_to_ipc 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f4a8165425a1720e4681ec0ce6c74afcf263e6ad8899dd0f572faf5ec11234"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidJointDescription.__post_init__ (cyclomatic 17): RigidJointDescription.__post_init__ 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b38f091c57295817bc2ac13cb671d685d03b4ae22200f60b60578957a35db15"}},{"ruleId":"D1","level":"warning","message":{"text":"Sensor.__init_subclass__ (cyclomatic 17): Sensor.__init_subclass__ 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":"genesis/engine/sensors/base_sensor.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68db70e6e1da465194be5910e504a0dfd6cc34d293b625be54129b75b3d0bff"}},{"ruleId":"D1","level":"warning","message":{"text":"contact.func_contact_is_after (cyclomatic 17): contact.func_contact_is_after 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f06585006f4c4a647b08c611a42792d06cc55a5c8d3fac8dbcfdf38457a8944"}},{"ruleId":"D1","level":"warning","message":{"text":"island.func_group_constraints_by_island_coop (cyclomatic 17): island.func_group_constraints_by_island_coop 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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"144f967076d011ceb4732fb7b2aa2a6e8c467ef6f1d18b2170b6feabdeb732b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintSolver.__init__ (cyclomatic 17): ConstraintSolver.__init__ 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2facbd9861e7909dbf01c782e7d63d8979c4576471fa810eef5080490476521f"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_add_cone_hessian_block_island (cyclomatic 17): solver.func_add_cone_hessian_block_island has cyclomatic complexity 17 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"697882cccf8841c69e147d0cb18cc98c278c201273180ccccd40e978d891e438"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_cone_rank_update_whole_env (cyclomatic 17): solver.func_cone_rank_update_whole_env has cyclomatic complexity 17 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e609b6b24ae9ce0869f8efd01bebda96d8bd846bed76462ef2bb3c693057ded9"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver._init_tree_fields (cyclomatic 17): RigidSolver._init_tree_fields has cyclomatic complexity 17 (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aacab59ee390e7b5c005d7dd5c39a6e5fe194bdcf4ba8bbbe621318de3e38e"}},{"ruleId":"D1","level":"warning","message":{"text":"_trimesh_patch._parse_vertices (cyclomatic 17): _trimesh_patch._parse_vertices 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":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dbfb3799f666f7f88dcac28631ab43ee19c49f7397243b55c3023fc8949e71"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene._remove_node (cyclomatic 17): Scene._remove_node 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":"genesis/ext/pyrender/scene.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efb9f1221e4282e7eeba8a8c2ac5e693e0290673c13d075c7c3e0a00e0dd980"}},{"ruleId":"D1","level":"warning","message":{"text":"TrajectoryFileWriter._get_frame (cyclomatic 17): TrajectoryFileWriter._get_frame 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":"genesis/recorders/trajectory.py"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"4060a444bd7d8d60d864bfe6c10b62ba42e61ef7f8ee2f7583b8d8c620b0c10c"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.unique_rows (cyclomatic 17): misc.unique_rows has cyclomatic complexity 17 (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":"genesis/utils/misc.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8dfc7890828940713d4c42b4c5bbbd68f5cf2a83b7188799eecec40a5e7c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"serialization.load (cyclomatic 17): serialization.load 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":"genesis/utils/serialization.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cececda7662714c16a03849490fcee0fe8b8be802f22b88532842e400012c4"}},{"ruleId":"D1","level":"warning","message":{"text":"RasterizerContext.on_rigid (cyclomatic 17): RasterizerContext.on_rigid 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"1729859dce6620ae3f15903791460d75786159ab2dcaaa720aab22ea1fbcaf59"}},{"ruleId":"D1","level":"warning","message":{"text":"Alarm.fetch_wandb_data (cyclomatic 16): Alarm.fetch_wandb_data 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":".github/workflows/scripts/alarm.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e273150e22bb43cedca95e920174f8b29d22e3e9de1397c37cb4ebaf8473e0e"}},{"ruleId":"D1","level":"warning","message":{"text":"bvh.func_bvh_traverse (cyclomatic 16): bvh.func_bvh_traverse 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":"genesis/engine/bvh.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5917b33de5c0c303c7ee877991e6726531b1353e50f0ba773610dc572e4235"}},{"ruleId":"D1","level":"warning","message":{"text":"IPCCoupler._add_fem_entities_to_ipc (cyclomatic 16): IPCCoupler._add_fem_entities_to_ipc 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ba9360f6c8bfcd1882e7dfac5c8e95faab70ff0f2defeb1feb610bcfd92a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidJoint.dofs_length (cyclomatic 16): RigidJoint.dofs_length 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":"genesis/engine/entities/rigid_entity/rigid_joint.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0daa4c31864da26a3b77f296ec140cfbfaf2f92589d2fb91dc6d1d102a0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointMixin.load_checkpoint (cyclomatic 16): CheckpointMixin.load_checkpoint 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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7532e25c85d4483c6c8c77f7efa3be42d0f60a60b768cae6ab7b66a447c393"}},{"ruleId":"D1","level":"warning","message":{"text":"fem_solver.func_init_pcg (cyclomatic 16): fem_solver.func_init_pcg 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd2ac5eef1efa5c9acedec7ee06864f61efc2c025721040686f3997a62ad942"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_init_link_invweight (cyclomatic 16): forward_dynamics.func_init_link_invweight 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb814e7d5117e929aeb59ae9fc28b3fd59c8d51861663a5e013f39e14758cef0"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_dynamics.func_implicit_damping (cyclomatic 16): forward_dynamics.func_implicit_damping 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"96caa2949d7cd52c7f990d38d755f75a85548e0e77bcd44d1d0abfc053b3ceb4"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_kinematics.func_forward_velocity_link (cyclomatic 16): forward_kinematics.func_forward_velocity_link 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"3650228f510176cdf93fc032c3d77eb6d17cff16126be2abe1e088986c384e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"forward_kinematics.func_update_cartesian_space (cyclomatic 16): forward_kinematics.func_update_cartesian_space 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3c27ed67b8cf429264fd3ea3f8c2feb4d81f15c44484124cf4de97db5b0198"}},{"ruleId":"D1","level":"warning","message":{"text":"inverse_kinematics.func_get_jacobian (cyclomatic 16): inverse_kinematics.func_get_jacobian 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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed3b28543c1cf36917bb2904d1f9d7dedd2adadd025e2ce444708323916bdb5"}},{"ruleId":"D1","level":"warning","message":{"text":"broadphase._func_broad_phase_links_sap (cyclomatic 16): broadphase._func_broad_phase_links_sap 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":"genesis/engine/solvers/rigid/collider/broadphase.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"847c886327d74a794e3b038b1268b2196292583cf239a54752ab9453ac1fb9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Collider.__init__ (cyclomatic 16): Collider.__init__ 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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d413418fb286d9b136923b57065be029e00c34b6684015960d4751124d67150a"}},{"ruleId":"D1","level":"warning","message":{"text":"contact.func_collider_clear_env (cyclomatic 16): contact.func_collider_clear_env 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08a306f76bc53fc6c608d73dc6623331d139d445bd6a95313a24d758f36ca6f"}},{"ruleId":"D1","level":"warning","message":{"text":"mpr.mpr_find_pos (cyclomatic 16): mpr.mpr_find_pos 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":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5b5446c124fff5dbe50562fdcab599f9ea7fc790b9e5a894889f6cd41428ac"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_contact_convex_convex_sdf (cyclomatic 16): narrowphase.func_contact_convex_convex_sdf 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7067d725f947f498a77a4a555c232be3ff253705944e22ad1c9f1785f96563"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase._func_multicontact_run_detection (cyclomatic 16): narrowphase._func_multicontact_run_detection 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e709c4c39c2109ec72d37e1068369321374be307bd7aa66894fffac10e2aadbc"}},{"ruleId":"D1","level":"warning","message":{"text":"narrowphase.func_narrow_phase_any_vs_terrain (cyclomatic 16): narrowphase.func_narrow_phase_any_vs_terrain 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4835}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7abf87b0b15c0256d59fa8323afd58158ab3687419c35e370d132afa8c7795"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_add_relative_motion_rows (cyclomatic 16): solver.func_add_relative_motion_rows 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"66abc8da47b0f11cc48bd17cbe3e8fe87047d60d3da9bb518e1edc01777ee466"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.func_cholesky_factor_direct_batch (cyclomatic 16): solver.func_cholesky_factor_direct_batch 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"4613b8fd11b909eea70380e9ebe56b6d001a1880b943928b2a15452124390566"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidSolver.substep (cyclomatic 16): RigidSolver.substep 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2588f2ad87553b7fe9e9957270b0beac5746d4ea2e0cd7ce2e351632fb2b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"sph_solver.func_solver_iteration (cyclomatic 16): sph_solver.func_solver_iteration 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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6723e0cec8e650c54f06ff65f35ced58d2e66dd87cc09df5cbfc57db004fbbf"}},{"ruleId":"D1","level":"warning","message":{"text":"jit_render.bind_lighting (cyclomatic 16): jit_render.bind_lighting 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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93f384f16f3c0c5c398499ca21ba102b96f40ee09188147745b8da16e60964e"}},{"ruleId":"D1","level":"warning","message":{"text":"PathPlanner._func_check_collision (cyclomatic 16): PathPlanner._func_check_collision 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":"genesis/utils/path_planning.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"18998ae3b7669366ce94be91ad3c32d44d68cc2faae8419b283e7fc4aecc8dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"MouseInteractionPlugin.on_draw (cyclomatic 16): MouseInteractionPlugin.on_draw 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":"genesis/vis/viewer_plugins/plugins/mouse_interaction.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"234650272af3ca97960f2aa9a97365e51eed9d5e0bf29fca3ff7b860df079242"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_add_polytope_vertex_contacts_sdf (cognitive 570): narrowphase.func_add_polytope_vertex_contacts_sdf has cognitive complexity 570 (threshold 15). Drivers by points: if/else 100 (451 pts), loops 23 (93 pts), boolean chains 17, ternaries 2 (9 pts) (nesting depth added 428). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffe563c3823d04d078186902b2e67ec6ff1e6a52650dce22ae36e32d3ff3db8"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_contact_overlap_axes (cognitive 557): narrowphase.func_contact_overlap_axes has cognitive complexity 557 (threshold 15). Drivers by points: if/else 63 (276 pts), loops 44 (220 pts), ternaries 12 (44 pts), boolean chains 17 (nesting depth added 421). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fa474c1bceb6bf30bdca6714a334d06a1cced3d66301e059c57852f01a0e54"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_clamp_prune_contacts_coop (cognitive 403): contact.func_clamp_prune_contacts_coop has cognitive complexity 403 (threshold 15). Drivers by points: if/else 48 (250 pts), loops 25 (131 pts), ternaries 2 (15 pts), boolean chains 7 (nesting depth added 321). 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9515f16a6f8c832a52dd94c8368a4853fab6976eb4ec96efc0d787c199e7af"}},{"ruleId":"D2","level":"warning","message":{"text":"box_contact.func_box_box_contact (cognitive 388): box_contact.func_box_box_contact has cognitive complexity 388 (threshold 15). Drivers by points: if/else 56 (218 pts), loops 25 (92 pts), ternaries 18 (68 pts), boolean chains 10 (nesting depth added 279). 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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b62300150d169dd54926385b39e1f64c7bd0230ae11c37c5058c8fb30eca4f9"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_linesearch_islands_coop (cognitive 266): linesearch.func_linesearch_islands_coop has cognitive complexity 266 (threshold 15). Drivers by points: if/else 39 (151 pts), loops 30 (113 pts), boolean chains 2 (nesting depth added 195). 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e80034f46d5e179cd946dfa583e72363298fe8852e9701d12bcc6e5ee00030"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_add_polytope_vertex_contacts_sdf_shell (cognitive 264): narrowphase.func_add_polytope_vertex_contacts_sdf_shell has cognitive complexity 264 (threshold 15). Drivers by points: if/else 40 (172 pts), loops 10 (50 pts), ternaries 5 (33 pts), boolean chains 9 (nesting depth added 200). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a44e059a6e5623909eb0b81c868e22b7b123286f5e5a5665d147c40b37f9861"}},{"ruleId":"D2","level":"warning","message":{"text":"backward.kernel_manual_add_equality_constraints_bw (cognitive 253): backward.kernel_manual_add_equality_constraints_bw has cognitive complexity 253 (threshold 15). Drivers by points: loops 24 (115 pts), if/else 20 (84 pts), ternaries 11 (54 pts) (nesting depth added 198). 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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8c4c7c0af989a21af34de3d9c8cee5eeb63f1d9b17d86736177943fe33f7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_convex_convex_contact (cognitive 230): narrowphase.func_convex_convex_contact has cognitive complexity 230 (threshold 15). Drivers by points: if/else 40 (187 pts), loops 5 (30 pts), boolean chains 13 (nesting depth added 172). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2195e4960e5b96b83b193824cdf6bcc5d2679f7e43f7b5ac3b7607f6b7a9009"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_narrowphase_multicontact (cognitive 215): narrowphase.func_narrowphase_multicontact has cognitive complexity 215 (threshold 15). Drivers by points: if/else 29 (137 pts), loops 10 (59 pts), ternaries 2 (11 pts), boolean chains 8 (nesting depth added 166). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3995}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0150e01450626a79cb1ac03b570c20e43ec9d153a17add9288f58da5ba9db5"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_island_assemble_factor_solve_tiled (cognitive 213): solver.func_island_assemble_factor_solve_tiled has cognitive complexity 213 (threshold 15). Drivers by points: if/else 31 (106 pts), loops 32 (105 pts), boolean chains 2 (nesting depth added 148). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"a080bd70ef9b774c5618205365e0f010dcf00072c1be11c480994859098ec06c"}},{"ruleId":"D2","level":"warning","message":{"text":"inverse_kinematics.func_inverse_kinematics (cognitive 212): inverse_kinematics.func_inverse_kinematics has cognitive complexity 212 (threshold 15). Drivers by points: loops 28 (119 pts), if/else 16 (68 pts), ternaries 3 (20 pts), boolean chains 5 (nesting depth added 160). 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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcaaf6edc77e21ab8cc81f5e849d4296d3a059314a37e27fdd65c80475bd17b"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.kernel_sph_boundaries_impulse (cognitive 202): legacy_coupler.kernel_sph_boundaries_impulse has cognitive complexity 202 (threshold 15). Drivers by points: if/else 22 (100 pts), loops 20 (95 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 155). 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd7481b1ba502b95e545846f96a850e04c5f856dfe6e3efc8bcd24e16702089"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._parse_scene (cognitive 201): KinematicEntityDescription._parse_scene has cognitive complexity 201 (threshold 15). Drivers by points: if/else 46 (109 pts), loops 25 (60 pts), boolean chains 23, ternaries 3 (7 pts), error handling 1 (2 pts) (nesting depth added 103). 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1b6a5e52435b04736a08189f94f1d75390a6bee691c072340f79c452f17f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_geometry.parse_prim_geoms (cognitive 200): usd_geometry.parse_prim_geoms has cognitive complexity 200 (threshold 15). Drivers by points: if/else 48 (139 pts), loops 11 (38 pts), boolean chains 19, ternaries 1 (4 pts) (nesting depth added 121). 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":"genesis/utils/usd/usd_geometry.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f0db8863860815f112d2396fd09fb75cae7f4b89b5b2113de3147150ddff8e"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_clamp_prune_contacts (cognitive 197): contact.func_clamp_prune_contacts has cognitive complexity 197 (threshold 15). Drivers by points: if/else 19 (115 pts), loops 15 (80 pts), boolean chains 2 (nesting depth added 161). 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dbd6077304e06c7ba72f6110e10dc7750c80196ba4f129ba5725ec469daf2b"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree_shared (cognitive 193): forward_dynamics.func_factor_mass_tree_shared has cognitive complexity 193 (threshold 15). Drivers by points: if/else 25 (117 pts), loops 14 (68 pts), ternaries 1 (7 pts), boolean chains 1 (nesting depth added 152). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ab6a9192e5398a0555e3a463bb817244b8b4ca2fe09c63055dd83183c87e9"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_contact_mpr_terrain (cognitive 186): narrowphase.func_contact_mpr_terrain has cognitive complexity 186 (threshold 15). Drivers by points: if/else 26 (137 pts), loops 9 (35 pts), ternaries 2 (9 pts), boolean chains 5 (nesting depth added 144). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30dba9e37389a242bf0ba05722a29f077fc4d1650dc6dd7b48549032f9f53fb"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_recompute_perturbed_contact (cognitive 185): narrowphase.func_recompute_perturbed_contact has cognitive complexity 185 (threshold 15). Drivers by points: if/else 39 (126 pts), ternaries 6 (32 pts), loops 5 (14 pts), boolean chains 13 (nesting depth added 122). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a75302112195ad2edc4d9459bede3a85c79001e26c6cd44a121f4a1d0ec0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._add_collision_constraints_per_contact (cognitive 176): solver._add_collision_constraints_per_contact has cognitive complexity 176 (threshold 15). Drivers by points: if/else 23 (113 pts), loops 10 (37 pts), ternaries 6 (22 pts), boolean chains 4 (nesting depth added 133). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"66defc7e9e8df6198ac8c7f9eb59e51ee917b1099ae195c05d453a063bd2502a"}},{"ruleId":"D2","level":"warning","message":{"text":"Data.__init__ (cognitive 175): Data.__init__ has cognitive complexity 175 (threshold 15). Drivers by points: if/else 35 (92 pts), loops 21 (40 pts), ternaries 11 (32 pts), boolean chains 11 (nesting depth added 97). 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":"genesis/utils/data.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c464b1570eb1b3ed9df5ead90648967761be95598ce1d2b0c6b1be4c81b2c01e"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_rigid_entity._parse_link (cognitive 167): usd_rigid_entity._parse_link has cognitive complexity 167 (threshold 15). Drivers by points: if/else 40 (108 pts), ternaries 8 (38 pts), loops 5 (14 pts), boolean chains 7 (nesting depth added 107). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"43712d3b45ab7646b5b6eee4f4f86125939f5a9868de285a68c4be6e616059be"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_contact.func_multi_contact (cognitive 166): multi_contact.func_multi_contact has cognitive complexity 166 (threshold 15). Drivers by points: ternaries 28 (88 pts), if/else 29 (63 pts), loops 5 (10 pts), boolean chains 5 (nesting depth added 99). 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8598ee9e9ce78e12a934bd51352edac2185a0336b718835885d50db6b60e52ed"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_island_hessian_assemble_block (cognitive 160): solver.func_island_hessian_assemble_block has cognitive complexity 160 (threshold 15). Drivers by points: if/else 27 (111 pts), loops 12 (49 pts) (nesting depth added 121). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c77d140bdcba956dbd99f587e512d861101203fc191192ee0a1984fff2916ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Collider.get_contacts (cognitive 151): Collider.get_contacts has cognitive complexity 151 (threshold 15). Drivers by points: if/else 43 (91 pts), ternaries 11 (45 pts), boolean chains 13, loops 1 (2 pts) (nesting depth added 83). 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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4921ab46df6e8125bb273ab046e271813fe2dd0e45cccd23be101e1f799514f"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_hessian_direct_batch (cognitive 145): solver.func_hessian_direct_batch has cognitive complexity 145 (threshold 15). Drivers by points: if/else 24 (82 pts), loops 19 (59 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 99). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c339ccb97644fa7ed015e409b802ee3df5f0e1e33fb8d075bdf717bd2058612"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_update_envs_active (cognitive 143): sap_coupler.func_update_envs_active has cognitive complexity 143 (threshold 15). Drivers by points: if/else 20 (93 pts), loops 9 (47 pts), boolean chains 2, ternaries 1 (nesting depth added 111). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf420eaa63cec57dc77ff4576091d32cea3ddc37a27d9c7465d0aa4008e8c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.kernel_place_sph_boundary_segments (cognitive 138): legacy_coupler.kernel_place_sph_boundary_segments has cognitive complexity 138 (threshold 15). Drivers by points: if/else 20 (80 pts), loops 14 (55 pts), boolean chains 2, ternaries 1 (nesting depth added 101). 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e5f5cd421ed9c8c585a4e8336ad0df0e20a073ba4661e337af5070f5b201a7"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.assign_indexed_tensor (cognitive 137): misc.assign_indexed_tensor has cognitive complexity 137 (threshold 15). Drivers by points: if/else 34 (79 pts), loops 11 (28 pts), ternaries 5 (15 pts), boolean chains 14, error handling 1 (nesting depth added 72). 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":"genesis/utils/misc.py"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c9a1a5520fb89f83ce30b9bb5b3adfcf064346c847b728d1a52dfdfcc8d066"}},{"ruleId":"D2","level":"warning","message":{"text":"island.func_build_islands_coop (cognitive 136): island.func_build_islands_coop has cognitive complexity 136 (threshold 15). Drivers by points: if/else 36 (98 pts), loops 17 (33 pts), boolean chains 5 (nesting depth added 78). 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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab024d7cec10048c15fe6ad97f989f570d812f87247ae204dfb97ce801749d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_entity_browser (cognitive 136): ImGuiOverlayPlugin._render_entity_browser has cognitive complexity 136 (threshold 15). Drivers by points: if/else 29 (97 pts), loops 7 (24 pts), ternaries 3 (9 pts), boolean chains 6 (nesting depth added 91). 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"7096b45394b8b11997b6bed1eb19432523bd8d3cc4c745c9cff01d09818b37e8"}},{"ruleId":"D2","level":"warning","message":{"text":"mesh._postprocess_collision_geoms_impl (cognitive 135): mesh._postprocess_collision_geoms_impl has cognitive complexity 135 (threshold 15). Drivers by points: if/else 36 (88 pts), loops 10 (22 pts), boolean chains 20, ternaries 1 (5 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/mesh.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e8b69871bc4f46886e62dc3b29a7684001cc0b42066bf36ea3c3690d87aa64"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.kernel_order_constraints (cognitive 131): sap_coupler.kernel_order_constraints has cognitive complexity 131 (threshold 15). Drivers by points: if/else 19 (76 pts), loops 20 (51 pts), boolean chains 3, ternaries 1 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd3be057b940699b65dc117c93fdaaece2c527f3829c6149935bc9a0967a4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Collider._compute_collision_pair_idx (cognitive 130): Collider._compute_collision_pair_idx has cognitive complexity 130 (threshold 15). Drivers by points: if/else 31 (72 pts), loops 15 (41 pts), ternaries 3 (12 pts), boolean chains 5 (nesting depth added 76). 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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"704601205c938f9b465508437170316d6f178ac7ea266cf55c785153552d0035"}},{"ruleId":"D2","level":"warning","message":{"text":"urdf.parse_urdf (cognitive 130): urdf.parse_urdf has cognitive complexity 130 (threshold 15). Drivers by points: if/else 34 (83 pts), ternaries 7 (24 pts), loops 9 (16 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 74). 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":"genesis/utils/urdf.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"934496d1033c71ce344d52a02f87ff63b298a2e9a54f345d663fa9e86d61a3ff"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase._func_multicontact_detect (cognitive 126): narrowphase._func_multicontact_detect has cognitive complexity 126 (threshold 15). Drivers by points: if/else 30 (93 pts), loops 5 (20 pts), boolean chains 10, ternaries 1 (3 pts) (nesting depth added 80). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef632d38bb0b102f011722e884eddf7479265d37e7106b782c56f5f92094564f"}},{"ruleId":"D2","level":"warning","message":{"text":"bvh.func_build_bvh (cognitive 118): bvh.func_build_bvh has cognitive complexity 118 (threshold 15). Drivers by points: loops 27 (62 pts), if/else 18 (47 pts), ternaries 4 (9 pts) (nesting depth added 69). 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":"genesis/engine/bvh.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3f21c495cdc4385bb23e6f0f679a84466d47ebd80e8bf9c1f3d73cd53d48d4"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.indices_to_mask (cognitive 115): misc.indices_to_mask has cognitive complexity 115 (threshold 15). Drivers by points: if/else 24 (72 pts), ternaries 6 (25 pts), boolean chains 10, error handling 1 (4 pts), loops 3 (4 pts) (nesting depth added 71). 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":"genesis/utils/misc.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6cc0105f18be2a2aac7aa7296a0fa36ded8ed0a18594069413799b44066a66"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree_tiled (cognitive 112): forward_dynamics.func_factor_mass_tree_tiled has cognitive complexity 112 (threshold 15). Drivers by points: loops 11 (53 pts), if/else 12 (51 pts), ternaries 1 (7 pts), boolean chains 1 (nesting depth added 87). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bbeb85755840f02cc069f92c1a769f3f0296039fa335e53f245b80292ddb70"}},{"ruleId":"D2","level":"warning","message":{"text":"mpr.func_mpr_contact_from_centers (cognitive 109): mpr.func_mpr_contact_from_centers has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (93 pts), ternaries 2 (10 pts), boolean chains 5, loops 1 (nesting depth added 64). 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":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"388331f4c0e808f5e1d09c1a262375e254d0c20b449f03914156c2aa8b798816"}},{"ruleId":"D2","level":"warning","message":{"text":"IPCCoupler._add_rigid_geoms_to_ipc (cognitive 105): IPCCoupler._add_rigid_geoms_to_ipc has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (73 pts), loops 5 (11 pts), ternaries 2 (8 pts), boolean chains 7, error handling 1 (6 pts) (nesting depth added 69). 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2ebf9d198ec428961efed0efbe108fac4a730e09199cc458789f60fa5b635e"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_narrowphase_contact0 (cognitive 105): narrowphase.func_narrowphase_contact0 has cognitive complexity 105 (threshold 15). Drivers by points: if/else 20 (88 pts), loops 4 (10 pts), boolean chains 7 (nesting depth added 74). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2689522d8d8f6d7850a241cb9f211ce3bf16a5ed6a01e61a87d9a0b9ddb1e626"}},{"ruleId":"D2","level":"warning","message":{"text":"gltf.parse_mesh_glb (cognitive 105): gltf.parse_mesh_glb has cognitive complexity 105 (threshold 15). Drivers by points: if/else 20 (59 pts), loops 9 (22 pts), ternaries 6 (21 pts), boolean chains 3 (nesting depth added 67). 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":"genesis/utils/gltf.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57ab54e76018840ed9713426a61e05108cb9a505e7e832abb9dceeb36536fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"SAPCoupler.build (cognitive 104): SAPCoupler.build has cognitive complexity 104 (threshold 15). Drivers by points: if/else 38 (57 pts), loops 10 (21 pts), boolean chains 16, ternaries 10 (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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6c2b2012ff298c1fa74fcd4fdb10bfa5975ff3b458a7cb3c139660a845b159"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_build_coarse (cognitive 103): fem_solver.func_build_coarse has cognitive complexity 103 (threshold 15). Drivers by points: if/else 14 (59 pts), loops 11 (40 pts), ternaries 3 (4 pts) (nesting depth added 75). 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a18b95456fabd06f52bb151192aa255db7224eae3ee86943e8f61f84b39014"}},{"ruleId":"D2","level":"warning","message":{"text":"mpm_solver.kernel_transfer_particles_to_grid (cognitive 103): mpm_solver.kernel_transfer_particles_to_grid has cognitive complexity 103 (threshold 15). Drivers by points: if/else 16 (72 pts), loops 6 (24 pts), boolean chains 7 (nesting depth added 74). 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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8866761e2006e6583e343fb8dd5588b20b7028bada36d2645aa640bfcc36d53"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.func_project_on_bounds (cognitive 102): legacy_coupler.func_project_on_bounds has cognitive complexity 102 (threshold 15). Drivers by points: if/else 12 (54 pts), loops 11 (40 pts), boolean chains 8 (nesting depth added 71). 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc3075ab4aa8962fbc8f4f4d90666962121448ca99556b816d6d4d138917931"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.kernel_fem_surface_force (cognitive 100): legacy_coupler.kernel_fem_surface_force has cognitive complexity 100 (threshold 15). Drivers by points: if/else 13 (61 pts), loops 9 (37 pts), boolean chains 2 (nesting depth added 76). 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e246b9f5148301a95bdb478679d22f60a9bf0a3f378cc3aa1116bcde5cdae3"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree_global (cognitive 99): forward_dynamics.func_factor_mass_tree_global has cognitive complexity 99 (threshold 15). Drivers by points: if/else 13 (58 pts), loops 7 (33 pts), ternaries 1 (7 pts), boolean chains 1 (nesting depth added 77). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1318f7e6f9499394159187d45e72a42d2cdbd4143398562276ffdefc43ac1a"}},{"ruleId":"D2","level":"warning","message":{"text":"mjcf.build_model (cognitive 98): mjcf.build_model has cognitive complexity 98 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 11 (33 pts), ternaries 5 (16 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 60). 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":"genesis/utils/mjcf.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c29a7b06115b5f8f8ebd5bedf3e8271f3651e0830225206ce46e95566cb48e"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._load_heterogeneous_morphs (cognitive 97): KinematicEntityDescription._load_heterogeneous_morphs has cognitive complexity 97 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 8 (24 pts), ternaries 7 (21 pts), boolean chains 1 (nesting depth added 64). 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7388ff9891289d4e74e0905e66b0b4094887d5b195c64eaaaf106b0a718081b4"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver._build_config (cognitive 96): RigidSolver._build_config has cognitive complexity 96 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 26, ternaries 6 (15 pts), loops 6 (12 pts) (nesting depth added 37). 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"138997c50218f2c091de887d144f6dc7cc4c3a7d93a292ab0a96621523c43cab"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_accumulate_vertex (cognitive 94): fem_solver.func_accumulate_vertex has cognitive complexity 94 (threshold 15). Drivers by points: if/else 26 (71 pts), loops 6 (18 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 58). 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4451c7c00c814cb2b82cef4cc2316faa139618c146a0d5ab31522c06081e468f"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_contact_support_hull (cognitive 94): contact.func_contact_support_hull has cognitive complexity 94 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 14 (36 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef796296f4214d3fc9287677c71177e98535cb60102215528e0dcceec94be7b5"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_torque_and_passive_force (cognitive 91): forward_dynamics.func_torque_and_passive_force has cognitive complexity 91 (threshold 15). Drivers by points: if/else 13 (40 pts), ternaries 8 (30 pts), loops 6 (15 pts), boolean chains 6 (nesting depth added 58). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7f23502f9d4cc0c4f57648c56f4c55b578c2d08d5385cf290f9f6c8a11e48e"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver._jacobi_mass_spread_bound (cognitive 91): RigidSolver._jacobi_mass_spread_bound has cognitive complexity 91 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 10 (30 pts), boolean chains 7, ternaries 1 (6 pts) (nesting depth added 58). 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"beed1be616ac699e1113999279be92fefc3ed1044a65c1a4aab3d3a42510a2a0"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_collision.apply_collision_filtering (cognitive 91): usd_collision.apply_collision_filtering has cognitive complexity 91 (threshold 15). Drivers by points: if/else 21 (50 pts), loops 17 (34 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 47). 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":"genesis/utils/usd/usd_collision.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2640925461ffbeb0b27c1d437481c331133789726073e25292eef59d940f1218"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_narrow_phase_nonconvex_vs_nonterrain (cognitive 90): narrowphase.func_narrow_phase_nonconvex_vs_nonterrain has cognitive complexity 90 (threshold 15). Drivers by points: if/else 10 (51 pts), loops 5 (21 pts), ternaries 4 (12 pts), boolean chains 6 (nesting depth added 65). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4926}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cfa750b02e2d64f7dafe027080fe2c20e0f35f5b64f89d579691ffb81b6796"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_integrate (cognitive 89): forward_dynamics.func_integrate has cognitive complexity 89 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 7 (29 pts), ternaries 3 (12 pts), boolean chains 1 (nesting depth added 63). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8012aed961a0383d72589d86810b1a18773568414f6a002f30eb52cc10ab44"}},{"ruleId":"D2","level":"warning","message":{"text":"mjcf.parse_link (cognitive 89): mjcf.parse_link has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (62 pts), ternaries 8 (17 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 44). 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":"genesis/utils/mjcf.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"67265bf0ddaeb51bf367208eb3eae568ba09f4076b6093a883116fd662ebbac2"}},{"ruleId":"D2","level":"warning","message":{"text":"mpm_solver.func_gather_particles (cognitive 84): mpm_solver.func_gather_particles has cognitive complexity 84 (threshold 15). Drivers by points: if/else 14 (67 pts), loops 4 (16 pts), boolean chains 1 (nesting depth added 65). 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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61d6543a7feef9fa9d7196a832c3fa1fa6df47e0c4391d973603cc9a14455ce"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._align_free_roots (cognitive 83): KinematicEntityDescription._align_free_roots has cognitive complexity 83 (threshold 15). Drivers by points: if/else 17 (52 pts), loops 9 (26 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 54). 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3428e6287e1466f9f106a0517337bea13e54aed347750e65452ffd26d072ff55"}},{"ruleId":"D2","level":"warning","message":{"text":"diff_gjk.func_gjk_contact (cognitive 83): diff_gjk.func_gjk_contact has cognitive complexity 83 (threshold 15). Drivers by points: if/else 26 (73 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 51). 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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"179017aadc9f20175547851b9f5ce80016e710547a769d3d8098a72e709c7ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_contact.func_clip_polygon (cognitive 83): multi_contact.func_clip_polygon has cognitive complexity 83 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 9 (30 pts), ternaries 4 (6 pts), boolean chains 5 (nesting depth added 51). 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"a119dc061c191861e1816a305324aed4cbe185174aceb9620898ba08baff63bb"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_solve_init (cognitive 82): solver.func_solve_init has cognitive complexity 82 (threshold 15). Drivers by points: if/else 27 (55 pts), loops 9 (19 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab14175cb869838a9f2d7d74a02357e995b35a4f2f7a49c63149bcf70e5367e4"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointMixin.save_checkpoint (cognitive 81): CheckpointMixin.save_checkpoint has cognitive complexity 81 (threshold 15). Drivers by points: if/else 20 (58 pts), error handling 2 (12 pts), boolean chains 7, loops 1 (3 pts), ternaries 1 (nesting depth added 50). 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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30bc07b7314441a5329b845ca47585a776104df9d3cfc1ee84a6570e9027225"}},{"ruleId":"D2","level":"warning","message":{"text":"epa.func_safe_epa (cognitive 81): epa.func_safe_epa has cognitive complexity 81 (threshold 15). Drivers by points: if/else 26 (62 pts), loops 5 (9 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 42). 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6bfc4b1346317c9a15595012090be720aea104d12aab1dc475590bdd22e7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_compute_vertices_dofs (cognitive 80): sap_coupler.func_compute_vertices_dofs has cognitive complexity 80 (threshold 15). Drivers by points: if/else 20 (68 pts), loops 4 (9 pts), boolean chains 2, ternaries 1 (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3831}}}],"partialFingerprints":{"codehealthFindingId/v1":"53233b7797529df09aa8c62448cb91c382c1ee59b63f68d839fbfecac671d8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntity.attach (cognitive 80): KinematicEntity.attach has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (52 pts), loops 6 (10 pts), ternaries 3 (10 pts), boolean chains 8 (nesting depth added 37). 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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc906769e124c90190c8ec82c38a17f0fd2b2f820eee55e546de952fd4a81fe"}},{"ruleId":"D2","level":"warning","message":{"text":"kernel_writes.get_written_paths (cognitive 80): kernel_writes.get_written_paths has cognitive complexity 80 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 10 (26 pts), boolean chains 6, ternaries 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":"genesis/grad/kernel_writes.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2961b572e9b331934b482fc50bea952f8a650f70ab505976834738801e5f12f5"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.kernel_init_sap_solve (cognitive 79): sap_coupler.kernel_init_sap_solve has cognitive complexity 79 (threshold 15). Drivers by points: if/else 16 (53 pts), loops 9 (25 pts), ternaries 1 (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe19b9ee11fecfadacfa6bb70e66c7d549e9eca6c7de9f6711795eb8c1c4562"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_gjk_contact (cognitive 79): gjk.func_gjk_contact has cognitive complexity 79 (threshold 15). Drivers by points: if/else 19 (65 pts), boolean chains 5, ternaries 4 (5 pts), loops 2 (4 pts) (nesting depth added 49). 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c2841ed802be05a210daa37ee3400a0359398b8bc18976cc17b0a552df8944"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_cone_rank_update_whole_env (cognitive 78): solver.func_cone_rank_update_whole_env has cognitive complexity 78 (threshold 15). Drivers by points: loops 9 (48 pts), if/else 6 (29 pts), boolean chains 1 (nesting depth added 62). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f3a2e5c1575caae2419a28fa49ae3ccb85aed3fb9114643200cb830388f879"}},{"ruleId":"D2","level":"warning","message":{"text":"island.func_reorder_island_dofs (cognitive 77): island.func_reorder_island_dofs has cognitive complexity 77 (threshold 15). Drivers by points: loops 16 (39 pts), if/else 9 (30 pts), boolean chains 8 (nesting depth added 44). 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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3e7b6750b06531498b241561fa625f5ccbd906a28882d575f58b46f497cb32"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_link_point_delassus (cognitive 74): sap_coupler.func_link_point_delassus has cognitive complexity 74 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 10 (32 pts), ternaries 2 (4 pts) (nesting depth added 49). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4ead36fe48f94cb9afcf193d9fd2e28412767812fb1b33ea7565d0627306ac"}},{"ruleId":"D2","level":"warning","message":{"text":"island.func_build_islands (cognitive 74): island.func_build_islands has cognitive complexity 74 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 14 (23 pts), boolean chains 4 (nesting depth added 37). 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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"640cc7c589ada09db1bf960fad202f5faf340bc80c01dae0b571274bdc87d93a"}},{"ruleId":"D2","level":"warning","message":{"text":"Raytracer.build (cognitive 74): Raytracer.build has cognitive complexity 74 (threshold 15). Drivers by points: loops 14 (34 pts), if/else 18 (32 pts), ternaries 2 (8 pts) (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":"genesis/vis/raytracer.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9ecd196d41d5b63297146fd997d5f50799b900a72ac35d9aed12fca64af18d"}},{"ruleId":"D2","level":"warning","message":{"text":"genesis.init (cognitive 72): genesis.init has cognitive complexity 72 (threshold 15). Drivers by points: if/else 32 (41 pts), boolean chains 19, loops 5, ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 12). 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":"genesis/__init__.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a2314c5ff98e8d44bbdc049b61e967ce383a589675d9f838eac57f4c513aa"}},{"ruleId":"D2","level":"warning","message":{"text":"backward.kernel_manual_add_collision_constraints_bw (cognitive 72): backward.kernel_manual_add_collision_constraints_bw has cognitive complexity 72 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 7 (26 pts), ternaries 5 (20 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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"588ef9814218620153550b85ca43ae8c3667d4f2611e6a9c17f343a2a6179f27"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._add_friction_constraint (cognitive 72): solver._add_friction_constraint has cognitive complexity 72 (threshold 15). Drivers by points: if/else 24 (54 pts), ternaries 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 37). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"8902c4502b4294becd59078f3ea5a58fe01295998ab891c0c0c77b75368e2221"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_one_exact_linesearch_iter (cognitive 71): sap_coupler.func_one_exact_linesearch_iter has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (53 pts), loops 4 (15 pts), boolean chains 3 (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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4944}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd79b622faa9d1ba0cd0525ce68cbaacabf153694b15bbf13dd89df3199210b"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_precondition_env (cognitive 70): fem_solver.func_precondition_env has cognitive complexity 70 (threshold 15). Drivers by points: loops 10 (36 pts), if/else 13 (30 pts), boolean chains 3, ternaries 1 (nesting depth added 43). 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a896db9dd63c20da70eda7f2e3b2df5c6e8be62ab0229c3c25054c68e287af22"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_safe_gjk (cognitive 70): gjk.func_safe_gjk has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (54 pts), loops 3 (7 pts), ternaries 2 (7 pts), boolean chains 2 (nesting depth added 43). 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6436226720759ca76609271786ddf6e02556dfcf47217ddf0a911afc105559e"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.update_rigid (cognitive 70): RasterizerContext.update_rigid has cognitive complexity 70 (threshold 15). Drivers by points: if/else 10 (41 pts), loops 9 (28 pts), boolean chains 1 (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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d441fce95c87d898307f590c51e8f1957d23b2cf929fd22d87eac97ce1773b75"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_add_cone_hessian_block_island (cognitive 69): solver.func_add_cone_hessian_block_island has cognitive complexity 69 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 7 (32 pts), boolean chains 1 (nesting depth added 53). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"2807f759cba3be28b10ae77bba188cb4b813bfa394106dabc22ff7671fafae72"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh.from_trimesh (cognitive 68): Mesh.from_trimesh has cognitive complexity 68 (threshold 15). Drivers by points: if/else 24 (54 pts), boolean chains 6, ternaries 2 (5 pts), loops 1 (3 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":"genesis/engine/mesh.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ef13ae14e372fceac88330f4e5e689901356a4fc490b53021e08137e852110"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_midpoint_free_body (cognitive 67): forward_dynamics.func_midpoint_free_body has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 8 (13 pts), ternaries 5 (8 pts), boolean chains 3 (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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac19c5d3a4ce2351e98e064cc9d1130ca0f0b899e312942f506cf19a61f72ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_sweep_links_by_level (cognitive 67): forward_kinematics.func_sweep_links_by_level has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (53 pts), loops 4 (14 pts) (nesting depth added 45). 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb54f28d43310ac88abf41c8070d7b3c3d96c13e01d9c8a2dbb226f9619ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"Camera.set_pose (cognitive 67): Camera.set_pose has cognitive complexity 67 (threshold 15). Drivers by points: if/else 30 (46 pts), boolean chains 10, ternaries 4 (9 pts), loops 1 (2 pts) (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":"genesis/vis/camera.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"920efb2b46ad3b53bb6f799d5825c337119c61fac2f0931b1a8e516c54d9d122"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_invert_rigid_hessian (cognitive 66): sap_coupler.func_invert_rigid_hessian has cognitive complexity 66 (threshold 15). Drivers by points: loops 14 (45 pts), if/else 6 (19 pts), boolean chains 1, ternaries 1 (nesting depth added 44). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb75436586712ae138d4606eefaf0ecf029d15689a47a32ee053b969b8458c"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_search_single_island (cognitive 66): linesearch.func_search_single_island has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 7 (22 pts) (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c281ca0ce6ed4862730faa3ddd744985b4f9b3ed8070e601edc7ed9934d60bb"}},{"ruleId":"D2","level":"warning","message":{"text":"gltf.parse_glb_material (cognitive 66): gltf.parse_glb_material has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (63 pts), boolean chains 2, loops 1 (nesting depth added 32). 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":"genesis/utils/gltf.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd668ed613bbac7d235b76669fdb9d0606c336073ad2f1485d1aa9dd5477004b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_scene_editor (cognitive 65): ImGuiOverlayPlugin._render_scene_editor has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (46 pts), boolean chains 10, ternaries 2 (5 pts), loops 2 (4 pts) (nesting depth added 31). 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36fd06bdb4c56a64012a88a0a903c11b5722101d310764a4a36f6596b4f814f"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_cone_rank_update_island (cognitive 64): solver.func_cone_rank_update_island has cognitive complexity 64 (threshold 15). Drivers by points: loops 8 (34 pts), if/else 7 (28 pts), boolean chains 2 (nesting depth added 47). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5d7af16a5f120fa2f5a820b9269edb07e581500d614cd5549d76f617afdfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver.build (cognitive 63): RigidSolver.build has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (47 pts), ternaries 3 (7 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 29). 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd1ea9cccbe8dd1035a27159c17b861b70bf2b24ce2c0269432eb03e67bba29"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer.start (cognitive 62): Viewer.start has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (34 pts), error handling 9 (21 pts), boolean chains 4, loops 2 (3 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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6264480cc5771fbc75d9f3739ba63da1e5c81a61569286eb357e4d4721f7d94"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase._func_multicontact_run_detection (cognitive 61): narrowphase._func_multicontact_run_detection has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (54 pts), loops 1 (5 pts), boolean chains 2 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"17194901c8583091493eb96e0fb2319018cc792504f57e95fbd16933a92adb15"}},{"ruleId":"D2","level":"warning","message":{"text":"_trimesh_patch.load_obj (cognitive 61): _trimesh_patch.load_obj has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (42 pts), error handling 5 (13 pts), boolean chains 5, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cddb2e13b777bca4f66590b084fcf734e0edd4ca7b4fd35476b3b9890b0379"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization._load_value (cognitive 61): serialization._load_value has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 11, ternaries 4 (8 pts), error handling 1 (4 pts), loops 1 (3 pts) (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":"genesis/utils/serialization.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c77a051082277ab10145fc5e4bada88f2181338dfc6014efa31285ac7f634c"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.kernel_sum_contact_patches (cognitive 60): sap_coupler.kernel_sum_contact_patches has cognitive complexity 60 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 7 (18 pts), boolean chains 4 (nesting depth added 39). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"111dbb61755415df3fc16f772a3522e43ea37f135c0cb4379a71bee06e00ada0"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_init_dofs_invweight (cognitive 60): forward_dynamics.func_init_dofs_invweight has cognitive complexity 60 (threshold 15). Drivers by points: loops 6 (24 pts), if/else 5 (20 pts), ternaries 4 (14 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"428ed12ea3ed4512f89d463114fe91c87f7d87769d8ea409903b0981726430b7"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_contact.func_potential_box_normals (cognitive 60): multi_contact.func_potential_box_normals has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (32 pts), ternaries 4 (14 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 37). 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fa1b04731caabe2af89351cca808797640d40d1556c45f10d5df5ff74f7a26"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._sort_contacts_and_build_islands (cognitive 60): solver._sort_contacts_and_build_islands has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (14 pts), boolean chains 4 (nesting depth added 35). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bc3ecee05696312a596729f140f6dc18d0812a77cb486a65aa5d512f9f4c12"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._quadric_decimate_loop (cognitive 60): watertighten._quadric_decimate_loop has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (50 pts), boolean chains 5, loops 3 (5 pts) (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":"genesis/utils/watertighten.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"811906983c43554385473615f98bc6dd8e41fd8833c5cae4a49a9bf1786e22cc"}},{"ruleId":"D2","level":"warning","message":{"text":"RRTConnect._kernel_rrt_connect_step1 (cognitive 59): RRTConnect._kernel_rrt_connect_step1 has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 5 (15 pts), ternaries 2 (9 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/path_planning.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"76852449e1eed5f2229ab733a968754810607e292b7e8c62bc3e1ff9b9f05484"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_gather_fem_vertex (cognitive 58): sap_coupler.func_gather_fem_vertex has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 4 (12 pts), boolean chains 3, ternaries 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"446fae2415457c7a73e8bacdefdc3453a30b25e59565356fcb8ee99fb4338973"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_add_dynamic_constraint_rows_batch (cognitive 57): solver.func_add_dynamic_constraint_rows_batch has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (35 pts), ternaries 4 (12 pts), boolean chains 5, loops 3 (5 pts) (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4743d76cd7d4b5dbe3169cba45aac7964d0bfc898a381d06ee5bf98818ee7e45"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_exit_islands_coop (cognitive 56): linesearch.func_exit_islands_coop has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 6 (15 pts) (nesting depth added 37). 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e432001856a3822d8387becd7d07efbc41ccd0bc4887996faf2d9d47294d3f99"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_row_alpha_terms (cognitive 55): linesearch.func_row_alpha_terms has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 4 (12 pts), boolean chains 5 (nesting depth added 31). 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f06c42d7ff053265bf2e20acfe7600c6c335a97857d195eb1d6ce52f02f3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Raytracer.update_scene (cognitive 55): Raytracer.update_scene has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 4 (16 pts), loops 7 (14 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/raytracer.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"df169f5b6a28fbb0bba0242bac64a9d92be12650c75b4a944240caf2980c97db"}},{"ruleId":"D2","level":"warning","message":{"text":"diff_gjk.func_extended_epa (cognitive 53): diff_gjk.func_extended_epa has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 4 (8 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 26). 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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa234ec88540b0531bbebe76d48192c0ead48bcafce19ddd30d59ac833dd07c"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_ls_state_advance (cognitive 53): linesearch.func_ls_state_advance has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 6, loops 2 (3 pts) (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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df21eb242bb753f331e3ff5d322e3193fc445b849942790ed1a357ec1dee9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"noslip.func_noslip_update_row (cognitive 53): noslip.func_noslip_update_row has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 5 (18 pts), boolean chains 4 (nesting depth added 32). 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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"728f88acae95b8188bd5d2057b26d0b5036f89470317caeae8a4087a6843f24e"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._func_contact_row_direction (cognitive 53): solver._func_contact_row_direction has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (40 pts), ternaries 3 (12 pts), boolean chains 1 (nesting depth added 34). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"911118f51248ae768673e5a2514871bea76cc1df9a17b520db89dc2e4c3e63f1"}},{"ruleId":"D2","level":"warning","message":{"text":"_trimesh_patch.export_obj (cognitive 53): _trimesh_patch.export_obj has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (38 pts), error handling 2 (6 pts), loops 3 (6 pts), boolean chains 3 (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":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a79d216672fb540a127fd0104af2e8c83dba3c953fd9038fc898cc1f6fd4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer.render (cognitive 53): Renderer.render has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 8, loops 3 (8 pts), ternaries 1 (2 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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7804ac533bb4f6cab18991e7435e2be70b63e611c093ab2e5c5fdbfff9aa7c01"}},{"ruleId":"D2","level":"warning","message":{"text":"RRTConnect._kernel_rrt_connect_step2 (cognitive 53): RRTConnect._kernel_rrt_connect_step2 has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (43 pts), loops 3 (10 pts) (nesting depth added 38). 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":"genesis/utils/path_planning.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"93698fd0cec1bce0f67ea2a06c27c824dc0df09808b51bc791a226f3fb15133e"}},{"ruleId":"D2","level":"warning","message":{"text":"Entity._get_global_idx (cognitive 52): Entity._get_global_idx has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 6, ternaries 2 (5 pts), error handling 1 (2 pts) (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":"genesis/engine/entities/base_entity.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cfc249d72de7013fcaf25dd1e5c0e9e77436a2625a6ae2730c6e5bc9df7a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"epa.func_epa (cognitive 52): epa.func_epa has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 4 (8 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 26). 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0329d6136aad8a6af5064b08918cdb67dd2b2f13d207ddda4b8511bcf9f13685"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_apply_staged_rank_updates_island (cognitive 52): solver.func_apply_staged_rank_updates_island has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 5 (13 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a682afc92a9eed8718a1534976b3968a071c715878129402787e9c94033467e"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver._set_links_info (cognitive 52): RigidSolver._set_links_info has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 7, loops 3 (7 pts), ternaries 3 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"893b57bd38f29ee3a768dc75bb07a73156146ef1c1b964f0059cb0aba5ed5c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver.set_base_links_quat (cognitive 51): RigidSolver.set_base_links_quat has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 12, ternaries 2 (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a37bdbf5f15e2d10dd963dea4f3868d74c5a5d6973c11b55a2beaa6bbd9a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"broadphase.func_broad_phase_geoms (cognitive 50): broadphase.func_broad_phase_geoms has cognitive complexity 50 (threshold 15). Drivers by points: if/else 7 (36 pts), loops 3 (8 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 38). 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":"genesis/engine/solvers/rigid/collider/broadphase.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"937c36c0883162d5f045cf4ac5f9e9bbfdafee009bbcbe437600cb35d3e0e2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"IPCCoupler._add_fem_entities_to_ipc (cognitive 49): IPCCoupler._add_fem_entities_to_ipc has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 3 (4 pts), ternaries 1 (3 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9a1ac4c3e5e3f88ef0bb27bcfcfbda8e365fc07ce2d7b58972238cf8968b38"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_linesearch_islands_serial (cognitive 49): linesearch.func_linesearch_islands_serial has cognitive complexity 49 (threshold 15). Drivers by points: loops 7 (29 pts), if/else 9 (20 pts) (nesting depth added 33). 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31f2378766d8566bf68c0feb3105e3300b098a6e4d1df065fdf4034dd3cb227"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_island_hessian_patch_block (cognitive 49): solver.func_island_hessian_patch_block has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 6 (16 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"337b4619831e4c93b96fc9edbbe4591bb9ab9212cf28ecda8d65bc6100760322"}},{"ruleId":"D2","level":"warning","message":{"text":"bvh.func_bvh_traverse (cognitive 48): bvh.func_bvh_traverse has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (45 pts), ternaries 2, loops 1 (nesting depth added 29). 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":"genesis/engine/bvh.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"3befd9505d6fc9b099582fa3ef41067bd883baa0ac7659738587e938b50279d0"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidEntityDescription._describe_link (cognitive 48): RigidEntityDescription._describe_link has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 9, ternaries 5 (7 pts), loops 1 (2 pts) (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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47bf980e7a027f225799cd9e25178a6b921f6743ecb15cfd8bd8211db5c43f4"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_mass_mat_assemble_tree_cooperative (cognitive 48): forward_dynamics.func_mass_mat_assemble_tree_cooperative has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 5 (20 pts) (nesting depth added 35). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0987dfea3ac6412930d86d7423d43098b55e6a3a79866ffa299452a12175e0"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_factor_island_incremental_or_direct (cognitive 48): solver.func_factor_island_incremental_or_direct has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 28). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0239a6ede8ff485e50e91cef69f14e46f109cf61c44d058db5e79d1b761a30"}},{"ruleId":"D2","level":"warning","message":{"text":"mjcf.parse_geom (cognitive 48): mjcf.parse_geom has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 6, ternaries 3 (4 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":"genesis/utils/mjcf.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d4879e1d123f11f1e1360c09ab5c8db30be176ce5c79c2e8651acdb3a099df"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.kernel_update_vel (cognitive 47): sap_coupler.kernel_update_vel has cognitive complexity 47 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 8 (19 pts), boolean chains 2 (nesting depth added 27). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b40a1b58d1ab6f45bf816ae70d4aa35810202552e9998dd6c37b820c7cb2843"}},{"ruleId":"D2","level":"warning","message":{"text":"SensorManager._resolve_sensor_cls (cognitive 47): SensorManager._resolve_sensor_cls has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 2 (12 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 28). 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":"genesis/engine/sensors/sensor_manager.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75b772f471eabf3e85750012d54ccfaea36aad383d35b02f9a52bff94dda3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_cholesky_solve_batch (cognitive 47): solver.func_cholesky_solve_batch has cognitive complexity 47 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 10 (21 pts) (nesting depth added 27). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cdd263491bbc66707abee5c76f29b933f971c9721a0dd2fb87078c6ba51fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"JITRenderer.set_primitive (cognitive 47): JITRenderer.set_primitive has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 7, ternaries 2 (4 pts), loops 2 (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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a12e260c156af3d7b980d2d4e09ee18cf3c7d9f947921e99d45a43cb28f4ef"}},{"ruleId":"D2","level":"warning","message":{"text":"point_cloud_tactile._kernel_point_cloud_proximity_taxel_bvh (cognitive 46): point_cloud_tactile._kernel_point_cloud_proximity_taxel_bvh has cognitive complexity 46 (threshold 15). Drivers by points: loops 16 (36 pts), if/else 5 (10 pts) (nesting depth added 25). 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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe901694d80064b92f51bf08f364e8fe33493a1488297d7731b9167678a20de"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_narrow_phase_any_vs_terrain (cognitive 46): narrowphase.func_narrow_phase_any_vs_terrain has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 4 (9 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 30). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4835}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc243768bd328b94f62cca62624eda408b422d52030bd426b7589e2f228304"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_add_cone_hessian_block (cognitive 46): solver.func_add_cone_hessian_block has cognitive complexity 46 (threshold 15). Drivers by points: loops 8 (29 pts), if/else 5 (17 pts) (nesting depth added 33). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10df9d200364f5140890afb896d3095a99881cd62626c2619af175e7b572124"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver.set_base_links_pos (cognitive 46): RigidSolver.set_base_links_pos has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 10, ternaries 2 (3 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a17d5fc5ce9c4af5b914e3823af863ed4d9546954ae68fc88a7cc51d254809"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyCoupler._build_sph_boundaries (cognitive 45): LegacyCoupler._build_sph_boundaries has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 10 (14 pts), boolean chains 4 (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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"05805e6e38baa3b62d1e50bc77d65ba47621fea231b08cb089981c93c55191ba"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidFEMContactHandler.detection (cognitive 45): RigidFEMContactHandler.detection has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 7 (12 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6970}}}],"partialFingerprints":{"codehealthFindingId/v1":"068fb87501e343960e416f1383a86c3d812828bd461a6fca1b20b932bfbdd0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_compute_link_wrench (cognitive 45): sap_coupler.func_compute_link_wrench has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (11 pts), boolean chains 3, ternaries 2 (nesting depth added 26). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1138108e4fb36cd2c3eb5263945687bcf57921b7daa628f5a35238663d0b61"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._resolve_geoms_values (cognitive 45): KinematicEntityDescription._resolve_geoms_values has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 9 (17 pts), ternaries 2 (5 pts), boolean chains 2 (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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ec1b304cd1f93de631138d480580ced7b107a6ab47806ce0d76346dad9a69b"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_refresh_links_invweight_and_meaninertia (cognitive 45): forward_dynamics.func_refresh_links_invweight_and_meaninertia has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (21 pts), ternaries 6 (14 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 26). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e6b1d624639e7b377720450c7c722a039912f0d6c4c9c2e1a26d29fcf3901"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_narrow_phase_diff_convex_vs_convex (cognitive 45): narrowphase.func_narrow_phase_diff_convex_vs_convex has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 30). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4541}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d288e14e2aa563382f8e242b4ac2c9290ed6daf44bc736574f42a8ef4048869"}},{"ruleId":"D2","level":"warning","message":{"text":"surfaces._make_rgba (cognitive 45): surfaces._make_rgba has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 4 (10 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 23). 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":"genesis/options/surfaces.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6532dc65208800301cfe342ae3c0ba127ff3160a97c09dcbd487403143bc9d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.broadcast_tensor (cognitive 45): misc.broadcast_tensor has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 3 (7 pts), boolean chains 5, error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc47bd936a9bb2b62dcffc2ae368537fd4d791d9dd43ee516241810cee284682"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.func_boundary_source_segment (cognitive 44): legacy_coupler.func_boundary_source_segment has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (16 pts), boolean chains 1 (nesting depth added 29). 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f007300ec312ed5c84d351206bc1854da982535827fd1bb6364eefd132a1843"}},{"ruleId":"D2","level":"warning","message":{"text":"FEMSelfContactHandler.detection (cognitive 44): FEMSelfContactHandler.detection has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 8 (14 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6419}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bd68818978b70ba503e4428d1df07d4ef65f235e65c0fce78d0e6a9b769985"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidRigidContactHandler.detection (cognitive 44): RigidRigidContactHandler.detection has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 10 (17 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":7304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113287f26b17baeba0a754895031b92c0944569f1359349c08263173cb01c36"}},{"ruleId":"D2","level":"warning","message":{"text":"broadphase._func_broad_phase_links_sap (cognitive 44): broadphase._func_broad_phase_links_sap has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 8 (21 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/broadphase.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1af4fb822e8599d8624658b852bfb6c55b0426d1166267eb1fecdd8e3a1f27"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.add_limit_constraints (cognitive 44): solver.add_limit_constraints has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 5 (16 pts), ternaries 1 (5 pts), boolean chains 1 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81045d99df58847defd74215616c13a843b7d48de9810f0a97a6fd246c23ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_material.parse_preview_surface (cognitive 44): usd_material.parse_preview_surface has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 7 (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":"genesis/utils/usd/usd_material.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b928b082655d9b9dd0963f0d95115fb619eea78e12ce529263e1ed2e54a509"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._gaussian_axis (cognitive 44): watertighten._gaussian_axis has cognitive complexity 44 (threshold 15). Drivers by points: loops 12 (42 pts), if/else 2 (nesting depth added 30). 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":"genesis/utils/watertighten.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b039b1494b24c6f0c1624db78831174fd554c6a1acadde0b4a7181a4bfbb176e"}},{"ruleId":"D2","level":"warning","message":{"text":"GenesisGeomRetriever.retrieve_rigid_meshes_static (cognitive 44): GenesisGeomRetriever.retrieve_rigid_meshes_static has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 6 (9 pts), ternaries 4 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/batch_renderer.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7013588f6160275ef277e57ef8f79347f5dce803c5e684cd6295a7ecd2e7afe4"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.on_rigid (cognitive 44): RasterizerContext.on_rigid has cognitive complexity 44 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 6 (16 pts), ternaries 2 (7 pts), boolean chains 2 (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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa9720b8aaa43ba1b6eb7732d297aed003e0c23618571002bafcfd398eb3e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_init_link_invweight (cognitive 43): forward_dynamics.func_init_link_invweight has cognitive complexity 43 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 5 (12 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 27). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d747677152cc1847639509736c68979638bfb6220cd854c74d8113388019e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_file_browser (cognitive 43): ImGuiOverlayPlugin._render_file_browser has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 6, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 21). 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e9703c0a0eb1e08af90f73b09b0c5fecff66e9c32d24d16ae42abe9af67f36"}},{"ruleId":"D2","level":"warning","message":{"text":"Primitive._add_to_context (cognitive 43): Primitive._add_to_context has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (25 pts), ternaries 7 (15 pts), loops 2 (3 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":"genesis/ext/pyrender/primitive.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b3a97d791886dea481058a9560132dbbca9c86437c6b74ebbb86f2069ed4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer._render (cognitive 43): Viewer._render has cognitive complexity 43 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). 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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeaf47179a8245f0add26c7d48bc61074ebeec7fd2d4d6962f3298d76a2c0a8"}},{"ruleId":"D2","level":"warning","message":{"text":"TrajectoryFileWriter.build (cognitive 43): TrajectoryFileWriter.build has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (20 pts), ternaries 7 (13 pts), loops 4 (6 pts), boolean chains 4 (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":"genesis/recorders/trajectory.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3dd6cdfee3b4512b848302c6d9f378e05cc0726819a62193569719862810bd"}},{"ruleId":"D2","level":"warning","message":{"text":"data._allocate (cognitive 43): data._allocate has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 6 (10 pts), boolean chains 5, loops 2 (3 pts), error handling 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":"genesis/utils/data.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3896adc13dc20b00d07a74126de22c15fa52e7c7ae9c7d2a21cea5ea8b6c10c3"}},{"ruleId":"D2","level":"warning","message":{"text":"particle._relax_volume_sampling (cognitive 43): particle._relax_volume_sampling has cognitive complexity 43 (threshold 15). Drivers by points: loops 10 (22 pts), if/else 5 (15 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 25). 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":"genesis/utils/particle.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefd7cd68babe65921884b2192d15e37d6a9743f8f8e6d4906485207b89a4969"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_implicit_damping (cognitive 42): forward_dynamics.func_implicit_damping has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (10 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 26). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"696cba0fb745c3625d127edd5670ff321040c3eb9d936bb589a23827f951a03d"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_collider_clear_env (cognitive 42): contact.func_collider_clear_env has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 6 (16 pts) (nesting depth added 26). 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fab8fde554cf2eb775f9047baf0a4911a568d50a23bbec3403b3e6d768ffda"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_gjk_subdistance (cognitive 42): gjk.func_gjk_subdistance has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 23). 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0abdc9c8af183ef4a2ca5767e78cfdb6632a006208afa6ab82437439f78f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer._get_primitive_program (cognitive 42): Renderer._get_primitive_program has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (41 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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce1250fdd4844fb2de1a3bb89bfaa9fcf6efde953087b5fa9c68f617bbe7e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLLinePlotter._update_plot (cognitive 42): MPLLinePlotter._update_plot has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (8 pts), boolean chains 7 (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":"genesis/recorders/plotters.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534c8817e14466133c6045ec7ef88b7fcf229f7ba78c9772e29766183cc5a38"}},{"ruleId":"D2","level":"warning","message":{"text":"mesh._cast_rays_bvh (cognitive 42): mesh._cast_rays_bvh has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (9 pts), boolean chains 6 (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":"genesis/utils/mesh.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4d58d5d84491b6db2bafb238040735f3a37c4e5795741ec77852a08bcf95cf"}},{"ruleId":"D2","level":"warning","message":{"text":"kinematic_tactile._kernel_build_sensor_geom_idx (cognitive 41): kinematic_tactile._kernel_build_sensor_geom_idx has cognitive complexity 41 (threshold 15). Drivers by points: if/else 3 (15 pts), ternaries 3 (13 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 29). 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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2d9ff88b97d05e9d950f47a685f97b3aacd9e06588afb4732ef27409053e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"FEMSolver.build (cognitive 41): FEMSolver.build has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 9 (16 pts), ternaries 3 (5 pts), boolean chains 4 (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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df15c2caee0c9364e7e4df99acb4ad7d4170fdbe3b3c7b50b19f5743f28b3f1"}},{"ruleId":"D2","level":"warning","message":{"text":"noslip.func_refresh_qacc_batch (cognitive 41): noslip.func_refresh_qacc_batch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 7 (15 pts), ternaries 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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d480cbb613765e2e827f0915c0f793ea7690ebed5cbd662d0aae25bd4c6d56"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_island_tiled_factor_solve_all (cognitive 41): solver.func_island_tiled_factor_solve_all has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (26 pts), ternaries 3 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 28). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3609}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f84085bb8491ad1fe640d886ad2f7d6503be04edbdf164ea4fe0bf2b7591be"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh._get_trimesh_props (cognitive 41): Mesh._get_trimesh_props has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 3 (10 pts), boolean chains 3 (nesting depth added 21). 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":"genesis/ext/pyrender/mesh.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6844f3cb5f76441d190f5450755b8f4669816d2dcab81c40f47daf52af0375"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.get_gpu_shared_tile_sizes (cognitive 41): misc.get_gpu_shared_tile_sizes has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 7 (13 pts), ternaries 3 (8 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":"genesis/utils/misc.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"885483137aa01e07204ee33310f4e70efe61a5302350f3f5b6c4d51ba7e753ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Simulator.build (cognitive 40): Simulator.build has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 5, loops 5 (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":"genesis/engine/simulator.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1148361a020c1ae0f3fe2e88702ab04bc7c059da15eb47670914a7e2c09dfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_init_pcg (cognitive 40): fem_solver.func_init_pcg has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 3 (7 pts), ternaries 2, boolean chains 1 (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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6e1c0b6c5a1c3ddf3e89a4184a9a057fca92f827c039e9cdb639a76bb4191"}},{"ruleId":"D2","level":"warning","message":{"text":"epa.func_epa_init_polytope_3d (cognitive 40): epa.func_epa_init_polytope_3d has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 5 (13 pts), loops 6 (10 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"983881aade50ac2ef0242da5856bc8621a306ac57df6ce50b2c51476c4cb63f9"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_gjk (cognitive 40): gjk.func_gjk has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (5 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ea7cadc7fdcec8be3c4e3b5bb43a7ae287c7a61fa20e263b7d73b720fd59d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer._bind_and_draw_primitive (cognitive 40): Renderer._bind_and_draw_primitive has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 4 (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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad21ca1b2e762e5d56b7139abea247ad0c53cc8438e17fa3232b47b85f1cbb5"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchRecorder.insert (cognitive 40): LaunchRecorder.insert has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (2 pts) (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":"genesis/grad/bridge.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9632dc7e690969515013a612375e4030a444d4bce6643702a9aaed0c1cd89c45"}},{"ruleId":"D2","level":"warning","message":{"text":"RRT._kernel_rrt_step1 (cognitive 40): RRT._kernel_rrt_step1 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (15 pts), ternaries 2 (9 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/path_planning.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fcc5701191dc9f1dd8a3be18040b28aa26b042738a56d3250ece372c5c662c"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_contact_convex_convex_sdf (cognitive 39): narrowphase.func_contact_convex_convex_sdf has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 23). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6666f84d5664f5af249d38feb8ae096d5df8e54a1dbd534b2471495743595336"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_exit_single_island (cognitive 39): linesearch.func_exit_single_island has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (9 pts), ternaries 1 (3 pts) (nesting depth added 24). 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b52bb81dcd555a26f9825b41bd4d2a04bf78a8d5595b65e4018cf2102d87c4"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_exit_islands_serial (cognitive 39): linesearch.func_exit_islands_serial has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (12 pts) (nesting depth added 27). 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"29df645c298ef87c3687be0c39c9eba990348daed0a305450f5de2eabd4b3d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TrajectoryFileWriter._compress_frames (cognitive 39): TrajectoryFileWriter._compress_frames has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), error handling 3 (10 pts), boolean chains 3, ternaries 1 (3 pts), 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":"genesis/recorders/trajectory.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0782f32cdb8142f407d775f85609a70a43cd3bdb157b5b8b5bc6ed8e9d0b2b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"particle._advect_foams (cognitive 39): particle._advect_foams has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (20 pts), if/else 6 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/particle.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da95de3a4cf7c9fbfd8a75c00d0113c89e831e16a74e2c2f483d841cf2a1ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"PathPlanner._func_check_collision (cognitive 39): PathPlanner._func_check_collision has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (30 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 24). 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":"genesis/utils/path_planning.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e9e5575a405218e52d8049b22a222bd5be39465a290749f92fc80ab9cb864f"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointMixin.load_checkpoint (cognitive 38): CheckpointMixin.load_checkpoint has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (10 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"556fc62fc81049958ef27def36f4a89304a94634320cb315398ff61c2e79b939"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_update_cartesian_space (cognitive 38): forward_kinematics.func_update_cartesian_space has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (11 pts), ternaries 1 (4 pts), boolean chains 3 (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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe6be4df000dca59d7c0a47b1c1ca368910ade50ffcfdd7771c3d3770145276"}},{"ruleId":"D2","level":"warning","message":{"text":"inverse_kinematics.func_jacobian_scratch (cognitive 38): inverse_kinematics.func_jacobian_scratch has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (25 pts), ternaries 3 (10 pts), if/else 1 (3 pts) (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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c694680b752f29555e2e7e894c1f7c8244167468f1bf7b625389184419f4e605"}},{"ruleId":"D2","level":"warning","message":{"text":"inverse_kinematics.func_get_jacobian (cognitive 38): inverse_kinematics.func_get_jacobian has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (25 pts), ternaries 3 (10 pts), if/else 1 (3 pts) (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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef0dafa6e041d608a4d540ce2f6cf942c204549f5cfe1d779dd376b15bc9c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"pbd_solver.kernel_solve_density (cognitive 37): pbd_solver.kernel_solve_density has cognitive complexity 37 (threshold 15). Drivers by points: loops 7 (23 pts), if/else 3 (12 pts), boolean chains 2 (nesting depth added 25). 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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61bbbb2614eb01e1601d7c0398ab569d87bf509147210cc0364b75e06d18a74"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_bw.func_forward_kinematics_link_bw (cognitive 37): manual_bw.func_forward_kinematics_link_bw has cognitive complexity 37 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 4 (5 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad771993bb53c2bd704151c36f877c741b9520da648f7833d1bcbc668a39f8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.add_frictionloss_constraints (cognitive 37): solver.add_frictionloss_constraints has cognitive complexity 37 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 5 (12 pts), ternaries 3 (12 pts), boolean chains 1 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa8663950997c412657cc90a2f667160550a5187b92311c14f988e86fd374fd"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver._init_tree_fields (cognitive 37): RigidSolver._init_tree_fields has cognitive complexity 37 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 5 (16 pts), boolean chains 2 (nesting depth added 21). 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aad789cc38a9865acab4e99b704f6e7ffefbadf085ebd412290c3e05a6f21f"}},{"ruleId":"D2","level":"warning","message":{"text":"RRTConnect.plan (cognitive 37): RRTConnect.plan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 3 (5 pts), loops 3, 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":"genesis/utils/path_planning.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f8f4093d05c1569d50608a940727a6742c1b81d0e547a6031e58b5d7f18bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_rigid_entity._parse_articulation_structure (cognitive 37): usd_rigid_entity._parse_articulation_structure has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 5 (11 pts), loops 4 (6 pts) (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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d6b0257c09b5607a68b9e20d0148bc46833bb57e82012d8982a1d9c265819d"}},{"ruleId":"D2","level":"warning","message":{"text":"Alarm.build_table (cognitive 36): Alarm.build_table has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 5 (19 pts), if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/scripts/alarm.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99f94b35532045e709c29744c9ab6c52c8f9f4c17750bf8d3cc5808e71a186d"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_compute_constraint_chunk (cognitive 36): sap_coupler.func_compute_constraint_chunk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 3 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 22). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3953}}}],"partialFingerprints":{"codehealthFindingId/v1":"604f78aaa8d25f849ffd246b6d934b8704675aab9720bc0b9c0556b2b1edd5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_init_exact_linesearch (cognitive 36): sap_coupler.func_init_exact_linesearch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (9 pts), boolean chains 1, ternaries 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4751}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a4b6a94c8001013e6df50f01c51098a18637367fe1996ac8c45c556e76b077"}},{"ruleId":"D2","level":"warning","message":{"text":"TemperatureGridSensor.build (cognitive 36): TemperatureGridSensor.build has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (8 pts), ternaries 2, 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":"genesis/engine/sensors/temperature.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"beba93534f0ee19cd595eed72da6900ca0d70903e7bd067021bc845132b33a71"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_contact.func_approximate_polygon_with_quad (cognitive 36): multi_contact.func_approximate_polygon_with_quad has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (11 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b930a0faa51f61ffef1c0bb59a7b0fe2df6bacb18c8e2cfaa10a76c5eaaa3b"}},{"ruleId":"D2","level":"warning","message":{"text":"backward.kernel_manual_add_joint_limit_constraints_bw (cognitive 36): backward.kernel_manual_add_joint_limit_constraints_bw has cognitive complexity 36 (threshold 15). Drivers by points: if/else 4 (17 pts), ternaries 3 (12 pts), loops 3 (6 pts), boolean chains 1 (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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6795710da1414cd0603866fd9f6053cf3a9fd49d534cd984d8df92c70ef0ff26"}},{"ruleId":"D2","level":"warning","message":{"text":"island.func_group_constraints_by_island_coop (cognitive 36): island.func_group_constraints_by_island_coop has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 6 (11 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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e3fdbf80771e4afab32a8a30a13e7180ef0b7257d548f7e36c2a8ec534bbab"}},{"ruleId":"D2","level":"warning","message":{"text":"RRT.plan (cognitive 36): RRT.plan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 3 (5 pts), boolean chains 2, loops 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":"genesis/utils/path_planning.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab1a1b93e5752cadc791542e7fffe80a71aec97e54ef1710914b90479a29994"}},{"ruleId":"D2","level":"warning","message":{"text":"temperature._kernel_compute_contact_areas (cognitive 35): temperature._kernel_compute_contact_areas has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (15 pts), boolean chains 2 (nesting depth added 21). 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":"genesis/engine/sensors/temperature.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed2dc0215d15239d8c703470d331e7f0c86dc96ce9eacc2f331b036f5b45c01"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_linesearch_iter (cognitive 35): fem_solver.func_linesearch_iter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (6 pts), boolean chains 5, ternaries 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4ae81c717d4b3812e70ddb6fe86466b1190f4acab2cfeeaad7d156aff0d0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_bw.func_forward_velocity_link_bw (cognitive 35): manual_bw.func_forward_velocity_link_bw has cognitive complexity 35 (threshold 15). Drivers by points: loops 12 (25 pts), if/else 3 (5 pts), ternaries 3 (5 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2882cf548c70573abce64f3d16555f4e3bfed96df6c228d75ac497cb64f9260f"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.kernel_delete_dynamic_constraint (cognitive 35): solver.kernel_delete_dynamic_constraint has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (23 pts), loops 3 (8 pts), boolean chains 4 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c099eecd55e9fe1f41c6b4a93a14da02a6156a3813985ca1b5a347122e064dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"sph_solver.func_solver_iteration (cognitive 35): sph_solver.func_solver_iteration has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts), boolean chains 2 (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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba6bb45596b176c62d11cdc5f172ef4a83d360b53862e84dd78374fb14568a"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.unique_rows (cognitive 35): misc.unique_rows has cognitive complexity 35 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8270c9f303f532d0cdd8c8ea8a1ec22b5f6eb1e12444f4bdbb6511f9b7a74b"}},{"ruleId":"D2","level":"warning","message":{"text":"Camera.render (cognitive 35): Camera.render has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (2 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":"genesis/vis/camera.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6dafafd32eac03b3eb71babfd7f3a33bd3cb38a546e8d9ff0f31b3a860ab4c"}},{"ruleId":"D2","level":"warning","message":{"text":"IPCCoupler._add_articulation_entities_to_ipc (cognitive 34): IPCCoupler._add_articulation_entities_to_ipc has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (8 pts), ternaries 2 (6 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b33f32cb8d169e6e3adc7150ccb6619c6553b24c8ad4be988b3d8f7659c1c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidJoint.dofs_length (cognitive 34): RigidJoint.dofs_length has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (14 pts), ternaries 2 (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":"genesis/engine/entities/rigid_entity/rigid_joint.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6802f718fdbece4add8640ba65da12844e1b79e0b9225c2e6f79c5ffcfdf9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SensorManager.build (cognitive 34): SensorManager.build has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 9 (12 pts), ternaries 2 (6 pts), boolean chains 2 (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":"genesis/engine/sensors/sensor_manager.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"52da8dddcd2ba1fa6e149f5a7322a70afcd201f44dc977dd7f0c4030f6317f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_factor_mass_tree (cognitive 34): forward_dynamics.func_factor_mass_tree has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (14 pts), ternaries 1 (4 pts) (nesting depth added 22). 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9b3e3833ec1364db6a0f2dfd17d90dde47aa07a3e1667227c80510f847ce3c"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_forward_velocity_link (cognitive 34): forward_kinematics.func_forward_velocity_link has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 5 (10 pts), ternaries 5 (8 pts) (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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ebf7f4942f6b3ea270c132c385fa1123e04d488ba3c38c4cf08f0438f5e47a"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_contact_is_after (cognitive 34): contact.func_contact_is_after has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (14 pts) (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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"934c047d7face4a090395c74c17c918c6b480d90723304962db045f1439e2d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"noslip.func_noslip_batch (cognitive 34): noslip.func_noslip_batch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 3 (6 pts), ternaries 1 (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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"213324b49f25ffee9a7f458be7d2d7fb4b0d6e92060fbc76f840570599d6c02e"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTexture._validate_and_load (cognitive 34): ImageTexture._validate_and_load has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (34 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":"genesis/options/textures.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2454a486b74605fa366a4515dc18bee35b3d52a039fa8be1e8d971729dabf0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"kinematic_tactile._kernel_kinematic_taxel_bvh (cognitive 33): kinematic_tactile._kernel_kinematic_taxel_bvh has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 5 (10 pts), loops 4 (9 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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bd517878df7d7b7758690d7c8a383f30097d70f743b8aa917c8c5063cc71bf"}},{"ruleId":"D2","level":"warning","message":{"text":"accessor.kernel_set_dofs_position (cognitive 33): accessor.kernel_set_dofs_position has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 4 (9 pts), ternaries 2 (5 pts) (nesting depth added 21). 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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ad64cb0932e53bd368d16d76d2b9320e61496752a908b1811882b7292ae92e"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.func_hibernate_island_if_settled (cognitive 33): misc.func_hibernate_island_if_settled has cognitive complexity 33 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (11 pts), ternaries 2 (9 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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad257c3eb78f6347df3921763aa7fd681bb92d6d25ed1588f4fa940ca34bc56d"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase.func_prefer_gjk_refinement (cognitive 33): narrowphase.func_prefer_gjk_refinement has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (7 pts), boolean chains 2 (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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6730b33342a337d9b7ffc0c1acb7ae0ef11e113d4545e025280c27e35226a75"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_island_hessian_assemble_all (cognitive 33): solver.func_island_hessian_assemble_all has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), ternaries 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c338a1617578785123ec0ebcd3f2e0d0da771c32fd7e450187ffcc7ea11bdfa5"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_cholesky_factor_direct_batch (cognitive 33): solver.func_cholesky_factor_direct_batch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (9 pts), boolean chains 4 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a8ea1018e6ebeb2c93be94be84c4e2f6f080c9533b7cb58c795ae25c26350b"}},{"ruleId":"D2","level":"warning","message":{"text":"jit_render.bind_lighting (cognitive 33): jit_render.bind_lighting has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (5 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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bea2bc9c5011371f37f5254be36b246f4ada72dbefd872e7ad4461c8ecc8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"URDF._process_cfgs (cognitive 33): URDF._process_cfgs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (13 pts) (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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18826623b3c51c4ba29e9dc06d92885cbc8eb600005e701447fbac431a4ee7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Trajectory.__init__ (cognitive 33): Trajectory.__init__ has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 3, loops 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":"genesis/recorders/trajectory.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4e0be84f23d5135c3c46e75195eb759374ca03f435eba8772754cbb456c775"}},{"ruleId":"D2","level":"warning","message":{"text":"data.iter_data (cognitive 33): data.iter_data has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff85cfc206d657a7167e3b0bb0e39dac2e8378a3387bafd721459384f2cb51a"}},{"ruleId":"D2","level":"warning","message":{"text":"geom.func_sort_particles_by_slot (cognitive 33): geom.func_sort_particles_by_slot has cognitive complexity 33 (threshold 15). Drivers by points: loops 16 (23 pts), if/else 4 (10 pts) (nesting depth added 13). 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":"genesis/utils/geom.py"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"717af67cfbcfb9f01024b13b4d78d68146dc9b2d1ab60c677e08095d564885be"}},{"ruleId":"D2","level":"warning","message":{"text":"Camera.build (cognitive 33): Camera.build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 4 (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":"genesis/vis/camera.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc93634b9b02afa61f6c7ea870a655164e43210142599e655ab10049cf739d8"}},{"ruleId":"D2","level":"warning","message":{"text":"tactile_shared.normalize_grid_probe_layout (cognitive 32): tactile_shared.normalize_grid_probe_layout has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 1 (5 pts), boolean chains 4 (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":"genesis/engine/sensors/tactile_shared.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3628779985d9169a7615336d4431778fb8ae7bdbacd8761869d169b8d0710a"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.kernel_refresh_invweight_and_meaninertia (cognitive 32): forward_dynamics.kernel_refresh_invweight_and_meaninertia has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 4 (8 pts), loops 4 (7 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92cf51ea45387617e92990367163cd6a25bb8f7f61f6a4cc42971d7232d3f56"}},{"ruleId":"D2","level":"warning","message":{"text":"raycast_qd.closest_point_on_triangle (cognitive 32): raycast_qd.closest_point_on_triangle has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 6 (nesting depth added 15). 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":"genesis/utils/raycast_qd.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eca67d68f7ee70c3af360c84622b9a9ed79cf831f02999703a9c94331408b9"}},{"ruleId":"D2","level":"warning","message":{"text":"UsdContext.find_all_materials (cognitive 32): UsdContext.find_all_materials has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (6 pts), boolean chains 3, ternaries 2, 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa98e0a776f6f27cc21e8036d6ced6fc04f7bc7aa2b1be2fe676171fb5b6c12"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_rigid_entity.parse_usd_rigid_entity (cognitive 32): usd_rigid_entity.parse_usd_rigid_entity has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 6 (9 pts), boolean chains 3 (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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"facde6d7e2fe5a2a2819b642c0af552b54875418b1b610c300001b5817219b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._collapse_safe (cognitive 32): watertighten._collapse_safe has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (2 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":"genesis/utils/watertighten.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f673f24fe03bc55de1a01102352d4b91615cd7f2bd4c01d35fe3d0231cc829ba"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.kernel_compute_regularization (cognitive 31): sap_coupler.kernel_compute_regularization has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7282fa2a4bd0e701e2d9f8fd60ae067f921f99e889ada3beec62932ac90a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicSolver.build (cognitive 31): KinematicSolver.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 7 (9 pts), boolean chains 6, ternaries 2 (3 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"041061788591e699282d15819629c6b2c7708f168e98166b6e5c2970187e57c9"}},{"ruleId":"D2","level":"warning","message":{"text":"pbd_solver.kernel_solve_collision (cognitive 31): pbd_solver.kernel_solve_collision has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (11 pts), boolean chains 4 (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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffff70288763ced463327c30482b0b2e5c71dc56b387727db47477a7ef937a9"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.func_equality_links (cognitive 31): misc.func_equality_links has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 3 (12 pts), loops 2 (6 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a45e3861cd950d5028b93fd9557a7aad417f3e5908faa9639efe887d3bb72c5"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_safe_gjk_support (cognitive 31): gjk.func_safe_gjk_support has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 4 (12 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59cd541d3dc19a6e0e4b6bce409ea1f576cd03dc51b4a0649ac53906fed131f"}},{"ruleId":"D2","level":"warning","message":{"text":"mpr.mpr_find_pos (cognitive 31): mpr.mpr_find_pos has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 7 (14 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"effde68cf7397267ea064d722173b8bbe85bee673c41e7724455dadd9b5adda7"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_add_relative_motion_rows (cognitive 31): solver.func_add_relative_motion_rows has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 3 (9 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c429aab78b0f39c21ecf6dbc8e4825ae6e41d3813a9b71fe33da652717df6719"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_update_constraint_batch (cognitive 31): solver.func_update_constraint_batch has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 8 (14 pts), boolean chains 2 (nesting depth added 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0151d4f4086971c873793970fe2ae6ab3e6af043d795cfb26e65330da12fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"raycast_qd.kernel_cast_rays (cognitive 31): raycast_qd.kernel_cast_rays has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (9 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/raycast_qd.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fba8f75cd91efb33f61e4c2261e76533d6f5c143c49372ea05ea6399a2a561"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.func_boundary_source_cell (cognitive 30): legacy_coupler.func_boundary_source_cell has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 1 (4 pts) (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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0304fa4b06572939ae0879b8a6ee396cdb6d559d48027f1654c73fd3bca7ead"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_coupler.func_boundary_source_window (cognitive 30): legacy_coupler.func_boundary_source_window has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (28 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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a332054216861fb7c1c7b420ed674af8d80783764607d2e4a1670d35d6559412"}},{"ruleId":"D2","level":"warning","message":{"text":"temperature._kernel_contact_heat (cognitive 30): temperature._kernel_contact_heat has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (8 pts), ternaries 1 (3 pts), boolean chains 2 (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":"genesis/engine/sensors/temperature.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c8a454b10c8101729c652a9e1d110396516dac5415d84544f03566ae80f727"}},{"ruleId":"D2","level":"warning","message":{"text":"accessor.kernel_set_sol_params (cognitive 30): accessor.kernel_set_sol_params has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 5 (6 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b8106a81ae3026b1729afc1b6deaa93f7d80d3e3f1229be79afffbcf2a7993"}},{"ruleId":"D2","level":"warning","message":{"text":"solver_breakdown._func_islands_linesearch_and_apply (cognitive 30): solver_breakdown._func_islands_linesearch_and_apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver_breakdown.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d577cff340445c695624981da382a320b228cd3195590baaf3083819a70d642"}},{"ruleId":"D2","level":"warning","message":{"text":"solver_breakdown._func_islands_update_search_direction (cognitive 30): solver_breakdown._func_islands_update_search_direction has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (27 pts), boolean chains 2, loops 1 (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":"genesis/engine/solvers/rigid/constraint/solver_breakdown.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cffc6b0c367e422257b42d3158a632946fcaa0de99b7d66ac85677378c11810"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene.add_node (cognitive 30): Scene.add_node has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/scene.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeefde4cefe65726b97dc738a443a78344ab2d201a105198cae11235add88944"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.format_texture_source (cognitive 30): utils.format_texture_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (29 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":"genesis/ext/pyrender/utils.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e2664d83d7a3c5aa8e1260d31739731233c5b597f7ebb8b8612f69b7dfa5bf"}},{"ruleId":"D2","level":"warning","message":{"text":"URDF.link_fk (cognitive 30): URDF.link_fk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (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. This shape REPEATS in the file: one other method here (URDF.link_fk_batch) 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"42abefc62d61e85b2dfd525eec48440d25df2d5f2ce3e3921e1429ec71c2162f"}},{"ruleId":"D2","level":"warning","message":{"text":"URDF.link_fk_batch (cognitive 30): URDF.link_fk_batch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (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. This shape REPEATS in the file: one other method here (URDF.link_fk) 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"7293db8bcde4c35aa20b73c06570d8d9560478107bb09587d08f806d7c4d152a"}},{"ruleId":"D2","level":"warning","message":{"text":"URDF.animate (cognitive 30): URDF.animate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 5 (8 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc940c783adbc3cd116975b3390071f3dd55eb1d542769be287528e6d363f83"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.qd_to_torch (cognitive 30): misc.qd_to_torch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 2 (5 pts), ternaries 2 (5 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":"genesis/utils/misc.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f3f5710d3d87ced577a1a26c5a618811c7ffa87a66c62aa80efab1ddb63933"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_coarse_eliminate (cognitive 29): fem_solver.func_coarse_eliminate has cognitive complexity 29 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 5 (12 pts), ternaries 1 (nesting depth added 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c195eafaa0b7adc43102d3ad03ab3f926ea376282ba84524ec7f1194fd3fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_update_pcg_env (cognitive 29): fem_solver.func_update_pcg_env has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"160fec43b5b5c3f81c4f8b0ff2449250c07ed5ac760f239bfc072d845e8db4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_forward_kinematics_link (cognitive 29): forward_kinematics.func_forward_kinematics_link has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (10 pts), loops 3 (7 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"287d1884e3a02d90b5f80cecae6376b9fefee4b839702662eb8a0cafb6714efc"}},{"ruleId":"D2","level":"warning","message":{"text":"inverse_kinematics.func_forward_kinematics_scratch (cognitive 29): inverse_kinematics.func_forward_kinematics_scratch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 3 (8 pts), loops 2 (3 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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb75534ba53fc38cb441582c3765b1234afa40a27aa73f075e3b9cd351e43bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_contact_heapsort (cognitive 29): contact.func_contact_heapsort has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 pts), boolean chains 2 (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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d6dd8bbcac943b7b00deeae038d0e0408b839752c4c64f5562dd7c6b578123"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene._remove_node (cognitive 29): Scene._remove_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/scene.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"5330849f25ab5df417567edb579acd953a86c021e070d03ad15be17cdef5e091"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchRecorder.reverse (cognitive 29): LaunchRecorder.reverse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (10 pts), boolean chains 4 (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":"genesis/grad/bridge.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9182700954ef1ab9a67c489ac2a7bbc92e24e0e1f596fc75c751faf2543c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Options._validation_error (cognitive 29): Options._validation_error has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, loops 2, ternaries 1 (2 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":"genesis/options/options.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e643dfe37ba49f695c5104e6a9f36f9f01ebc024b3ac04dfdda4aaf2f09ec620"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.get_hashkey (cognitive 29): cache.get_hashkey has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (7 pts), error handling 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/cache.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a859b34fc588599427dc0162263ff5b1ac4d13e763833367f9b4a145d57958"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameImageExporter.export_frame_single_camera (cognitive 29): FrameImageExporter.export_frame_single_camera has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (4 pts), boolean chains 3, 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":"genesis/utils/image_exporter.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e990c3e54004565ecc1f6f097ea92bc75f8bf496156bebb7ba80234866fae14"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.sanitize_index (cognitive 29): misc.sanitize_index has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 3 (6 pts), boolean chains 5, error handling 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":"genesis/utils/misc.py"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ebab167a16f20759aa42fb403f71facbc8960089a058a05b18a742d7daf2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"MouseInteractionPlugin.on_draw (cognitive 29): MouseInteractionPlugin.on_draw has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (5 pts), boolean chains 3, 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":"genesis/vis/viewer_plugins/plugins/mouse_interaction.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aef51e9294c92944bb5fb385742930a68db31915a9b2db09736949dfb17a3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._load_mesh (cognitive 28): KinematicEntityDescription._load_mesh has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (7 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b344e720370d930319a6e7df5c58225d5d24bc0811114294f6c1e3792bec284d"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveScene._apply_rebuild (cognitive 28): InteractiveScene._apply_rebuild has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (6 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/interactive_scene.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc72f0fd7e388d7f05226b05b72452895a4a841c6dd2593ec48f445c0166321"}},{"ruleId":"D2","level":"warning","message":{"text":"inverse_kinematics.func_integrate_dq_scratch (cognitive 28): inverse_kinematics.func_integrate_dq_scratch has cognitive complexity 28 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts), ternaries 3 (9 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1372bcd20cc54dfe7ca6f5e96e916c2ba44290c588ea5a1d0450c03dcc396615"}},{"ruleId":"D2","level":"warning","message":{"text":"backward.kernel_manual_add_frictionloss_constraints_bw (cognitive 28): backward.kernel_manual_add_frictionloss_constraints_bw has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 4 (10 pts), if/else 1 (5 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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b6802dc27364b22d79d6ea6c1e6b75bf09cd16df47f9414d0e5a225cb375d5"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.update_pbd (cognitive 28): RasterizerContext.update_pbd has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 2 (5 pts) (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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bc5e596baddae9b8cc833f58763b5bc4ea242c7c8c2a3deaa3d1be3eab40fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Alarm.fetch_wandb_data (cognitive 27): Alarm.fetch_wandb_data has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 2 (4 pts), boolean chains 3, 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":".github/workflows/scripts/alarm.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6494637aa8feae50f5a158ea0f1e1f28a006696afb60e18d2ff2034a821d07"}},{"ruleId":"D2","level":"warning","message":{"text":"epa.func_epa_horizon (cognitive 27): epa.func_epa_horizon has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (3 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c82c6ed6a9ed48486a8e3ba9996d4a8b1b9a2df7bbaf5d27ca55a2fff3f7a92"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._func_update_efc_force (cognitive 27): solver._func_update_efc_force has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (9 pts), ternaries 2 (4 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c794d157941e7d74311e7c967a35cf804f4b9ecc66b9660b14b8a7ba5a669209"}},{"ruleId":"D2","level":"warning","message":{"text":"mjcf.parse_equalities (cognitive 27): mjcf.parse_equalities has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), ternaries 2 (6 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":"genesis/utils/mjcf.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"73453826b34a8c0886d29f593ff256b0835cd3cbaacf34555c6e0703f56e1ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"terrain.parse_terrain (cognitive 27): terrain.parse_terrain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts), ternaries 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":"genesis/utils/terrain.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"76192389811f376cab14c954376e8c33e03565f62c1189a160e733f9d8f36540"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntity.inverse_kinematics_multilink (cognitive 26): KinematicEntity.inverse_kinematics_multilink has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 7 (9 pts), loops 2, boolean chains 1 (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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7919187abee16f7207c13965f7546b445339d56b4131ef04eb1cc6c04234732c"}},{"ruleId":"D2","level":"warning","message":{"text":"Sensor.__init_subclass__ (cognitive 26): Sensor.__init_subclass__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 7, loops 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":"genesis/engine/sensors/base_sensor.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddcf6683088a7d1ed9f41db2d549780f3af2d65deded694f99bf6a4e5bb016d"}},{"ruleId":"D2","level":"warning","message":{"text":"contact_force._kernel_get_contacts_forces (cognitive 26): contact_force._kernel_get_contacts_forces has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (8 pts), boolean chains 3 (nesting depth added 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":"genesis/engine/sensors/contact_force.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7866c77c7922e97d81bb9d2af500730ecca93c9b6fbc242eba1218bb8d30dd"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_accumulate_vertices (cognitive 26): fem_solver.func_accumulate_vertices has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf638bffcf807ac88d1f77fc53c0bf2a28ff5099eea868c5d6f657e5fdf0984"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_midpoint_eligible (cognitive 26): forward_dynamics.func_midpoint_eligible has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 3 (7 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa777da33c73068b1e46bc0b91cd2ac0d4ef8e496770cc1f2bc49638dc4893d"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_compute_island_envelope (cognitive 26): solver.func_compute_island_envelope has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 8 (11 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9efaae3cce8f315e270391ff4d9b4a64791cd068da03007112601659609d51"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_add_cone_hessian_block_coop (cognitive 26): solver.func_add_cone_hessian_block_coop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9012ac51507abb5f5fb0d5870da442e65bb2aad92b0818048608a2fb8d3a64"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_hessian_and_cholesky_factor_incremental_batch (cognitive 26): solver.func_hessian_and_cholesky_factor_incremental_batch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4314}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c80e13fd9c1fbd3448418d17d4153ea3e3af0ffe43a5c06db6e7d5e620f352"}},{"ruleId":"D2","level":"warning","message":{"text":"OffscreenRenderer.render (cognitive 26): OffscreenRenderer.render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 6 (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":"genesis/ext/pyrender/offscreen.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebd0e9bcfd9e1149689243276c9beb85fa1e0ec2201dc8d1b039f2e03abeab6"}},{"ruleId":"D2","level":"warning","message":{"text":"data._size_names (cognitive 26): data._size_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (8 pts), loops 3 (7 pts), boolean chains 3 (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":"genesis/utils/data.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce53b0453fa5d8935a62417e807c7905ba55282a1d545a7f82df0b9d620322"}},{"ruleId":"D2","level":"warning","message":{"text":"linalg.mat_inverse (cognitive 26): linalg.mat_inverse has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (22 pts), if/else 2 (4 pts) (nesting depth added 14). 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":"genesis/utils/linalg.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eae667dd5977ceb3528cda72662d8ddd9178efcf9a25243c035b1b42acefc96"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.qd_to_numpy (cognitive 26): misc.qd_to_numpy has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (5 pts), ternaries 2 (5 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":"genesis/utils/misc.py"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0abfceb52c7b4e2a20796ea594db64534b8e5ec90b7e5ec500bce258137513"}},{"ruleId":"D2","level":"warning","message":{"text":"particle._compute_emission_potentials (cognitive 26): particle._compute_emission_potentials has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/particle.py"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"74437d2127e00e91646acaa5bc5dfe673c4e51445b4ee8c85fcbdcbf8ff8bcd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Rasterizer.destroy (cognitive 26): Rasterizer.destroy has cognitive complexity 26 (threshold 15). Drivers by points: error handling 3 (10 pts), if/else 5 (10 pts), loops 3 (6 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":"genesis/vis/rasterizer.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"255f65a31788347790408790b916fb5171b61701cfff27cea32ccaa1903a7d05"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.draw_rigid (cognitive 26): RasterizerContext.draw_rigid has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (11 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/rasterizer_context.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f91190141ef2d949854a2b637c30bd62a51e11d9a328de138a81a43689ad6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer.build (cognitive 26): Viewer.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), error handling 1 (2 pts), ternaries 2, loops 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":"genesis/vis/viewer.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eed20886fe5c7f52e853bcb442592267e59c022bec79336e9f0b4d495e03d1"}},{"ruleId":"D2","level":"warning","message":{"text":"JointEqualityHandler.compute_regularization (cognitive 25): JointEqualityHandler.compute_regularization has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (15 pts), if/else 4 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":5314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac9eb0d051d8fd976fe87cab6b3973f8beb9d8f955535be1c72962e953838a1"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._resolve_geoms (cognitive 25): KinematicEntityDescription._resolve_geoms has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (9 pts), boolean chains 4 (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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"23666fe34a503538da0e00f1ab9f5bdc05c9188ffb6c4aa561fa40008b02db04"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription._resolve_inertial (cognitive 25): KinematicEntityDescription._resolve_inertial has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (7 pts), boolean chains 4, 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb14344374e6ff19660767d34985d070fb43e2530694e378f2eacca60d55f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ElastomerTaxelSensor.build (cognitive 25): ElastomerTaxelSensor.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 5 (10 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c677e78c445e73608da49829f94fc1a6926a5ee787e0ec8ba131395616b1d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicSolver.set_dofs_velocity (cognitive 25): KinematicSolver.set_dofs_velocity has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (4 pts), boolean chains 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d693e51b002c1b98535afd666bf16422655ff0fb6efbd9a4e37aeeb293e0a0"}},{"ruleId":"D2","level":"warning","message":{"text":"JITRenderer.update_context (cognitive 25): JITRenderer.update_context has cognitive complexity 25 (threshold 15). Drivers by points: loops 11 (14 pts), if/else 4 (7 pts), boolean chains 4 (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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1aad8b77e409f87b6515ca3048e3c93aa08972fff431a7a2da50217cad1373"}},{"ruleId":"D2","level":"warning","message":{"text":"LinePlotHelper.process (cognitive 25): LinePlotHelper.process has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (10 pts), error handling 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/recorders/plotters.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a2df5e2a9d6214b98aa3ca3814eb2575727cf1400d32948ddd60716dd21e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization._export_value (cognitive 25): serialization._export_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/serialization.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ccf36767751f774e78ab484b1fb7c83c1f904503eed3af519584180a10883c"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization.load (cognitive 25): serialization.load has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 4, 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":"genesis/utils/serialization.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce11921be57cb60a9157a0fcbe2d81a98eecccb55223918b1e441ae5db5fa316"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_stage._find_connected_components (cognitive 25): usd_stage._find_connected_components has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, ternaries 2 (4 pts), loops 3 (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":"genesis/utils/usd/usd_stage.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dec586e5dd5b2a4d0272f4cb86b60768d141d67c6442f7ece05eb7a2a0b5efd"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_one_pcg_iter (cognitive 24): sap_coupler.func_one_pcg_iter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 5, loops 1, ternaries 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c3aa7f6f0f6194ad7eb3b9d0674e9b9a324c521b5efd419e1cbdc986e95015"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_gjk_intersect (cognitive 24): gjk.func_gjk_intersect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"53853154c17c0b372e80d908f8a1c838ce38c10d89f70ef95325b6e4648a50a6"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_search_valid_simplex_vertex (cognitive 24): gjk.func_search_valid_simplex_vertex has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 3 (6 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"95436277cbb0eb995f27181a0f6e656dab01d33c64166452c2d1db2fef222861"}},{"ruleId":"D2","level":"warning","message":{"text":"backward.kernel_compute_gradients (cognitive 24): backward.kernel_compute_gradients has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (12 pts), ternaries 3 (10 pts), if/else 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a13aa4efd082f54b4ea7bae7815085db7302b81a185fe2294d7f4e308e712bf"}},{"ruleId":"D2","level":"warning","message":{"text":"solver_breakdown._func_update_qfrc_constraint_per_dof (cognitive 24): solver_breakdown._func_update_qfrc_constraint_per_dof has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 15). 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":"genesis/engine/solvers/rigid/constraint/solver_breakdown.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3953cc30e2cf59070bcd1800282ce46d69f0a55f7d450583df7e71136790411e"}},{"ruleId":"D2","level":"warning","message":{"text":"trajectory._encode_frames (cognitive 24): trajectory._encode_frames has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 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":"genesis/recorders/trajectory.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ceca7fa6f7564b2a6fb2e8dfb4efbe5075af28fbd6fe359d7fec6b4c5c935"}},{"ruleId":"D2","level":"warning","message":{"text":"geom.trans_R_to_T (cognitive 24): geom.trans_R_to_T has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (9 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":"genesis/utils/geom.py"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"106a55049423a1005d9a60f0aef721e31a0b7ae342635874b8e81f9cd640f197"}},{"ruleId":"D2","level":"warning","message":{"text":"particle._rasterize_spheres (cognitive 24): particle._rasterize_spheres has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 2 (8 pts) (nesting depth added 13). 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":"genesis/utils/particle.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3fed11b5b2186af7e6a842ad1d32e00a1ae3379524ef012cc5ddb55ea69c54"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization._redact_paths (cognitive 24): serialization._redact_paths has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (6 pts), loops 2 (5 pts), boolean chains 2, error handling 1 (2 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":"genesis/utils/serialization.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18424b1e1f7806e60458358480805f693e13af36ad60f5983bf6297532b3f59"}},{"ruleId":"D2","level":"warning","message":{"text":"IPCCoupler._setup_coupling_config (cognitive 23): IPCCoupler._setup_coupling_config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab7959e99edfe2f76b508433c795c61c6ed374c3a83b8cf056cc03025e0b588"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver._sanitize_io_variables (cognitive 23): Solver._sanitize_io_variables has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, ternaries 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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"e517be3d9a52aef3c7131c5ecdadc44cfbb7671fd1bb0a908e11f934421853db"}},{"ruleId":"D2","level":"warning","message":{"text":"accessor.kernel_wake_up_entities_held_by_links (cognitive 23): accessor.kernel_wake_up_entities_held_by_links has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"603eb016b8b91b121c5de833d6d824d7456ace1782d7b7e5e5e11b23791c1d96"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_update_geoms (cognitive 23): forward_kinematics.func_update_geoms has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (5 pts), boolean chains 3, 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca19ea8e8976e6f5a6c7db27643188710fadfda536fc415c3066d045cf73f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"gjk.func_gjk_subdistance_2d (cognitive 23): gjk.func_gjk_subdistance_2d has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (9 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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba01b76ed205043187402970319096ee222c895389044224dcdd19d60a08481"}},{"ruleId":"D2","level":"warning","message":{"text":"sph_solver.kernel_compute_rho_and_dfsph_factor (cognitive 23): sph_solver.kernel_compute_rho_and_dfsph_factor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71e347040703f16cad1a35aead4322ec236da7bb521039e56ff1d7e2e77b3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"geom._tc_polar (cognitive 23): geom._tc_polar has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/geom.py"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eefd2d07b7ca142f62ccc7e7f520bf732859851c782e7e2b01ce8f586b19b4"}},{"ruleId":"D2","level":"warning","message":{"text":"particle._find_neighbors (cognitive 23): particle._find_neighbors has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (10 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":"genesis/utils/particle.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a0897da963a133c679bd9820ee585a9d604ebf52e4592343fd35ff8f09408f"}},{"ruleId":"D2","level":"warning","message":{"text":"RRT._kernel_rrt_step2 (cognitive 23): RRT._kernel_rrt_step2 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (5 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":"genesis/utils/path_planning.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb53d340fa39a7776ebd22090b2be121b4fefb050eea7a694fdda18887132629"}},{"ruleId":"D2","level":"warning","message":{"text":"urdf.merge_fixed_links (cognitive 23): urdf.merge_fixed_links has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (8 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":"genesis/utils/urdf.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b778c4f186a839c1a008aa68dd4adc47deae56eced7cc0ead2c8048edf2d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._build_edge_component_table (cognitive 23): watertighten._build_edge_component_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (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":"genesis/utils/watertighten.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7515cdbc9571f71b9fbac06588fc2c02b4a677f179031d88ae0c1ece2a39425"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_inverse_psd6 (cognitive 22): sap_coupler.func_inverse_psd6 has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 2 (5 pts) (nesting depth added 13). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc54edb37c31b8681cb38bb0105e57b8e6a7ce2d3febe2c51681020210b6ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_compute_constraints (cognitive 22): sap_coupler.func_compute_constraints has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 11). 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"75df89876b1a7d802c3da83f9e7d15e31b5a443ebf54198c0b6e42e1b243989e"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidJointDescription.__post_init__ (cognitive 22): RigidJointDescription.__post_init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 2 (6 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a3f93193eaca29838947dd88cd69f0415560f15a0636185d296210a3bcee1b"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_bw.kernel_manual_compute_qacc_bw (cognitive 22): manual_bw.kernel_manual_compute_qacc_bw has cognitive complexity 22 (threshold 15). Drivers by points: loops 10 (22 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4237825a30e4aa708d8398de0ee3597f942b3ffb433728550249e52dc7a8f5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_contact.func_potential_mesh_normals (cognitive 22): multi_contact.func_potential_mesh_normals has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, 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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bdb48d08dce125106a8bc31724dcfeaee0deaf53e84f72c920452182e2b61c"}},{"ruleId":"D2","level":"warning","message":{"text":"backward.kernel_solve_adjoint_u (cognitive 22): backward.kernel_solve_adjoint_u has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4097b293b64b55221f5907e0c816999cb174eb962b9698efb1dcaae4858e5cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"island.func_group_constraints_by_island (cognitive 22): island.func_group_constraints_by_island has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (10 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1c91ce21533a9723b406eaacdb792d504146167577a90712174456dc705b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintSolver.get_weld_constraints (cognitive 22): ConstraintSolver.get_weld_constraints has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (9 pts), 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0a4317e8f84c90750012225e86fe61279f06ea9aeb5ae4989050975b42d047"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_sim_controls (cognitive 22): ImGuiOverlayPlugin._render_sim_controls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 5 (7 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"901a603e34e7d5f0d45ce8d18e95a450b45edf736a0ba009894943472a0a7376"}},{"ruleId":"D2","level":"warning","message":{"text":"types.build_entity_joint_data (cognitive 22): types.build_entity_joint_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), ternaries 1 (4 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":"genesis/ext/pyrender/overlay/types.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda06eda69e909c4e5bb889e4ee9c52dcf368f9e0e0719ccf582a5b153bff8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer.on_close (cognitive 22): Viewer.on_close has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 6 (7 pts), 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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e3cc9a676aed4467f1ebf79160955a3e2372dbb47a1386b2d3660b8cf7b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Recorder.sync (cognitive 22): Recorder.sync has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (4 pts), loops 1 (2 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":"genesis/recorders/base_recorder.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9c2dbc16568d2529e48f50328d3cccbbd9f57470be6c8a56f6e5ea53fd0851"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.get_device (cognitive 22): misc.get_device has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 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":"genesis/utils/misc.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e7782cba27c1c001656bf67aa1f94bbab1d147621fd4a73eeb3ed6a46f704a"}},{"ruleId":"D2","level":"warning","message":{"text":"simt.qd_lane_local_get (cognitive 22): simt.qd_lane_local_get has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (6 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":"genesis/utils/simt.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ff4170407a7734101e8b2ab9c83f34452c0ac9317e05dc47284cb0cdb3f315"}},{"ruleId":"D2","level":"warning","message":{"text":"urdf.principal_axes_rot (cognitive 22): urdf.principal_axes_rot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (8 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":"genesis/utils/urdf.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8bb4e4e890b8886cc35c313a678f54c9844dbeadf3f767b4b8eb44a4c99450"}},{"ruleId":"D2","level":"warning","message":{"text":"UsdContext.replace_asset_symlinks (cognitive 22): UsdContext.replace_asset_symlinks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_context.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a833eb51a78a7b1d275d452b55adc5f711244aa742ef0fdb622f14e4adb8e0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.on_pbd (cognitive 22): RasterizerContext.on_pbd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"69afb3902372ce764b3cd2dc182293180726d4b343b12d78d597b46a18bf2cda"}},{"ruleId":"D2","level":"warning","message":{"text":"bvh._func_fit_tree_block (cognitive 21): bvh._func_fit_tree_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/bvh.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eb80bb3364487c9ce93beb94cbe2c0960b8d0fbc94959ece7ceb228fcf70b7"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridEntity.__init__ (cognitive 21): HybridEntity.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/hybrid_entity.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d1efa83721e51ee32f18207f11f002e781a6f5ba6e71e9d9f2905a17954ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidEntity.attach (cognitive 21): RigidEntity.attach has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (8 pts), ternaries 1 (4 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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22fdb9529e2d92a7f3b8b1ee7a1e074014a13a2087dab34e39c01f300e68576"}},{"ruleId":"D2","level":"warning","message":{"text":"rigid_entity.compute_forward_kinematics (cognitive 21): rigid_entity.compute_forward_kinematics has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (10 pts), loops 5 (7 pts), if/else 2 (3 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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"38174fb0a7e4593bf87b470c675de87dc64314b5e803a1a6d31ae92921050c9c"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_update_verts_for_geom (cognitive 21): forward_kinematics.func_update_verts_for_geom has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 5 (10 pts) (nesting depth added 13). 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"0174e9501271a8691b4794eeee893fc42f2be0a4de41ee9a59b4b2bab75cbfee"}},{"ruleId":"D2","level":"warning","message":{"text":"box_contact.func_plane_box_contact (cognitive 21): box_contact.func_plane_box_contact has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 1 (3 pts) (nesting depth added 15). 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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"458b12000683d54d683dd916e58423951af642bcdd592c7f67dec682e7725af7"}},{"ruleId":"D2","level":"warning","message":{"text":"broadphase.func_collision_clear (cognitive 21): broadphase.func_collision_clear has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), ternaries 1 (3 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":"genesis/engine/solvers/rigid/collider/broadphase.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd392892244fdf4079c00ed9551fa8c22e34f1b59a3e5628df6b3f56967c62"}},{"ruleId":"D2","level":"warning","message":{"text":"Collider.__init__ (cognitive 21): Collider.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts), 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, 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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f05b5b4066e120d28627174f6748663a6a79587eabc9158e2b9a053ccdde97d"}},{"ruleId":"D2","level":"warning","message":{"text":"epa.func_safe_attach_face_to_polytope (cognitive 21): epa.func_safe_attach_face_to_polytope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5f00fe99e8fa1f4f54975dd5a4e0a95a280c56724190e4a58ef1378519af7b"}},{"ruleId":"D2","level":"warning","message":{"text":"narrowphase._func_multicontact_accept (cognitive 21): narrowphase._func_multicontact_accept has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (2 pts) (nesting depth added 14). 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63da430169ba7934f71c6797d60b30e30707694a9a4fa57e6570862b3a3ec87"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver._set_dofs_info (cognitive 21): RigidSolver._set_dofs_info has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"070a04617bacb20b2459831d7e59bf99a356ff90753d4a31e67e8bc3b43927ee"}},{"ruleId":"D2","level":"warning","message":{"text":"sph_solver.func_wall_volume (cognitive 21): sph_solver.func_wall_volume has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (7 pts), boolean chains 3, ternaries 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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"886d3b940fabf1ce1aea54bb83c2d23f34d2d2db0c5edbbc0ed23c7406d4e3a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_trimesh_patch.parse_mtl (cognitive 21): _trimesh_patch.parse_mtl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 2 (6 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":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"032f3db08aade0c654fc1529ac55d6ebbe9699b1de8aa4a2aef585ba5815a2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"_trimesh_patch._parse_vertices (cognitive 21): _trimesh_patch._parse_vertices has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3121ffada337e8a93525808ce3693f0d5e09fb3ed3dc057071db1f77d7ee0bff"}},{"ruleId":"D2","level":"warning","message":{"text":"JITRenderer.set_light (cognitive 21): JITRenderer.set_light has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), 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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f7d193d63f39adefdfbe3d996056b68ad373966538ceb3f94e6daf56a00fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer._forward_pass (cognitive 21): Renderer._forward_pass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"586038cbf18f5761e18556e7d9e39dd243a81317570274b732c03698f3f73808"}},{"ruleId":"D2","level":"warning","message":{"text":"URDF._validate_graph (cognitive 21): URDF._validate_graph has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 6 (10 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3790}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6c789ad3924fe756b1933df9827db45fda91082db4d4981779228abca22664"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchTexture.from_images (cognitive 21): BatchTexture.from_images has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (4 pts) (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":"genesis/options/textures.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aaacbbd85a430305e2401b89204b9ae2fce92bc1c5cd0f77a0905675440a65"}},{"ruleId":"D2","level":"warning","message":{"text":"Trajectory.play (cognitive 21): Trajectory.play has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (7 pts), loops 2 (3 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":"genesis/recorders/trajectory.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc4e2ccc6d7f8f498de6adbcb30429a782820d4ad868ff37b41d3fad65c251"}},{"ruleId":"D2","level":"warning","message":{"text":"data.check_data (cognitive 21): data.check_data has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, 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":"genesis/utils/data.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b91cbbccf267882a2cb94648699ac18db81a81d7fff9ec8d1e377aefa79aee"}},{"ruleId":"D2","level":"warning","message":{"text":"_main.launch (cognitive 20): _main.launch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), ternaries 1 (3 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":"genesis/_main.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d239026ca0746cce9d523d396d1c8d7288a353fbd16ad8508a2490565a0ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_tower._auto_smooth (cognitive 20): generate_tower._auto_smooth has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/tower/generate_tower.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"216617fac757ac5fac4d3b2032bc52b1f77af5de5ab40abe6d7134c2fca23f85"}},{"ruleId":"D2","level":"warning","message":{"text":"FEMSolver._solve_on_host (cognitive 20): FEMSolver._solve_on_host has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8351f9cef33354d5c39025564b15ed24928415cb7ea6acddeee79da117a309"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.kernel_init_link_fields (cognitive 20): misc.kernel_init_link_fields has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b39ddb2e30d804fda1b322c205b8890cf7f0d95ea1cbc3ed705aac0b55c2bec"}},{"ruleId":"D2","level":"warning","message":{"text":"Collider._init_config (cognitive 20): Collider._init_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6 (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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0de11b43f93afa0d7f9778d63889711a2f0ff97b8abddfc33fd85e41b4338e"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_cone_head_kinks (cognitive 20): linesearch.func_cone_head_kinks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), ternaries 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dba2138305e5cbe4ae2c78f481f59a0de130f46b1d17766f6165a5a514b3b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_wrap_cone_hessian (cognitive 20): solver.func_wrap_cone_hessian has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"1133bb86e464577a803ec4e0215e551c937ec9ee545249006fabed08fd30390c"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_update_cone_free_hessian_flip (cognitive 20): solver.func_update_cone_free_hessian_flip has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18926bba119a8c830e43b348841d67814846eaa8fe36ce3573a8074192b27c3"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_solve_iter (cognitive 20): solver.func_solve_iter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (4 pts) (nesting depth added 13). 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7847429ac5b6f9dd4b0bf9616f1c234d487d9b8c194aa4063a6a0637e42d99e7"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_update_contact_force (cognitive 20): solver.func_update_contact_force has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (7 pts), boolean chains 1 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":6026}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a88c6bdace66b35c8ea9e76250ec227497f1a1b89d7a81bcbbb683b41679bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver.substep (cognitive 20): RigidSolver.substep has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"799646bf366c68fa4254e7694fab1f307e44f915fac4ada201532935292a8f83"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_visualization (cognitive 20): ImGuiOverlayPlugin._render_visualization has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3 (6 pts), boolean chains 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a279f19804f1f5e659923035aabf76f6f2b1baa8d0345be5abf35750e32d08f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene.__init__ (cognitive 20): Scene.__init__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (7 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":"genesis/ext/pyrender/scene.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b77b228c5a57febafb2e469bddc23699da83a019abf0022f8a0d2fe5d2af8f"}},{"ruleId":"D2","level":"warning","message":{"text":"kernel_writes._find_callee (cognitive 20): kernel_writes._find_callee has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/kernel_writes.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db4a28ba4a1d64912670bbeb0b25a9257e6460e692f4f8aac1f591882b84b79"}},{"ruleId":"D2","level":"warning","message":{"text":"data._opt_in_sizes (cognitive 20): data._opt_in_sizes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae76672eca7d8d5f9bf46923a5b74590bc28caa20a06aee47bad7e9f17b9f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.qd_zero_grad (cognitive 20): misc.qd_zero_grad has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 1 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"67414d8a926a746643f496d3179539fe2cd4c26e3bcb253f717296131a350d65"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization.declared_schema (cognitive 20): serialization.declared_schema has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/serialization.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28e11c21fad6f773d1bdb7ab12a01e962d15acf9022abccf18f401b84e05ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"simt.qd_lane_local_set (cognitive 20): simt.qd_lane_local_set has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (8 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":"genesis/utils/simt.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae4ae2c471fbf52dd685417238de3e155e46ab8b9b36cbbec657f3935dc3b59"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._neighbors (cognitive 20): watertighten._neighbors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/watertighten.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b39ab62609c698e3c9f28c3cd64ca6a4485a9c3e9cfc0d585fbca60788c2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._glue_manifold_corners (cognitive 20): watertighten._glue_manifold_corners has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/watertighten.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50f177ee216527b71766db45c195bb5e89b03b1fd564e9e33c942d4ba77acad"}},{"ruleId":"D2","level":"warning","message":{"text":"Visualizer.update_visual_states (cognitive 20): Visualizer.update_visual_states has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 1, ternaries 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":"genesis/vis/visualizer.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"05626332673907dc27135de505d938512047b984d98c7c4d840bcbd36739ddf8"}},{"ruleId":"D2","level":"warning","message":{"text":"List.__repr__colorized__ (cognitive 19): List.__repr__colorized__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/datatypes.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fa0c7b879a5db5ead2f812e85f5aeef72f3e9b1c2a96f5cd179e948ac4170e"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_compute_rigid_dof (cognitive 19): sap_coupler.func_compute_rigid_dof has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7508d22fd0656fab924d7684cf1aaa497c9c46ab527b7aed41e6c9ee807fe818"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_init_pcg_solve (cognitive 19): sap_coupler.func_init_pcg_solve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 3 (4 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c8f192d326cdd41cccaa8f7f263ae48f720aabd8821ef414a7875aee316fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter.emit (cognitive 19): Emitter.emit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/emitter.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded849aaa3643e1d479f1b9e7d632eeac721944a34e970466ed6d1eb5779eb28"}},{"ruleId":"D2","level":"warning","message":{"text":"kinematic_tactile._func_query_contact_depth (cognitive 19): kinematic_tactile._func_query_contact_depth has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 5, 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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1b03e6e9edafa4ef46994a06c0f0c95e7327e9e9725779df6e12df67e8e236"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicSolver._init_tree_fields (cognitive 19): KinematicSolver._init_tree_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7708a3c0d4363c20719c38cc9769d3af632dbc8cd54160d1c767c1d27d53b9b7"}},{"ruleId":"D2","level":"warning","message":{"text":"mpm_solver.func_sort_particles (cognitive 19): mpm_solver.func_sort_particles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (5 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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fbe48bd44ba1c49d2ea15a20d183b63eabcfff6eb5c750a1bb0450bc7075c6"}},{"ruleId":"D2","level":"warning","message":{"text":"box_contact.func_sphere_box_contact (cognitive 19): box_contact.func_sphere_box_contact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (9 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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8582019ffd8485e9b0c09ecc39e01dfccec3e94131d1bae6b53952f0d1011791"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_contact_group_by_normal (cognitive 19): contact.func_contact_group_by_normal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bb4f4a8282ca34dd360f7ebc1df1c52a28348a610a133b3b6662e6798d89fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintSolver.__init__ (cognitive 19): ConstraintSolver.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), loops 2 (4 pts), ternaries 4 (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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf0bd71befa666c3593f0e5ebdb66a342ef6e821f06b2759bc2d87a38c142be"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_equality_link_rows (cognitive 19): solver.func_equality_link_rows has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (8 pts), ternaries 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8497b8aadadf291194369b58548c8f586f11a20d07d8721db402733c61273b7"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver.__init__ (cognitive 19): RigidSolver.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 2 (4 pts) (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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cdb3234e11a1a983a188f77646901f5d0f20ba520a1a765d8401c02d902b49"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_joints_euler_mode (cognitive 19): ImGuiOverlayPlugin._render_joints_euler_mode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc9b5e63455ff916b1a57e8e4d791989ca119dd79d66d8bf75babf727feef25"}},{"ruleId":"D2","level":"warning","message":{"text":"CSVFileWriter.process (cognitive 19): CSVFileWriter.process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 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":"genesis/recorders/file_writers.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a8b13aaab568b3e208fb1d8b6136457d719143d217340d55afe6db731b09d8"}},{"ruleId":"D2","level":"warning","message":{"text":"TrajectoryFileWriter.cleanup (cognitive 19): TrajectoryFileWriter.cleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"genesis/recorders/trajectory.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f774345809f0b89bbab9a6de81564378ad316abf6ee47dc25787572ade470a"}},{"ruleId":"D2","level":"warning","message":{"text":"hybrid.reduce_graph (cognitive 19): hybrid.reduce_graph has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/hybrid.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a639e287a9b2c6ec088ff9ad997ce95f75915a549d2f20fa62752331f2f87b"}},{"ruleId":"D2","level":"warning","message":{"text":"mesh.surface_uvs_to_trimesh_visual (cognitive 19): mesh.surface_uvs_to_trimesh_visual has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (3 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":"genesis/utils/mesh.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"27626b892e8b4332820b52f93921bbc0e8f2d5be85674c73fcaff0c832bd38d2"}},{"ruleId":"D2","level":"warning","message":{"text":"mjcf.parse_xml (cognitive 19): mjcf.parse_xml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, ternaries 2 (3 pts), 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":"genesis/utils/mjcf.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"00792ffe87fcf6aa467b5e79d4938fcfedbfa8379a2ffb5c6c142d7bd02e3004"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchRenderer.render (cognitive 19): BatchRenderer.render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/batch_renderer.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"628335f96c12347b1731c66c0c73249b1b2813a707807cec72bcc1682378596a"}},{"ruleId":"D2","level":"warning","message":{"text":"Camera.update_following (cognitive 19): Camera.update_following has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, loops 1, ternaries 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":"genesis/vis/camera.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4b2e76dfe77635953da9fcfbccf0602446e62c94acf5ce22df31367094b645"}},{"ruleId":"D2","level":"warning","message":{"text":"Rasterizer.render_camera (cognitive 19): Rasterizer.render_camera has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, ternaries 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":"genesis/vis/rasterizer.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cad732474518a287788287fb06041d02062d27727bb747724b24bf4e13d6c83"}},{"ruleId":"D2","level":"warning","message":{"text":"Visualizer.__init__ (cognitive 19): Visualizer.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/visualizer.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bca4e570a88b8eac90841ae86737da0c19ea6d11bbabd36ce2c3850cda13f8"}},{"ruleId":"D2","level":"warning","message":{"text":"IPCCoupler._post_advance_external_articulation (cognitive 18): IPCCoupler._post_advance_external_articulation has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), ternaries 1 (2 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a62bbd4e5ba3738a5ac9373272566ddf08bb7df421aa45f197fb5a3234e16a"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_init_unconstrained_gradient (cognitive 18): sap_coupler.func_init_unconstrained_gradient has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3774}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b7848366fd62374bba28a15a9da63d804d2d7b215a411f469d783382d73bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_compute_fem_vertex (cognitive 18): sap_coupler.func_compute_fem_vertex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4173}}}],"partialFingerprints":{"codehealthFindingId/v1":"01645b6b099119eeac7094117cc1f3626e7620700b02110a3166a7d27bde8859"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicEntityDescription.resolve (cognitive 18): KinematicEntityDescription.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, 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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffb1964558dfafb44eb2a87aacbe3ab33330a3582a825b15e61b78c3384c0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"point_cloud_tactile._kernel_elastomer_dilate_accumulate (cognitive 18): point_cloud_tactile._kernel_elastomer_dilate_accumulate has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7827c52ab0c837cbd9e5b6f23f4024a827060b03b4d8a457afebbc5b6320439d"}},{"ruleId":"D2","level":"warning","message":{"text":"SensorManager.read_sensors (cognitive 18): SensorManager.read_sensors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (6 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":"genesis/engine/sensors/sensor_manager.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c87fe2d624fad11307f5a90da6435577f196ef6709592b77e6ebc759a0a4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"temperature._qd_polygon_area_from_points_3d (cognitive 18): temperature._qd_polygon_area_from_points_3d has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/temperature.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3561eeeec252ca4d29c981565c433a6f71b2e70371681f117d751fc918db73b5"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_end_newton (cognitive 18): fem_solver.func_end_newton has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), ternaries 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"7723236734937a68c22d26703e4b42e6ba4df941c7f78b97903252b456bb8a78"}},{"ruleId":"D2","level":"warning","message":{"text":"KinematicSolver.set_qpos (cognitive 18): KinematicSolver.set_qpos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (2 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec2c21aa023b9a044077e5ffb80b2cd6efbc07ecb41586033ea92a481f8bab0"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_compute_mass_matrix_and_link_force (cognitive 18): forward_dynamics.func_compute_mass_matrix_and_link_force has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 5 (7 pts), boolean chains 2 (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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6016826bca2293489b5d5f6e2a46a475266fb01a7e1adcd6ea125c4c8f6725a5"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_forward_velocity (cognitive 18): forward_kinematics.func_forward_velocity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"211da18c5b8933b7b211296b2e66e756e94fce14c09c54a36e933f79748ffd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_contact_is_before (cognitive 18): contact.func_contact_is_before has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5b0bce07f2f865ba07abb8a78a1580d7406f95ec375e66b984f1ad81e1b040"}},{"ruleId":"D2","level":"warning","message":{"text":"epa.func_epa_init_polytope_2d (cognitive 18): epa.func_epa_init_polytope_2d has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (6 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"467e3e45094b0054c0c7ae4019d2b4d5dc2e1e1f9395f88ef13689d036685807"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.kernel_get_equality_constraints (cognitive 18): solver.kernel_get_equality_constraints has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (8 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d53609830fe453bdc0a5b831afab618c7be2547bdd3e8b5eaa5b0ef7963445b"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_rank_batch_update_island (cognitive 18): solver.func_rank_batch_update_island has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85044d8a6c6eefc5e27c23483c29ed9f5cbd5efcfdef26896d5453047975237"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_factor_island_incremental_batch (cognitive 18): solver.func_factor_island_incremental_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c0b68f39cca1ea1fe511aa7ab6e2cfc5308fcbc87a6c3468528c44d6928e10"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._func_update_cost_coop (cognitive 18): solver._func_update_cost_coop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5361}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c7f1921438646640f9c9d396f0fb83e57d827afdc42bc724a629443a716fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._initialize_Jaref_parallel (cognitive 18): solver._initialize_Jaref_parallel has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2308994b5ca8cb0f7808f482b24ead846c361c517d0c42898a80018deffa582f"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer._normal_pass (cognitive 18): Renderer._normal_pass has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d992389a98910b95dabadd4a5f54dc546c5c88251ab1b225b00bd702666dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Joint.get_child_pose (cognitive 18): Joint.get_child_pose has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72463c621165242f9e3bd5ca941fc5e968403c2495a2fb4b766471c2bedca1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Link.collision_mesh (cognitive 18): Link.collision_mesh has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03c38f86d73bec1758d8d930096886413584c6b7819470a4ec2c67916c3bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"raycaster._generate_uniform_angles (cognitive 18): raycaster._generate_uniform_angles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (4 pts), loops 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":"genesis/options/sensors/raycaster.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97dcf467b71e5fc6a836cd0aed26309592749fb7a399acaec1d06ad538bb178"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.update_fem (cognitive 18): RasterizerContext.update_fem has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4de08aa55e2348e476ce6caa95868e9083858f6110cfacca4b63dacc70d0362"}},{"ruleId":"D2","level":"warning","message":{"text":"Raytracer.add_surface (cognitive 18): Raytracer.add_surface has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 3 (5 pts) (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":"genesis/vis/raytracer.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f2147d4c18dcba023dfc045a6ead505bac725207a54b87a3b135068cff1bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"sap_coupler.func_clip_polygon_by_tet (cognitive 17): sap_coupler.func_clip_polygon_by_tet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b359a4d3dec2c3931d8551e963a7031e1f873e0a0b59acc2c8a69c85279e9a99"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh.__init__ (cognitive 17): Mesh.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 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":"genesis/engine/mesh.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee88091417aa818dbf6478c0090c7492344dc17d0568b37e4cc41ddc26048ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeSensorMixin.build (cognitive 17): ProbeSensorMixin.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (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":"genesis/engine/sensors/probe.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded837486fdbce5d5f4dda4c3b46ddcaa8593ef73da39d1e7962760c79903bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_init_linesearch (cognitive 17): fem_solver.func_init_linesearch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), ternaries 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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"acab980f54bbd074169d3cf059c957a9b50e3ecb91433befc0a375e83d8ebc92"}},{"ruleId":"D2","level":"warning","message":{"text":"kinematic_solver._fill_base_link_geom_offsets (cognitive 17): kinematic_solver._fill_base_link_geom_offsets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (3 pts), boolean chains 1, 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e175dde5ff47c5a4ce881145367303152d99929b1f12df44e320945c28eab75"}},{"ruleId":"D2","level":"warning","message":{"text":"diff.func_copy_next_to_curr (cognitive 17): diff.func_copy_next_to_curr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"genesis/engine/solvers/rigid/abd/diff.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"071da25e75fbda98bb40dce40bf00ef32e329ea5107320c1ec0f56055df1ebc6"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_update_acc (cognitive 17): forward_dynamics.func_update_acc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), ternaries 1 (4 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5907a1a8d2b38785044d01d44b3cfab66fe9632bf5b11adade66fc3f502ad41"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_COM_root (cognitive 17): forward_kinematics.func_COM_root has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), loops 2 (4 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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f84dff992fe21b1ae8c8c190a23bca6e502f5d1dbdef61d965a3a82092cf073"}},{"ruleId":"D2","level":"warning","message":{"text":"island.func_sort_contacts_coop (cognitive 17): island.func_sort_contacts_coop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (4 pts), boolean chains 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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1358cd7355170e94f513c3ba76b79ecb205f4261726a34dc7463a07efe60ec"}},{"ruleId":"D2","level":"warning","message":{"text":"linesearch.func_mv_jv_islands (cognitive 17): linesearch.func_mv_jv_islands has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4ba160dead7c196ae3782d8357f9ad4d1a3390261dc9991972f8dc7cff5c06"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._func_disc_middle (cognitive 17): solver._func_disc_middle has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (13 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"05052da4bb3a8d57cd5073fb262997173398de0dc8aaf7387eb757235c9c8570"}},{"ruleId":"D2","level":"warning","message":{"text":"solver._func_cone_block_chol (cognitive 17): solver._func_cone_block_chol has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (5 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb55700d273ae1fa82a79d9f87d63b82e0608fbba46c4f47281c1e586388cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidSolver.set_qpos (cognitive 17): RigidSolver.set_qpos has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (2 pts), boolean chains 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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3b0c369fad60e5b20494752bf715a08da026f1c365513e16b01e245ec8da66"}},{"ruleId":"D2","level":"warning","message":{"text":"JITRenderer.update (cognitive 17): JITRenderer.update has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6e760107fb67c1baf4085540696a44a97d8f236b2e643d0b29f83c6a95c40d"}},{"ruleId":"D2","level":"warning","message":{"text":"EGLPlatform.init_context (cognitive 17): EGLPlatform.init_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 1 (2 pts), 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":"genesis/ext/pyrender/platforms/egl.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab8cb144fb7ab31648a77f5a2b11ebf1373fe29d0be5354da0ac75b0105768"}},{"ruleId":"D2","level":"warning","message":{"text":"URDF.__init__ (cognitive 17): URDF.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 6 (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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"af59b7d79c5ad618386f1fbb08371ddc0c5e3c0139f3dd640488f339f5632a87"}},{"ruleId":"D2","level":"warning","message":{"text":"LinePlotHelper.__init__ (cognitive 17): LinePlotHelper.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (6 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/recorders/plotters.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45cc12924a2b535b7c2851ea3a6d5ba684be0a623e7c8bada05fe329b0cc319"}},{"ruleId":"D2","level":"warning","message":{"text":"particle._interpolate_sdf (cognitive 17): particle._interpolate_sdf has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (9 pts), loops 3 (6 pts), boolean chains 1, if/else 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":"genesis/utils/particle.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec42a48083ccd8c041511fed4c4575fc4c58753ee3a8f504e03d60fafeba07de"}},{"ruleId":"D2","level":"warning","message":{"text":"terrain.convert_heightfield_to_watertight_trimesh (cognitive 17): terrain.convert_heightfield_to_watertight_trimesh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 7 (8 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/terrain.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e7a20fec03e58722a903827357ef553d37258c0f57624729af5734695aff35"}},{"ruleId":"D2","level":"warning","message":{"text":"usd_rigid_entity._compute_joint_prim_paths (cognitive 17): usd_rigid_entity._compute_joint_prim_paths has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 4, if/else 3 (4 pts), 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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0f42eca654323c2004071e9a8c8319ec181d5cc62c0ef02de5041d0036ec5d"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoEncoder.close (cognitive 17): VideoEncoder.close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (5 pts), error handling 1 (3 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":"genesis/utils/video_encoder.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f6ec68018136e50b49cf4fcd0993b111f575693f2c840b19158d598b00e82"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.on_mpm (cognitive 17): RasterizerContext.on_mpm has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (RasterizerContext.on_sph) 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"059b50e73e936d3c47adc269f797457d2c54de4626d6573a4ea5ed777932eb8a"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.update_mpm (cognitive 17): RasterizerContext.update_mpm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (8 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. This shape REPEATS in the file: one other method here (RasterizerContext.update_sph) 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b9c67374e04b6245b2c024d8be692b7a48dcb78e6f6f190db944d583603056"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.on_sph (cognitive 17): RasterizerContext.on_sph has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (RasterizerContext.on_mpm) 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff833ac751a878ea9baca1b3f958e2779602cf05c3ff102b008f877eb49988"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.update_sph (cognitive 17): RasterizerContext.update_sph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (8 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. This shape REPEATS in the file: one other method here (RasterizerContext.update_mpm) 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cf8508ccda232ef4cebc1ad564764a06ff6442d4ae16ef1c3c7735d9c70ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterizerContext.on_fem (cognitive 17): RasterizerContext.on_fem has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"218838f582eef260808013d6733008ed2cf27a8c876a92585f4f92e00efba8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"IPCCoupler._pre_advance_external_articulation (cognitive 16): IPCCoupler._pre_advance_external_articulation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a12442a75ccdd99b4e030edf97423d0b8b3423a60b5a462cebac13ee8942e15"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidFloorContactHandler.detection (cognitive 16): RigidFloorContactHandler.detection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6854}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71b6d5b309a75b4329d7f93c1d6b1e1926581bf542d708a308030aaaf9b41a"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidEntity.get_contacts (cognitive 16): RigidEntity.get_contacts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, 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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":3014}}}],"partialFingerprints":{"codehealthFindingId/v1":"f497fe5549202c2038619036c5a4235d7d8da60f213695acb81f993bc1041772"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene._reject_unexportable (cognitive 16): Scene._reject_unexportable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 2 (6 pts), boolean chains 2, 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":"genesis/engine/scene.py"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"2412733dcaf388280d462ea77c7b7d7b64c4eac78dc38f4a60bc7f9c1a0b6533"}},{"ruleId":"D2","level":"warning","message":{"text":"ProximityPoints.visit_leaf (cognitive 16): ProximityPoints.visit_leaf has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (8 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ec53fc2494fb494528458b716a06e142b32cc578da17be5008969eb03e7e36"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrnoMixin.check_errno (cognitive 16): ErrnoMixin.check_errno has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 1 (3 pts), 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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"31556edb1f00d213e46e7447be6c553ca97f5ad8beda40889ee9519e8fcacdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"fem_solver.func_pcg_solve_per_env_block (cognitive 16): fem_solver.func_pcg_solve_per_env_block has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cdc5e3d6e0e798533d6e047bf72f645f8eca316f315b679705c17d52214d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"mpm_solver.kernel_transfer_grid_to_particles_grad (cognitive 16): mpm_solver.kernel_transfer_grid_to_particles_grad has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"703218e3a8b600f0d8dae78f7b4f55354badd9962abcaae1b863033194521b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"pbd_solver.kernel_solve_viscosity (cognitive 16): pbd_solver.kernel_solve_viscosity has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ed6960825685f6f2499a81bae53638095ad2ec124e4f96f189ef3ed88ef46e"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_dynamics.func_compute_qacc (cognitive 16): forward_dynamics.func_compute_qacc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), ternaries 1 (3 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b935ed6f21fc342bacf3b7191350562a3ee280002956c8a5486cd419b58cd60b"}},{"ruleId":"D2","level":"warning","message":{"text":"forward_kinematics.func_COM_link (cognitive 16): forward_kinematics.func_COM_link has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c536a301ac142ef4ddac3eebcac1744b355bf2a968178a944a5eabddad77c190"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.func_apply_link_external_wrench (cognitive 16): misc.func_apply_link_external_wrench has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24d0822957a1e7bf842aa71095ab49146a170555af7177dcf30cebd442c1ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"contact.func_contact_patch_end_coop (cognitive 16): contact.func_contact_patch_end_coop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 2, 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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd37315037875cfea058bcb6cc81c984458150c07ebf66fc3a33d3402560869"}},{"ruleId":"D2","level":"warning","message":{"text":"noslip.func_noslip (cognitive 16): noslip.func_noslip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1, ternaries 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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0492adcd03ee809f92c447c1970be31ce05e8e3340be8e7f9647d24ba6eb2f47"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.func_qfrc_scatter_sparse (cognitive 16): solver.func_qfrc_scatter_sparse has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (5 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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5099}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5774c295ade5887ccfcbb966b2cb57de2fe1f554adec9a98d826c06ac928c2"}},{"ruleId":"D2","level":"warning","message":{"text":"sph_solver.func_segment_dist (cognitive 16): sph_solver.func_segment_dist has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (12 pts), loops 1 (2 pts), boolean chains 1, if/else 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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd92b727939e7bcb73ad55835424c56679810de07623d915f4d099f87d0bd412"}},{"ruleId":"D2","level":"warning","message":{"text":"sph_solver.func_update_convergence (cognitive 16): sph_solver.func_update_convergence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, 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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61342436f5de82643fca62071b03e7046d18e9671f5797b3ed8e6574bd73a83"}},{"ruleId":"D2","level":"warning","message":{"text":"ImGuiOverlayPlugin._render_control_panel (cognitive 16): ImGuiOverlayPlugin._render_control_panel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), ternaries 1 (3 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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e06a77ec553f5e0b170726f627c06db4191b3688bb0aa5cc7937496e329871"}},{"ruleId":"D2","level":"warning","message":{"text":"Texture._add_to_context (cognitive 16): Texture._add_to_context has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 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":"genesis/ext/pyrender/texture.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"957d4da794cd70f6c735a3708a856ebde2722a5f71e5419face54b7336f3fcc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer._setup_main_camera (cognitive 16): Viewer._setup_main_camera has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2787d1019540b4726e7081bdeb469b927b0aa7b0c35689fb3730101042bdc4e8"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLVectorFieldPlotter.build (cognitive 16): MPLVectorFieldPlotter.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), loops 3 (5 pts), ternaries 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/recorders/plotters.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d02b33c5222c945089896f37b1d3a6c746055a1d544658b98ddea7b37e5e26"}},{"ruleId":"D2","level":"warning","message":{"text":"repr_base.get_public_name (cognitive 16): repr_base.get_public_name has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (4 pts), error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/repr_base.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c590b4989bbfa8c71f1cc78ef57e402a9ac820770d494be1e6d147d605ffc1f"}},{"ruleId":"D2","level":"warning","message":{"text":"data._by_path (cognitive 16): data._by_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), ternaries 1 (3 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":"genesis/utils/data.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"610c88390593e4b2df472af52865a3a7a3ac3b09ec509b80e1a765a2d6f2181c"}},{"ruleId":"D2","level":"warning","message":{"text":"mesh.create_box (cognitive 16): mesh.create_box has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (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":"genesis/utils/mesh.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b913ac51cf46f99ed228229e0b5c8468124b7c8277c8f7d1fd5a3c0a2de7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"PathPlanner.interpolate_path (cognitive 16): PathPlanner.interpolate_path has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 1 (2 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":"genesis/utils/path_planning.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8701bfbb621c4ade757f8e363ebfa62969a84df6aa4f1581c32b24b10bfeb1b9"}},{"ruleId":"D2","level":"warning","message":{"text":"watertighten._extract_dual_contour_mesh (cognitive 16): watertighten._extract_dual_contour_mesh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/watertighten.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56b11bbc849b0ab1efc8e8645d513b7e12fa925d38ba8c93fe909f41b4e268f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: couplers/sap_coupler.py: FileTooLong \u2014 5736 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5236 over it, 11.47\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8805506ad84a4d13cab6021bbc91138814d9e8ed08e26f2eb08bd6c6d6f74354"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraint/solver.py: FileTooLong \u2014 4408 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3908 over it, 8.82\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32381c7a9bb82de552894d8aeec54d3e8d3ce2fc4edfbd210a7023298b90c96f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/narrowphase.py: FileTooLong \u2014 3984 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3484 over it, 7.97\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7d0fae1e5b2d2a7ada42360b19028232883ec5167981a6d42362c0cbd9926"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rigid/rigid_solver.py: FileTooLong \u2014 2377 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1877 over it, 4.75\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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f9ce3bb1e3c93ccb1fbd97975086a06f18ba4b75c65c5971f9491ed516261b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solvers/fem_solver.py: FileTooLong \u2014 2304 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1804 over it, 4.61\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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f1c4b974330a2023f3601b8e9f7ae289fa16663979bbb10b530ca717d2e37b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: urdfpy/urdf.py: FileTooLong \u2014 2111 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1611 over it, 4.22\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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17bff22cf9220629f65d197dc16f07e9028dbbb966ee39c6eb790ea27df29a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: couplers/legacy_coupler.py: FileTooLong \u2014 2056 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1556 over it, 4.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c933b9b202792997d97da2433997f0d56cc3215c4e77e5ccaabed0a76b1a58af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RigidSolver: TooManyMethods \u2014 115 methods. The bar is 30 methods; this is 85 over it, 3.83\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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50286aa8092268afb0d560800c9a714620986bcc10ad3c660409d549f6128ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abd/forward_dynamics.py: FileTooLong \u2014 1760 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1260 over it, 3.52\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5527f8f1b19789ca092c52c84a9f74f7e85c528bad3284669858f6d7d0f6117f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/geom.py: FileTooLong \u2014 1689 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1189 over it, 3.38\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":"genesis/utils/geom.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c55d3c0bff592d6b54697829e22b6a022b258f62806ec38a11361cfc442443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sensors/point_cloud_tactile.py: FileTooLong \u2014 1527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1027 over it, 3.05\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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87501b65632326f0e162846bfdc01065c034615abb9ee21b1615fca0f2237a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rigid_entity/rigid_entity.py: FileTooLong \u2014 1470 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 970 over it, 2.94\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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf158e21c0b56e66eab595006d475475220a4d00358ea2800dc991dec323a69c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/contact.py: FileTooLong \u2014 1389 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 889 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef87354f232b576046030a2a2ce315ef6d7b7fe5ac8d514039d7cdd10c6669f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rigid_entity/description.py: FileTooLong \u2014 1316 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 816 over it, 2.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8982c3d931220dd478e68ca9da68fb9fb8f24f146033d3949f7e8d832eb6c4c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraint/linesearch.py: FileTooLong \u2014 1297 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 797 over it, 2.59\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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6d48956703fdc0f7e9b2c5529d5c0749155653f6f19168552743c9a69ac2ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RigidEntity: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0f9a73849dabf59c84be087ff5ee90553610a1f92fe788a7807bcffda23a5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pyrender/jit_render.py: FileTooLong \u2014 1195 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 695 over it, 2.39\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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f920ffbd54bf2c9e858a656c5e8dec2c864a6f1525ca604b86a9f8b2c8fbf27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solvers/mpm_solver.py: FileTooLong \u2014 1158 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 658 over it, 2.32\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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57dd0a23bed2deea3276c7053856ccb8e4edf89a69a3cb45dcd25dad20e73da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/misc.py: FileTooLong \u2014 1156 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 656 over it, 2.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":"genesis/utils/misc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bc9aad3a686c35ed3ab24119a43d86402e0c4a16a68b54445a14906dcf5289"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RasterizerContext: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/rasterizer_context.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0317d8535c2fe70a36061fe0ca3d6f0a809b6374aa2ad4a8452b4ca4020eafe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solvers/kinematic_solver.py: FileTooLong \u2014 1131 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 631 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc9574ff5345f73e89faec007fda401c4e559e9e657779e17fe0dd9ea108acd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/mesh.py: FileTooLong \u2014 1125 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 625 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/mesh.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eceec37cba346fc87482774de8754ed4eceb0f495e652518848bff14a34397"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/gjk.py: FileTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 620 over it, 2.24\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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b902a20d3c7b45c81efd7b4adf855adf67b2c2a9209d178197bfc5332ad0c0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scene: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/scene.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83520ed7ba17484c06e0732e6273b18b586914f69243323f1d3c37f7ba46d4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/collider.py: FileTooLong \u2014 1059 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 559 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b350c686ba619070049c4e0a9b238736203a4d476a7cdf55cf4edd2e6f9e8d29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vis/rasterizer_context.py: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 526 over it, 2.05\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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a81a31bf8b9d26ec1dc58ea75809d6f07c7dea051e440047ada3b531201e04d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abd/forward_kinematics.py: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 448 over it, 1.90\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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"135ecfe75fa9639520de4e02d630ab552f075e872615f5838538a4fdeb4da560"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pyrender/viewer.py: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 448 over it, 1.90\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":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25bf71ae20779772c799d2dd1fcb211aac02334f75e427ced39e555d590ee14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/epa.py: FileTooLong \u2014 946 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 446 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498c32b6d9ecd609aaa4b824f9f013003dd1f1bf96875f4aff021ec7b0524e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solvers/sph_solver.py: FileTooLong \u2014 936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 436 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0ea141f71b3acf1bcb4e547b0a0289dafa1eda7d1f7b076174eb6aad713ed2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/scene.py: FileTooLong \u2014 912 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 412 over it, 1.82\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":"genesis/engine/scene.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9120c0cee040f4c364b69bbbd6d9e726830fbc7ebc76725329c26726247f1a46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abd/accessor.py: FileTooLong \u2014 911 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 411 over it, 1.82\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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b214544bf2f4ba88a37574b74b097591fc652809aa8803da08ba299deb01be4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/watertighten.py: FileTooLong \u2014 894 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 394 over it, 1.79\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":"genesis/utils/watertighten.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d2dcb5cc5aac1f4abed2685403285d6714e94f49e6c716342ce945449aea6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: recorders/trajectory.py: FileTooLong \u2014 878 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 378 over it, 1.76\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":"genesis/recorders/trajectory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5c055ab501c059ec823671c5124cf1d075128ec6ce85b9a10a1ee613f78a1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sensors/kinematic_tactile.py: FileTooLong \u2014 869 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 369 over it, 1.74\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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1addc48e2b20ba92cdd542bfb1e681658bc5b1b38be60a9e9e50fc1d1c5baad7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/path_planning.py: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 368 over it, 1.74\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":"genesis/utils/path_planning.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dfe9c0c5b1efc3ca5b23e99826c656c77853aa8bb00632545f74ade7b7ae89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overlay/plugin.py: FileTooLong \u2014 852 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 352 over it, 1.70\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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78a81d245e1983935babf15c1593ecee6d23ac73c5daca20a9ea6ae4990c256"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solvers/pbd_solver.py: FileTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 317 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31560b73a6f5cb2a93f77cade46ed2ab36072b204440e896d8cd3987093bf46b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abd/misc.py: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 302 over it, 1.60\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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5102eea4d4c63211ffd92018fa4d377d69063970e045b74b85f18fce7c4c07b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KinematicSolver: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaa7ea11829bfaba2cef55a1b07d2ff2d24ba27d352ed997740c1540c2d236f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ipc_coupler/coupler.py: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 over it, 1.54\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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b84423c0b2dc9e6c55491411d4314a31d3f5cbcb5d04802c56c90186f3d772c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Viewer: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb123527486b46458316cac7b5ee75714ca9c957410f5c79c64a128ddb9f514"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraint/island.py: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51\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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fc8f7c7ed9ab38fd801802a36c2c0e127bb8680911fe44a2c62894abb463ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/multi_contact.py: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 216 over it, 1.43\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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71518055effba8f170c449507a616016d1e7bd69edefa2478b34215f0c1a64df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pyrender/renderer.py: FileTooLong \u2014 704 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 204 over it, 1.41\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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ae4d18245d428672965f2777ff9b66cc49dfb04ea92f5751461e5803cff8fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/particle.py: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.41\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":"genesis/utils/particle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b600037c0f742da7cef0e10838ffb12a03a4c28606664c62b79497a9be668e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sensors/temperature.py: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 194 over it, 1.39\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":"genesis/engine/sensors/temperature.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4233b4aa646b3c06213e3ad7e6cc3625e1d38dcb1c65bd860d2fcd6639471f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/mesh.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":"genesis/engine/mesh.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79353f708221d485812a27d23d5f48a2bf9a1196f7d4e729c75eb9913234be52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abd/inverse_kinematics.py: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 170 over it, 1.34\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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01566a1c34ed31070298af7f39a206aac41830e2493f752be133222b598e2bbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/bvh.py: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 144 over it, 1.29\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":"genesis/engine/bvh.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b369da62e870d6bc483406d5a09c08e18b697ccc1e0937ceb682e8a4981d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/box_contact.py: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27\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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df95753f47c75b6f6bcb4848d55bcc6af837cd8a5c18e79552641bd06cd944a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/diff_gjk.py: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27\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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"285d58cfdde4021c318bb0c75851ebca15571977caffda1b635f6b4dc768126e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/data.py: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 136 over it, 1.27\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":"genesis/utils/data.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"724278546d706d85b98240f11cab408d363ab9d50dd3c0dc9901620e97c2a02d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vis/camera.py: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\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":"genesis/vis/camera.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6002269b0752889ae21cae99a70b1fdd606d69815edb28c916543059e824c277"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constraint/backward.py: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237db27b318963004539ebd8f970577db86f99a93ed27544c6d3a26ac230564e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KinematicEntity: 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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b163914c039cc5864068feefe46bef6ffc61ede26d12c34b370dc26803c252f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vis/raytracer.py: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\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":"genesis/vis/raytracer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1231feeb14676e441f1f05556e73e0925a8add4f21baf7922d175531726f81f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: recorders/plotters.py: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 105 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":"genesis/recorders/plotters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aefa78799ea9cdba401ba83b371b0c907ef31a9fdf4d47f265c3911ddd6383c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solvers/base_solver.py: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ecb20a6494e7db9fe0d218f4de7635781242896cf8035e9f081373596e5905"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/raycast_qd.py: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18\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":"genesis/utils/raycast_qd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62fbc702eae3290745cc24daec80ac0f6587ceea320bbf0cadd5e4c5cec408b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/mjcf.py: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18\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":"genesis/utils/mjcf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41871989249f24a313bc3c9cea29501c52ec8cceef9faff8444592e0a6a1835"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collider/mpr.py: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 77 over it, 1.15\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":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63b718ac7077604a387775072d96d1fdc6ec5a2d6a97937aac9c8ad786166e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Renderer: 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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edbac082b1b87c937bb3949620049cff029be5c38016955012d0858303c5401"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: usd/usd_rigid_entity.py: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7810e93174bae602b63bdae2dce22573101a437e1d500c116a6685d1d3b9da9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sensors/camera.py: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/camera.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1708747d7781267ecbdd23d3f2f69ebee6105b8e56bde9758041b680eb791a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/simulator.py: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 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":"genesis/engine/simulator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d47ec15518d62c8594647e9943a7ae314d6b00e27e9b356d4c3b6a92cb3bb88"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (96 shared lines): genesis/engine/solvers/rigid/collider/narrowphase.py:2801-3284 | genesis/engine/solvers/rigid/collider/narrowphase.py:4241-4476 \u2014 These two members are variants of one another: 96 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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc57d286b1bb84ae023c824498e1dd3f1dfefb959a3b2f4e6466244c2ea1d608"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (84 shared lines): genesis/utils/path_planning.py:527-662 | genesis/utils/path_planning.py:909-1062 \u2014 These two members are variants of one another: 84 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":"genesis/utils/path_planning.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a30b0fabf86be64331099b322a313bf16d253ed0442233ccac441c25b138f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): genesis/engine/solvers/rigid/rigid_solver.py:1757-1874 | genesis/engine/solvers/rigid/rigid_solver.py:1881-2008 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ad6081d8fbde39f4e73df860a7595f32f08af70a0ad38a7cb0ef61fb4f9909"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): genesis/engine/solvers/rigid/collider/diff_gjk.py:382-571 | genesis/engine/solvers/rigid/collider/epa.py:967-1202 \u2014 These two members are variants of one another: 62 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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36e6c7266936b82c1c7e4d657ed7ba887a0244353bf9bafbcf23815ef5f0d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): genesis/utils/path_planning.py:389-464 | genesis/utils/path_planning.py:738-829 \u2014 These two members are variants of one another: 62 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":"genesis/utils/path_planning.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc054c2f07200425bd6ea105ca3b7a3db98ebffeef519ecfe5d1364ab8cc4723"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): genesis/engine/solvers/rigid/constraint/linesearch.py:765-889 | genesis/engine/solvers/rigid/constraint/linesearch.py:957-1088 \u2014 These two members are variants of one another: 54 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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f802d7782a86a25d8f7d7a7a6aadd4cda1b80a91f7eb2bd7420b2f84f5f821b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1030-1084 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1096-1142 \u2014 These two members are variants of one another: 25 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"d691316d4bebaffa4e3b15ecec041669fbdf38a2b17a6f4b0f9555d2bdaa751c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): genesis/utils/particle.py:160-270 | genesis/utils/particle.py:773-847 \u2014 These two members are variants of one another: 23 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":"genesis/utils/particle.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00a32e5cbbf9dedf910dafb97601f9beb3759e5d33191cc7f74ee7a4fded094"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): genesis/utils/tools.py:78-110 | genesis/utils/tools.py:113-146 \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":"genesis/utils/tools.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb9c7893312702eca9d048ee042e8d5e21daf4674128125c3599b636069efcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): genesis/engine/entities/rigid_entity/rigid_entity.py:782-814 | genesis/engine/entities/rigid_entity/rigid_link.py:178-199 \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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8e78645fc464c8eef918cbd3c2dfa144702b56fb71b388f0fae1257b95a99d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1155-1195 | genesis/engine/solvers/rigid/constraint/noslip.py:12-47 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c895a70abc604a01fd59d6955dac86a1db56cabacc00d4d25e156f4793f5031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): genesis/engine/solvers/rigid/abd/misc.py:822-838 | genesis/engine/solvers/rigid/abd/misc.py:853-862 \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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"4989298650a95c1ebe8a9b9c4b94b4e576672028507354406a7c43d18ef9e30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): genesis/utils/path_planning.py:362-377 | genesis/utils/path_planning.py:708-724 \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":"genesis/utils/path_planning.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aa35740f8eb19f2715e68cec1584d701ba966abec9781301fc43727018fbb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): genesis/engine/sensors/kinematic_tactile.py:755-766 | genesis/engine/sensors/kinematic_tactile.py:993-1025 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d4d4de6523615429f68596dc17a2b49577c12e22c671639c6e6ee0d2ff983a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): genesis/engine/solvers/rigid/abd/forward_kinematics.py:356-394 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:908-947 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1206-1270 | genesis/engine/solvers/rigid/abd/manual_bw.py:237-261 | genesis/engine/solvers/rigid/abd/manual_bw.py:411-430 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4863b6118b756dec0168146c93f6d306993f0f2130d488973d1228e16693ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): genesis/engine/solvers/rigid/constraint/backward.py:422-609 | genesis/engine/solvers/rigid/constraint/backward.py:758-1443 | genesis/engine/solvers/rigid/constraint/solver.py:797-955 | genesis/engine/solvers/rigid/constraint/solver.py:1012-1176 | genesis/engine/solvers/rigid/constraint/solver.py:1885-1937 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ac6b275d2c66a5054d067b86c0189bfdcceaff67a65d842bf11c0cfaf1cbb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/engine/couplers/sap_coupler.py:6438-6595 | genesis/engine/couplers/sap_coupler.py:6873-6915 | genesis/engine/couplers/sap_coupler.py:6989-7124 | genesis/engine/couplers/sap_coupler.py:7323-7484 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13de5f681dc910def3b7a995ee0ef8570e9e41220ed56d9a08e2a6acd2c7696"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/engine/entities/rigid_entity/rigid_entity.py:2616-2634 | genesis/engine/entities/rigid_entity/rigid_entity.py:2638-2656 | genesis/engine/entities/rigid_entity/rigid_entity.py:2660-2679 | genesis/engine/entities/rigid_entity/rigid_entity.py:2683-2703 \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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9611afda3aa1cc1c18933412d12192f8e9524d2dbfcbca0e3a1111be5dfc6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/engine/sensors/camera.py:101-114 | genesis/engine/sensors/camera.py:283-305 | genesis/engine/sensors/camera.py:518-535 | genesis/engine/sensors/camera.py:583-665 \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":"genesis/engine/sensors/camera.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5e8c65f0416b2b733b3f8e29fc07d48f0d11e26e801cc5edf7b640a8db0051"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/engine/sensors/kinematic_tactile.py:323-428 | genesis/engine/sensors/kinematic_tactile.py:450-496 | genesis/engine/sensors/kinematic_tactile.py:555-594 | genesis/engine/sensors/kinematic_tactile.py:622-701 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"677a1b9eaff20772533ecc29a06189a9c7010d01de6660676d51ba0878b7a02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/engine/solvers/rigid/abd/forward_kinematics.py:85-102 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:142-148 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:178-184 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1301-1309 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dac1b45664782e4bad26184d3db3e1fc24de5c0d9cee5d1076592c47f4ef9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/engine/solvers/rigid/collider/epa.py:443-570 | genesis/engine/solvers/rigid/collider/epa.py:590-716 | genesis/engine/solvers/rigid/collider/epa.py:721-799 | genesis/engine/solvers/rigid/collider/epa.py:1267-1309 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b9fc21f098e5c6a5d17f6fcb634194ebf4b2e42a4b7716754cb1ae05561e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): genesis/utils/mesh.py:1258-1263 | genesis/utils/mesh.py:1279-1284 | genesis/utils/mesh.py:1300-1305 | genesis/utils/mesh.py:1366-1371 \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":"genesis/utils/mesh.py"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa566298337f9b94d022680ad85b7f75fbfd78169eb78e8eaf085ce0dcc16b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:370-428 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:441-493 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1f0db79b2a40a254fd4a16c58e4df74c232d4f5f581d0eb0cb49b45c432a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): genesis/engine/solvers/rigid/constraint/solver.py:2412-2469 | genesis/engine/solvers/rigid/constraint/solver.py:2581-2643 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69dee815789bddd91b0b11931576e0ee04316192fec32f439cb2fe9e7d705dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): genesis/engine/solvers/rigid/abd/inverse_kinematics.py:234-277 | genesis/engine/solvers/rigid/abd/inverse_kinematics.py:291-347 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cd676d89fa247a1f4263241bd584b7b7588e0f96e56d6b0265eecb42032e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1451-1512 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1527-1601 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd6d97cc8b46bc551223cc5475abe83ca1071dc16dcaca20328ba189645a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): genesis/ext/urdfpy/urdf.py:2986-3069 | genesis/ext/urdfpy/urdf.py:3072-3152 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a1c7a2e4fa272b9127bd77bca8a7799f161f534350d9d9e02275e81ce67cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): genesis/engine/solvers/rigid/constraint/solver.py:5257-5299 | genesis/engine/solvers/rigid/constraint/solver_breakdown.py:24-59 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5257}}}],"partialFingerprints":{"codehealthFindingId/v1":"324f0467e87660b6084e9bacd426843fe5d995a37bd8b5afeb89a3b2a85e6c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): genesis/vis/rasterizer_context.py:760-795 | genesis/vis/rasterizer_context.py:843-878 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"03726536d621a9d76d9615d94908525e01f97537d6f721355b621b0b3f420eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): genesis/engine/solvers/rigid/collider/capsule_contact.py:20-100 | genesis/engine/solvers/rigid/collider/capsule_contact.py:169-245 \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":"genesis/engine/solvers/rigid/collider/capsule_contact.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a666f6d00b1df24a4caf7a2f5839447cf6855a1c726cc4e1d3a8448d068df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): genesis/engine/sensors/kinematic_tactile.py:784-846 | genesis/engine/sensors/kinematic_tactile.py:1044-1128 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca627f45b4bdaa08be3b260ad99fdc37805581681acbbe472cf5570e6767603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1170-1204 | genesis/engine/solvers/rigid/rigid_solver.py:2632-2673 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7f7cd454ddb5036cd1c233e85a33b13b7baa0185e23f941fab5e498205641a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): genesis/engine/entities/rigid_entity/rigid_entity.py:2015-2057 | genesis/engine/entities/rigid_entity/rigid_link.py:519-540 \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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"862fdd828843ccabcdada4d802c9916dd4936f433477e5d93698516d4fceccfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): genesis/engine/couplers/sap_coupler.py:1981-2004 | genesis/engine/couplers/sap_coupler.py:2036-2064 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"694a05375ef44b9ddf7a9e2ec57140032272504ec1ab20cf115975c723023447"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): genesis/engine/solvers/fem_solver.py:1760-1788 | genesis/engine/solvers/mpm_solver.py:1691-1723 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3f731e885011e469f3613e3b1b91ce332c476fe75237d29125c0aa660462d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): genesis/utils/geom.py:1110-1141 | genesis/utils/geom.py:2079-2106 \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":"genesis/utils/geom.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c50a52d8dfb2a586abd8b95006aa57c15e8f4165a96f2849d90fa0f81fbb14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): genesis/engine/solvers/rigid/collider/contact.py:393-424 | genesis/engine/solvers/rigid/constraint/solver.py:595-633 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"244bb56cf1b9c61ffc00a3866575e555f14b311d1396298f80c4d95f817ee10f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): genesis/utils/path_planning.py:327-342 | genesis/utils/path_planning.py:672-686 \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":"genesis/utils/path_planning.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"165eac84436cc8381a560a723d00f3b868fa3ff6945ed7d94ca60d524fbc96a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1002-1030 | genesis/engine/solvers/kinematic_solver.py:1034-1063 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bd46d3d28394ac62b4ab07cfe67beec42db5a633d36b50fd0f9a7da6484af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): genesis/engine/solvers/rigid/constraint/linesearch.py:671-703 | genesis/engine/solvers/rigid/constraint/linesearch.py:720-751 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1159ed5703e80acbc9410e330844478b2bde5cf40330d5df5d333cac99c25674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): genesis/utils/raycast_qd.py:452-474 | genesis/utils/raycast_qd.py:487-505 \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":"genesis/utils/raycast_qd.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fefc29a07936f6d0c67901b1ec2e9f21fd32b5c0aa2a00b1cf928e1e9124ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:45-57 | genesis/engine/solvers/rigid/abd/accessor.py:212-224 \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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"546ae1dcd07746c5c10c90e2be80a0200a0bae4fe2d39cc0beb2567aa558eb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:284-314 | genesis/engine/solvers/rigid/abd/accessor.py:330-358 | genesis/engine/solvers/rigid/abd/accessor.py:373-402 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbd63ac4bd6b4742a44b8ceeba416a4bf792d554882e8dcd8bf646dbecc8e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:871-889 | genesis/engine/solvers/rigid/abd/accessor.py:903-921 \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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f212a1044377ebe3426209fa79069fb27e2970d77e9dbb09f79b0cfea46341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): genesis/engine/solvers/rigid/collider/narrowphase.py:4497-4537 | genesis/engine/solvers/rigid/collider/narrowphase.py:4794-4831 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4497}}}],"partialFingerprints":{"codehealthFindingId/v1":"040a95788f47579c27455bdbda02241b536fea87b46dc6fc3151aecfbe5db54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): genesis/vis/rasterizer_context.py:896-917 | genesis/vis/rasterizer_context.py:1030-1052 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4776702bee59c8d7adfe35f1fadf108c834318f48fcec88160b2f1f28a620d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/vis/rasterizer_context.py:798-810 | genesis/vis/rasterizer_context.py:881-893 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac20adab3ddc5c22d10c09afe9cb1b0aa0f4e340701d30689edf067499eef8fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:557-567 | genesis/engine/solvers/rigid/abd/accessor.py:579-589 | genesis/engine/solvers/rigid/abd/accessor.py:673-681 \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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac667cc94f6b0896073d4a3ae77176beba4a7077f8aac1b5e1eead1735929ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): genesis/ext/pyrender/renderer.py:231-291 | genesis/ext/pyrender/renderer.py:294-326 \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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"869bb4cd4e6f941630366592a3c3effcb3869f44b96b044269004d0d932d180e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): genesis/engine/solvers/fem_solver.py:1382-1408 | genesis/engine/solvers/fem_solver.py:1422-1442 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bc34298ee57153d64594ea2f8bbddde145228c0ceb32c4094e9e178e745264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): genesis/engine/entities/rigid_entity/rigid_entity.py:1260-1279 | genesis/engine/entities/rigid_entity/rigid_geom.py:710-727 \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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2673f8a65353c1aa61bd879f19596c8003432536d2e2671f5da3d380c501175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): genesis/engine/solvers/rigid/rigid_solver.py:2474-2490 | genesis/engine/solvers/rigid/rigid_solver.py:2494-2510 | genesis/engine/solvers/rigid/rigid_solver.py:2514-2532 | genesis/engine/solvers/rigid/rigid_solver.py:2536-2558 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"95682140c236dd0048e3a19d8c6347525e06e64ce315418a01ccff0a93cc0846"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): genesis/engine/solvers/rigid/constraint/island.py:411-432 | genesis/engine/solvers/rigid/constraint/island.py:439-461 \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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"3062971932813d5e182accf1b38f1186314f4fa09f7528a27e0bf73b4fa0eb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): genesis/engine/solvers/rigid/constraint/solver.py:672-692 | genesis/engine/solvers/rigid/constraint/solver.py:699-718 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fc1ae494369ad9a7640fdc96f6f80591bf4d456c966016c4e56e2fbf720264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): genesis/engine/solvers/mpm_solver.py:1385-1402 | genesis/engine/solvers/mpm_solver.py:1485-1500 \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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7847841f71d3ed834b46950de0b7c9944b6bab8ce1e40b46f1328ebbb6478519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): genesis/engine/solvers/kinematic_solver.py:789-802 | genesis/engine/solvers/kinematic_solver.py:819-832 | genesis/engine/solvers/rigid/rigid_solver.py:1256-1269 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"626b206c6894915e6685d7ebb79ecd2689ce1744cb7ddfb4ab8b207e8dca69f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): genesis/engine/sensors/point_cloud_tactile.py:1073-1094 | genesis/engine/sensors/point_cloud_tactile.py:1112-1144 \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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"99856a35e81231f54a24f89cbd67b7cc64f1b2c5ba5afbdeafc9b7a1652090a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): genesis/engine/couplers/sap_coupler.py:6627-6637 | genesis/engine/couplers/sap_coupler.py:6685-6698 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6627}}}],"partialFingerprints":{"codehealthFindingId/v1":"3541f4f7922138f5d5341f9d1ccd13b0d5ad635cb9b8eff6d5f58e101fcc5a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): genesis/ext/pyrender/jit_render.py:1395-1417 | genesis/ext/pyrender/jit_render.py:1420-1442 \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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"352a223b6f82e660f125123b998470e988bb4738ceb4e523be6004347ba0b70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/options/solvers.py:795-809 | genesis/options/solvers.py:875-887 \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":"genesis/options/solvers.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5824d9567a941dd9ca07d720e5527970eb8661fe1fdb27caca6145a867a3b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1067-1082 | genesis/engine/solvers/rigid/rigid_solver.py:2420-2443 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d4d7fd6044a667364037af9162084d303699b636c742a80274a52c231e962f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:45-54 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:59-68 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6b739f041f865f861161d7b85980e3eec872da1a4efcd6b101a5d35a775c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): genesis/engine/solvers/particle_solver.py:360-377 | genesis/engine/solvers/particle_solver.py:393-407 \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":"genesis/engine/solvers/particle_solver.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c14ea4b679b488deec62c32ae576f3cc7aaf256024ea2cffcb3224b70376bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:538-544 | genesis/engine/solvers/rigid/abd/accessor.py:600-608 | genesis/engine/solvers/rigid/abd/accessor.py:619-625 | genesis/engine/solvers/rigid/abd/accessor.py:636-642 | genesis/engine/solvers/rigid/abd/accessor.py:653-661 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2bc38c8221d5e2a54287e620cdaa719c5882bef43f4c3e1a4ebd5f4f420a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): genesis/utils/sdf.py:185-205 | genesis/utils/sdf.py:568-592 \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":"genesis/utils/sdf.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1948632c07133e11c79bbdaf10f4b603fcb73b61773b7bc0193d6ec538ba7dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): genesis/ext/urdfpy/urdf.py:3216-3252 | genesis/ext/urdfpy/urdf.py:3255-3290 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ea350ccf19fcbc253c58475b0759997a84d40c145545793c37de3f0e275e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): genesis/engine/force_fields.py:103-120 | genesis/engine/force_fields.py:297-319 \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":"genesis/engine/force_fields.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e54291b7386fff41d9b280c5a728746b82457a6d6b425750ed6d9f6f722e7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): genesis/utils/particle.py:327-347 | genesis/utils/particle.py:351-371 | genesis/utils/particle.py:375-399 \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":"genesis/utils/particle.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5e0d54f8d471dfb357559c63bb7f34e64cb4f83ad53d660dd5866f8aa3c1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/utils/geom.py:2200-2215 | genesis/utils/geom.py:2220-2232 \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":"genesis/utils/geom.py"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eead274d90bc30404f135db4d324f87d2506ee9afce00b8932dddcebdaa3509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): genesis/utils/simt.py:123-147 | genesis/utils/simt.py:174-192 \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":"genesis/utils/simt.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"944f8f3c0b40760c9994a9e20a352c263299bd3f085c53df3a2eb40cb3e8645c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): genesis/engine/solvers/rigid/collider/contact.py:350-359 | genesis/engine/solvers/rigid/collider/contact.py:373-382 \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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2bc32e497f35379d8d22f7dd548fe6707512e8081d28b11ab4ae53828c388b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): genesis/engine/solvers/rigid/rigid_solver.py:1121-1132 | genesis/engine/solvers/rigid/rigid_solver.py:1272-1286 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0744365e3954aabcd03d5fcf4292e4e6ce002aad4ecc4a62e35a5ce3def78de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): genesis/engine/sensors/camera.py:673-691 | genesis/engine/sensors/camera.py:825-845 \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":"genesis/engine/sensors/camera.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"897a3362b8a3219e10de86f8dfa5d8474c99141d4e793d5028d06b811feced57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1154-1160 | genesis/engine/solvers/rigid/rigid_solver.py:2744-2750 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbb0e6e9f17f1fab95bcc756eba4cd55c316d283468b4dd5825e7733adc1a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): genesis/engine/sensors/point_cloud_tactile.py:766-796 | genesis/engine/sensors/surface_distance_probe.py:317-341 \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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ae3cc0c4a01b51592a8dbd09d297f0bdf46c9a3c563bbf1a43e06b5a66543b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): genesis/engine/solvers/base_solver.py:915-926 | genesis/engine/solvers/particle_solver.py:301-308 \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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e7b80828154132df7469ea6d3885e7237e269b19597ddabcb7f720604375d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1225-1253 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1264-1281 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"557b4cb1bd7552645e3b48197d5c877bdfe143f5ced7fdc6ca07b3680f639120"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): genesis/options/surfaces.py:508-516 | genesis/options/surfaces.py:598-606 | genesis/options/surfaces.py:695-704 \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":"genesis/options/surfaces.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4222d3e1b3d6227a4abaa83dbd5712fa2911959d5fbec14090571194e22be71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:70-89 | genesis/engine/solvers/rigid/abd/accessor.py:146-165 | genesis/engine/solvers/rigid/abd/accessor.py:255-265 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f711d13921b173c88e8962ea2fb1adb0d6565ec6a03ef8b20ebde7277b9d068"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): genesis/engine/solvers/rigid/collider/collider.py:1323-1349 | genesis/engine/solvers/rigid/collider/collider.py:1379-1405 \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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e7b8ba3aea90394cf1b41ac3e8a6f5dcbfc2413e6345ee34c736d047619bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/engine/couplers/sap_coupler.py:7193-7210 | genesis/engine/couplers/sap_coupler.py:7543-7555 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":7193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8b4f2ead176b56f92ea857571c451cb0834f5c8f27908fb1fedd3320b6c45a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/engine/entities/rigid_entity/rigid_geom.py:276-288 | genesis/engine/entities/rigid_entity/rigid_link.py:499-515 \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":"genesis/engine/entities/rigid_entity/rigid_geom.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a429aeef130811fcfad40072a3f406d00b87170683916494f27340709a69d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): genesis/engine/solvers/rigid/abd/forward_dynamics.py:665-701 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:714-727 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b513b7beef679efc5db9b95e6ecc3549198b93ca74c9e46b2a729fe63f6a988c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): genesis/utils/geom.py:1153-1162 | genesis/utils/geom.py:1305-1313 \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":"genesis/utils/geom.py"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf1910d14d827382390b6fafadf5e9e27f85dc3cdf9460c724003e3296606a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): genesis/engine/solvers/pbd_solver.py:759-765 | genesis/engine/solvers/sph_solver.py:774-781 \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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c039071deb39a41b1baa55925b6468271abf3850d626f84c2c917b98257be4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:780-783 | genesis/engine/solvers/rigid/abd/accessor.py:794-800 | genesis/engine/solvers/rigid/abd/accessor.py:811-818 | genesis/engine/solvers/rigid/abd/accessor.py:830-837 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e871e46d8116eb04c74e51cd954a19233688b98a7fdfb7fff735e55ccbf1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): genesis/vis/rasterizer_context.py:1183-1194 | genesis/vis/rasterizer_context.py:1197-1213 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec56ca65eda6f834cfb59369919ed11d9ab30f057074a7c8cf94734d94b3db66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): genesis/engine/entities/rigid_entity/rigid_entity.py:581-612 | genesis/engine/entities/rigid_entity/rigid_entity.py:615-646 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8780b40018c0aabdd7b2aa01d83bad26a58ba424657f5a0e38bd90b46b91a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): genesis/utils/mesh.py:1267-1274 | genesis/utils/mesh.py:1288-1295 \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":"genesis/utils/mesh.py"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c6c2f51cf9bd3a79a59deeecc473fa5108ba7ea632438f70e74df3451f6f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): genesis/engine/solvers/rigid/abd/forward_kinematics.py:114-131 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:159-165 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:197-203 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24262f93efcf662357772a6f249602a3c9ac0a5718e4761e6f8757191d9483d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): genesis/engine/solvers/rigid/collider/multi_contact.py:553-568 | genesis/engine/solvers/rigid/collider/multi_contact.py:732-757 \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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d40bcfc5ddb7f715e3bddfed5c6d43b3f23901a6be9169696e6065535aaca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): genesis/ext/pyrender/material.py:378-399 | genesis/ext/pyrender/material.py:587-610 \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":"genesis/ext/pyrender/material.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8855d2f27b31a172823004ba290b2bbecb979564b1b29a1249939e715d4ddf44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): genesis/ext/urdfpy/urdf.py:403-429 | genesis/ext/urdfpy/urdf.py:484-510 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b743c8a61b4ca15efbcc9369282f993b1e31858805edc82ff2cfb204f892bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/utils/geom.py:1416-1430 | genesis/utils/geom.py:1464-1476 \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":"genesis/utils/geom.py"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"22abb0410935bf325974a71e3d0da9f71982d3aa58a55b33619650543b59b3d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): genesis/engine/mesh.py:343-354 | genesis/engine/mesh.py:715-726 \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":"genesis/engine/mesh.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"24216f9fe336f6a6e479d9f32db5f3bd75cd203a510e0c241caf0a76399d371b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): genesis/utils/path_planning.py:1102-1115 | genesis/utils/path_planning.py:1119-1132 \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":"genesis/utils/path_planning.py"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e02cc882d897d3c90076a7ad752fde5e9b03c4070334edae2daa4ea1e81f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): genesis/engine/couplers/sap_coupler.py:3312-3330 | genesis/engine/couplers/sap_coupler.py:6187-6202 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3312}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c04399abe7c5c7a5ea4be03f94f4d2d06a2d0a5d1814cdc1e6d21960fb0325"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): genesis/utils/sdf.py:333-344 | genesis/utils/sdf.py:415-429 \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":"genesis/utils/sdf.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25088d099969542c7104b3064c4da5d99e8445878f9d29fb38c24fd53cd78d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): genesis/ext/urdfpy/urdf.py:1108-1129 | genesis/ext/urdfpy/urdf.py:1216-1238 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3046cdcdccca780bbc62e5c8a091902500e8019807ee4bc27588a871a98b0e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): genesis/engine/sensors/kinematic_tactile.py:849-856 | genesis/engine/sensors/kinematic_tactile.py:930-937 | genesis/engine/sensors/kinematic_tactile.py:1131-1138 | genesis/engine/sensors/point_cloud_tactile.py:2081-2088 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"810569c63ad7a38a7807991fd6a4a4e81fcec5b66b64fe6955eee7fc7e8f6eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): genesis/engine/solvers/rigid/abd/accessor.py:692-694 | genesis/engine/solvers/rigid/abd/accessor.py:701-703 \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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e353e4ae7e2358820dd240648e645941a64588e78645f005da7528521f1e6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): genesis/recorders/plotters.py:264-274 | genesis/recorders/plotters.py:434-451 \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":"genesis/recorders/plotters.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64a066c3c64f6b95d11a56e5320ad468cec3db46fddb0a6c7a84fd30e1879c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): genesis/engine/solvers/fem_solver.py:853-871 | genesis/engine/solvers/mpm_solver.py:493-510 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc9a732c097a87bfe5571d4f768454f28a1c91250978f3d2ef8b4f8272b66c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): genesis/engine/solvers/kinematic_solver.py:1224-1229 | genesis/engine/solvers/rigid/rigid_solver.py:2856-2861 | genesis/engine/solvers/rigid/rigid_solver.py:2864-2869 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8b4d87c545d4e2c1cd5e5590cd452001c23bdb6374beeb3030d242c94be8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1163-1167 | genesis/engine/solvers/rigid/rigid_solver.py:2753-2757 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"622976d89023de5a251da6a53c38de932d33ab6aef677909c93336b3e19f7a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): genesis/utils/geom.py:1145-1147 | genesis/utils/geom.py:1458-1460 \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":"genesis/utils/geom.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23c88030f966cbe2158c2c28243bbfe66a73c6f0deae2d017ab91dd62a68465"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): genesis/engine/solvers/rigid/abd/forward_kinematics.py:954-960 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:995-999 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca37489b1ec65711673875446398e37a63b6f76814b048a7f09f6b547193bf27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): genesis/engine/entities/rigid_entity/description.py:1223-1229 | genesis/engine/entities/rigid_entity/description.py:1785-1794 \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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"971392482cb18e9646e2c9d99356f7b0d0a23709060604b9b51fd5436cdbcf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/engine/entities/pbd_entity.py:508-520 | genesis/engine/entities/pbd_entity.py:573-585 \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":"genesis/engine/entities/pbd_entity.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ba0df7634941769101d14eb06f69bf01e19dfb1041101f071674f09d5a3d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): genesis/engine/solvers/pbd_solver.py:1086-1091 | genesis/engine/solvers/pbd_solver.py:1104-1111 | genesis/engine/solvers/pbd_solver.py:1124-1129 \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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e4f838ac89378c917bbc18d3f6ae7c0fe4a7a1bf4a74d658d14f1133f67816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): genesis/vis/camera.py:841-847 | genesis/vis/camera.py:850-856 | genesis/vis/camera.py:871-880 \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":"genesis/vis/camera.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a2dc010cb3817d806777f6c4304f422ee5e60c3ea4d822b1ac53550f9d7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): genesis/engine/entities/rigid_entity/rigid_entity.py:2307-2336 | genesis/engine/entities/rigid_entity/rigid_entity.py:2340-2369 \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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"168e184be97621219bb718d0e44f36236c0b2c7435424377806b2253ad8f9664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): genesis/engine/entities/fem_entity.py:218-239 | genesis/engine/entities/particle_entity.py:304-319 \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":"genesis/engine/entities/fem_entity.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7f2a329b643a005ae60143c3da624ee3cbc2f79672be9b8f05ee0df7e51733"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): genesis/engine/solvers/rigid/abd/forward_kinematics.py:534-544 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:650-658 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01ac9cc5202562b8d638c4ac3e8809099f65dd876b7948c0331024a68f26bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): genesis/engine/solvers/fem_solver.py:1718-1721 | genesis/engine/solvers/fem_solver.py:1726-1736 | genesis/engine/solvers/fem_solver.py:3024-3027 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1ba0553a94913ec0ca1635db1fa9c7c314514d8f9d5a40c0b2e11e22434e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): genesis/engine/solvers/rigid/constraint/solver.py:5141-5149 | genesis/engine/solvers/rigid/constraint/solver.py:5347-5357 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9239367fd080cb933970219edd5d92e2a5d9d3df474b5bc7453812e317158d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): genesis/ext/pyrender/primitive.py:171-177 | genesis/ext/pyrender/primitive.py:186-190 \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":"genesis/ext/pyrender/primitive.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a553edf99a452bdf589f80abf66d42a0dbba6780aaeaa8b66f539bdecc8b44b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): genesis/engine/solvers/pbd_solver.py:1136-1141 | genesis/engine/solvers/sph_solver.py:1413-1418 \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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95f7391ed146d79718c0bdd68ba5b0526d2e7fd730f6e9fd368e6679f85edfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): genesis/engine/solvers/base_solver.py:967-975 | genesis/engine/solvers/base_solver.py:980-987 \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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eb2c275d08b70ea3272f5543ec9d965995dfa811e81a40aaafbe84b1d7d26c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): genesis/ext/pyrender/renderer.py:903-915 | genesis/ext/pyrender/renderer.py:918-931 \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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a643614dbfbd2a9a245bdb9e6c9fa070acc967be6148ca0edbfef687c9e902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): genesis/utils/path_planning.py:345-351 | genesis/utils/path_planning.py:689-696 \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":"genesis/utils/path_planning.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6f40ba8abda149b742055fc1d15c79d3feb923f476c75d962158049414d639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): genesis/engine/materials/FEM/elastic.py:73-79 | genesis/engine/materials/FEM/elastic.py:160-170 \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":"genesis/engine/materials/FEM/elastic.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f49e2652cda68d2b6ca371d7807fa6aca4540411445d46f93b10c6c2d68099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): genesis/engine/solvers/rigid/rigid_solver.py:2708-2712 | genesis/engine/solvers/rigid/rigid_solver.py:2720-2724 | genesis/engine/solvers/rigid/rigid_solver.py:2727-2731 | genesis/engine/solvers/rigid/rigid_solver.py:2734-2737 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a05dc1bc70d763859278ceb6e3bad4b394c9ca4b078566d4e3111f70d053191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): genesis/engine/solvers/rigid/rigid_solver.py:2850-2853 | genesis/engine/solvers/rigid/rigid_solver.py:2872-2875 | genesis/engine/solvers/rigid/rigid_solver.py:2878-2881 | genesis/engine/solvers/rigid/rigid_solver.py:2884-2887 | genesis/engine/solvers/rigid/rigid_solver.py:2890-2893 | genesis/engine/solvers/rigid/rigid_solver.py:2896-2899 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"1744bf0d335af58fd2ba22a74eb2725a909d94b1e108c8154bba37c180954198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): genesis/ext/urdfpy/urdf.py:2953-2969 | genesis/ext/urdfpy/urdf.py:2973-2983 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"d364e07f1394691959f3fb91b82ac7006a5b065e555839aaea8eaaf9f268c33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): genesis/engine/materials/MPM/base.py:98-101 | genesis/engine/materials/MPM/elastic.py:54-57 | genesis/engine/materials/MPM/liquid.py:49-52 \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":"genesis/engine/materials/MPM/base.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cb5de49e85f4f62570ef66232e1a3928c4885b1e547e386adc63c3cdf19f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): genesis/engine/solvers/fem_solver.py:1082-1099 | genesis/engine/solvers/particle_solver.py:158-163 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec91791770eecd3bbf7ab1e274f51ec86884b8f2b42d47108e87e6b1e340c341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): genesis/utils/mjcf.py:506-515 | genesis/utils/usd/usd_rigid_entity.py:578-584 \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":"genesis/utils/mjcf.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"445e848bfd8602d9ab6181376a167e1a8388526c80cc4cdf283e64484d1d7b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): genesis/engine/entities/rigid_entity/rigid_equality.py:17-25 | genesis/engine/entities/rigid_entity/rigid_joint.py:20-28 \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":"genesis/engine/entities/rigid_entity/rigid_equality.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5839847789651c66a0adcffa7da230d05ecfcc3a61e93b5a8c9151799783341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): genesis/engine/entities/mpm_entity.py:113-128 | genesis/engine/entities/pbd_entity.py:40-55 \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":"genesis/engine/entities/mpm_entity.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5799b44f8c8dbad84a325c77fd2a5f9dcf6ef162100d65a468063878de5f0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1273-1280 | genesis/engine/solvers/rigid/rigid_solver.py:2698-2705 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f999db61e9838fd1b876c641d344196e90c692078f992db4ab29b6fbb1df22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1146-1147 | genesis/engine/solvers/rigid/rigid_solver.py:2694-2695 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"343d8db8a07ba861c26087b22c24db9d07b3d0009acb5f4fb318066bcfe0f7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): genesis/engine/solvers/kinematic_solver.py:1150-1151 | genesis/engine/solvers/rigid/rigid_solver.py:2740-2741 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b82605b615aa0760cc8e6b39ead0988aa14cd09401224fbed7ff34b2ff66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): genesis/ext/urdfpy/urdf.py:4031-4034 | genesis/ext/urdfpy/utils.py:118-133 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"626e01fefe3d78854e5873831797bfeaa89394f00b71b404525aee53a06cfec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): genesis/engine/solvers/fem_solver.py:1102-1104 | genesis/engine/solvers/kinematic_solver.py:1219-1221 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe30a141600f1dbbfd94555eb90586e6488910d6583cb4f3c13e994110d84e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): genesis/engine/solvers/fem_solver.py:1107-1109 | genesis/engine/solvers/kinematic_solver.py:1215-1216 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b19b2a339265eb4a9f6c136882123007d225c7a620313929e83f5b17b01214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): genesis/engine/entities/mpm_entity.py:131-132 | genesis/engine/entities/particle_entity.py:342-356 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/mpm_entity.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1427fb092ada26f59177dbd74771ec3e3ee46bd9e872ba0640cf90f065d1172"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): genesis/engine/entities/rigid_entity/rigid_joint.py:399-399 | genesis/engine/entities/rigid_entity/rigid_link.py:407-407 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_joint.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea894ae544aa2fd78685b50bdc5f55eb4ca67089db843266d15a9ad9e19c6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): genesis/ext/pyrender/camera.py:308-313 | genesis/ext/pyrender/light.py:305-308 \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":"genesis/ext/pyrender/camera.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc81e9f39d62eade9f98e05626f35e2331941e42fcd3627308a2cfb27d26ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): genesis/engine/entities/mpm_entity.py:150-159 | genesis/engine/entities/particle_entity.py:393-407 \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":"genesis/engine/entities/mpm_entity.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"70be2c823b9aba2d7dff99d34c8104ab3f612799519e24a4b37903ee4505509e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): genesis/engine/entities/mpm_entity.py:207-216 | genesis/engine/entities/particle_entity.py:457-471 \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":"genesis/engine/entities/mpm_entity.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"372ea5bf86bcfa4775ea28c90cf747ec85f63de1b600ea5c7d969acf92648835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70\u201373 lines \u00D7 3): genesis/ext/pyrender/jit_render.py:896-968 | genesis/ext/pyrender/jit_render.py:1034-1105 | genesis/ext/pyrender/jit_render.py:1172-1241 \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 \u0060genesis/ext/pyrender/jit_render.py:896\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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac530bd4964e34c71a32f4e192b32edd8416a8e6e3de13e2ff233fb488eeaf96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201354 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:902-955 | genesis/engine/solvers/rigid/constraint/solver.py:1130-1176 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"777a8db9cbea8198555901619f25b56a8bc026f28a1256f2fbed5cbe4caccb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53\u201354 lines \u00D7 2): genesis/utils/path_planning.py:610-662 | genesis/utils/path_planning.py:1009-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"genesis/utils/path_planning.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8238711bff22e15d7947c5c83e3b162fc2694944e1808ea3af81d6d65b252e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201351 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:528-578 | genesis/engine/solvers/rigid/collider/narrowphase.py:962-995 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac636fbdc8bbb794a43a38821f4be7011183b8c5dbc04b82dab86ed711307496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201346 lines \u00D7 2): genesis/engine/solvers/rigid/abd/inverse_kinematics.py:504-549 | genesis/engine/solvers/rigid/abd/inverse_kinematics.py:633-676 \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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a29745bfc00179c6609b83982f8ea3f94d863c69ec294e77d7d7ac2afdaf48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:2949-2991 | genesis/engine/solvers/rigid/collider/narrowphase.py:4384-4426 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc60cbae40555c1f2a44780e7d8d8c7c25cb784bf8a50c320c5870207f0bd06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201339 lines \u00D7 3): genesis/engine/couplers/sap_coupler.py:6478-6516 | genesis/engine/couplers/sap_coupler.py:7060-7063 | genesis/engine/couplers/sap_coupler.py:7379-7415 \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. 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, \u0060genesis/engine/couplers/sap_coupler.py:6516\u0060 calls \u0060zero\u0060 and \u0060genesis/engine/couplers/sap_coupler.py:7063\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6478}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3926768143db1e47f18ec762d6a5101f0e1cc699e0f2f99223405a86149325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201334 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:486-519 | genesis/engine/solvers/rigid/collider/narrowphase.py:946-960 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f353fb6e2291a62331353dea63a2a5c2c7924c946c7db77dc896a044c817d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201333 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:1498-1530 | genesis/engine/solvers/rigid/collider/contact.py:1919-1943 \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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"26efbf8686b87e66eb267b3ed76239382f23abf12ef4aea6f1ab1f9dffed0df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:829-861 | genesis/engine/solvers/rigid/constraint/linesearch.py:1034-1066 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"03925ec7f16d141a68e6384744eb7242ef644824cc6a4576707c635d66dc2e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/linesearch.py:829-859 | genesis/engine/solvers/rigid/constraint/linesearch.py:1034-1064 | genesis/engine/solvers/rigid/constraint/linesearch.py:1460-1490 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"34420593242cd74fe835a140f53b04443da634e933eaa5ca1055ba4577242eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): genesis/engine/sensors/kinematic_tactile.py:450-479 | genesis/engine/sensors/kinematic_tactile.py:555-583 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb50a709ebc0ef4e1aee8277cc95c720b268e0b2d5e43b916aefd91c70bcacbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:3196-3225 | genesis/engine/solvers/rigid/collider/narrowphase.py:3696-3725 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa5255fbe1df522481eaa91b28cecc58e1b927c4a21ab114fa029182b08c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201329 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:1014-1042 | genesis/engine/solvers/rigid/constraint/backward.py:1212-1235 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"196cb553ea59d1afb90dd547749d3d57e49027b8d08bc9561ea4c6b9376cb9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): genesis/ext/pyrender/renderer.py:260-288 | genesis/ext/pyrender/renderer.py:294-322 \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":"genesis/ext/pyrender/renderer.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80ba11016b0751eb9317002d190f59a4df6156b3ec814a20b7465d24396c0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): genesis/utils/usd/usd_rigid_entity.py:289-317 | genesis/utils/usd/usd_rigid_entity.py:332-359 \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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb99a73513db893ed1d1e04d0ff8cf5d912b35e02a697bde52162d04c7c0124b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): genesis/utils/tools.py:78-105 | genesis/utils/tools.py:114-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060genesis/utils/tools.py:78\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":"genesis/utils/tools.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a08dc57b07f012fe9c4b11897185021ce9a28a71ec381ae4f8c897aa8fb18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 3): genesis/engine/solvers/rigid/collider/narrowphase.py:2901-2929 | genesis/engine/solvers/rigid/collider/narrowphase.py:3326-3359 | genesis/engine/solvers/rigid/collider/narrowphase.py:4311-4342 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c387e50fbaf2083f518ace0cacaffef9822ab36b081dd0e159f6a975f35929be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:1834-1860 | genesis/engine/solvers/rigid/rigid_solver.py:1973-1994 \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 \u0060genesis/engine/solvers/rigid/rigid_solver.py:1834\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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"f519842a91004ae656a801008f200744e433d58f2b851221405a3459b8dce0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): genesis/engine/entities/particle_entity.py:141-165 | genesis/engine/entities/sph_entity.py:60-84 \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":"genesis/engine/entities/particle_entity.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"175e874fbad1a1c1e1c8e658df36686b2110f0197c2907c4754e5a9e18ab98a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:1176-1200 | genesis/engine/solvers/rigid/rigid_solver.py:2646-2669 \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 \u0060genesis/engine/solvers/kinematic_solver.py:1176\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8770af01510baf4fb16e79571df729d07ae2633d926141025337cfdfe41d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): genesis/engine/solvers/rigid/collider/narrowphase.py:2944-2967 | genesis/engine/solvers/rigid/collider/narrowphase.py:3369-3392 | genesis/engine/solvers/rigid/collider/narrowphase.py:4379-4402 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8cd855ecbb26a49995384b1bf8248952df0ee7bf207635084db56f12e55563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:964-982 | genesis/engine/solvers/rigid/rigid_solver.py:1934-1957 \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 \u0060genesis/engine/solvers/kinematic_solver.py:964\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f23cb3782a90c32b70f1a415c73cd93af5db2449cf2ecb9b1572f367cd754ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1172-1195 | genesis/engine/solvers/rigid/constraint/noslip.py:24-47 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaf60ca408ceabe2c58db4e854eec96cb94cd7c1d1b8262067696d53ac733b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:520-543 | genesis/engine/solvers/rigid/collider/box_contact.py:801-824 \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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e699918fa9b103a969c32cee2b29b8d9fd90aaaf942986bb4e1229f6f337c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): genesis/utils/path_planning.py:441-464 | genesis/utils/path_planning.py:806-829 \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":"genesis/utils/path_planning.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b99451bbacf664224d00fb5fd8c20df45917ef2f8f967b1f53f0ee7d7ab9cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:1322-1365 | genesis/engine/solvers/rigid/collider/contact.py:1564-1585 \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, \u0060genesis/engine/solvers/rigid/collider/contact.py:1318\u0060 calls \u0060template\u0060 and \u0060genesis/engine/solvers/rigid/collider/contact.py:1561\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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df35c65ae95a35a180c85a3ecb3945378cf2e315460a08f380b491a0c2e9f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): genesis/ext/urdfpy/urdf.py:3017-3038 | genesis/ext/urdfpy/urdf.py:3101-3122 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"5734e139e7b543cb30aa8fa483e7c6b0ed7f7f5472d15e00cab6063d5d86a899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): genesis/engine/entities/emitter.py:151-171 | genesis/engine/entities/emitter.py:217-237 \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":"genesis/engine/entities/emitter.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4bacdc96d7a585021796dc5377519cc17ed58f5e24e0af3a210a91800def59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): genesis/engine/sensors/kinematic_tactile.py:323-358 | genesis/engine/sensors/kinematic_tactile.py:622-656 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97e46ba2f694e7b7b3e893de56a0aa66d54f4d3ec03114aeba8f120380844a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1492-1512 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1584-1601 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:1492\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f7ac479c0d260dbb6f76c5b6a39c8b2ad0bf7b106aaa0a9597086967dbb1d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): genesis/engine/solvers/rigid/collider/epa.py:500-520 | genesis/engine/solvers/rigid/collider/epa.py:632-651 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"67394f6f9c7df0d78788b0eb2247b1374a99e37df2d5742eeab2c483d99d359c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): genesis/engine/solvers/rigid/collider/capsule_contact.py:62-81 | genesis/engine/solvers/rigid/collider/capsule_contact.py:132-150 | genesis/engine/solvers/rigid/collider/capsule_contact.py:214-232 \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":"genesis/engine/solvers/rigid/collider/capsule_contact.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b287d2fc9ba8360c824be80cc42a83f18460d63fee7ab6bad1a9f51f4202a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): genesis/engine/solvers/rigid/collider/diff_gjk.py:494-513 | genesis/engine/solvers/rigid/collider/epa.py:161-180 | genesis/engine/solvers/rigid/collider/epa.py:1093-1112 \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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a19a6082220f131a260bbcc691e42c05aee2b42902d11f4e14944760a3150e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201320 lines \u00D7 3): genesis/engine/solvers/rigid/collider/narrowphase.py:126-134 | genesis/engine/solvers/rigid/collider/narrowphase.py:912-920 | genesis/engine/solvers/rigid/collider/narrowphase.py:1305-1324 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"79941abf0731a87f7129518bba08487a4e99757054ec6bfd622b01f8e95e2100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): genesis/engine/sensors/kinematic_tactile.py:101-118 | genesis/engine/sensors/kinematic_tactile.py:139-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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6457bb6ff1bb55287a8db92ad32c11aa1f623a80eb592c75c7c7a4357844b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): genesis/engine/solvers/rigid/collider/gjk.py:1619-1638 | genesis/engine/solvers/rigid/collider/gjk_support.py:151-170 \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 \u0060genesis/engine/solvers/rigid/collider/gjk.py:1619\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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c02a834a270963388a50f6adfaf9b2a75a5dc757a0f6ebd57b769f76809c039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:825-840 | genesis/engine/solvers/rigid/constraint/solver.py:1044-1063 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f39099b110582a946faaaff406f969a70af5d09a43f4351763dd24aa3a7b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): genesis/utils/path_planning.py:389-408 | genesis/utils/path_planning.py:738-757 \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":"genesis/utils/path_planning.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f327ad5cdf64c4c27b2dbf632f8ba49e98771a2e7c8d92ae93fd64df0af08ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): genesis/engine/sensors/point_cloud_tactile.py:1073-1091 | genesis/engine/sensors/point_cloud_tactile.py:1112-1128 \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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e6a65145b490c7a4358dac68483609c3bd79142d8a268eeaadea287ccc6c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): genesis/engine/solvers/sph_solver.py:1050-1064 | genesis/engine/solvers/sph_solver.py:1216-1234 \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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb048983aad0bfd396c5c5a79229564f5e154c86af3096f7612f9af71ec8f320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): genesis/ext/pyrender/jit_render.py:978-996 | genesis/ext/pyrender/jit_render.py:1115-1133 \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 \u0060genesis/ext/pyrender/jit_render.py:978\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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68f0ecc4ec1d999fa59e26c3ef2a12c3a072c344321d421114a598f1e616244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): genesis/ext/pyrender/jit_render.py:999-1017 | genesis/ext/pyrender/jit_render.py:1136-1154 \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 \u0060genesis/ext/pyrender/jit_render.py:999\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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"68295682893955b8bd4269204e331d9b24a136e9459d43f54b4c6329cced8576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): genesis/engine/entities/rigid_entity/rigid_entity.py:2616-2633 | genesis/engine/entities/rigid_entity/rigid_entity.py:2638-2655 | genesis/engine/entities/rigid_entity/rigid_entity.py:2660-2678 | genesis/engine/entities/rigid_entity/rigid_entity.py:2683-2702 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb723127fb9efe6cde0e52a4211c2fcbc4e949844a6b1be5c88ddcfcfdce8666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): genesis/engine/sensors/kinematic_tactile.py:407-424 | genesis/engine/sensors/kinematic_tactile.py:679-695 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c162d6c84a070275cbdacfbec0565fd388443c243d3964e8507a1150b1378b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): genesis/ext/pyrender/jit_render.py:1400-1417 | genesis/ext/pyrender/jit_render.py:1425-1442 \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 \u0060genesis/ext/pyrender/jit_render.py:1400\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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9929d88a1dcb0e3e403512c7e1fa091746216218f3e06fb9635b8023c66aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): genesis/utils/path_planning.py:477-494 | genesis/utils/path_planning.py:844-861 \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":"genesis/utils/path_planning.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa4e3faf317bd4b93d817d6b4f69a6fd169427efc19cdf361b892c62113dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): genesis/engine/solvers/rigid/collider/diff_gjk.py:471-487 | genesis/engine/solvers/rigid/collider/epa.py:1073-1086 \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 \u0060genesis/engine/solvers/rigid/collider/diff_gjk.py:471\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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c750257451f4271ffed4c67fc0900a98e2d831684d9d05e139d128a7f57cf2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:610-626 | genesis/engine/solvers/rigid/collider/narrowphase.py:1040-1053 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a0c7910f5baec53c802942e2b008373ab35ab19de52f2519f3ad1e522f3272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:944-960 | genesis/engine/solvers/rigid/constraint/backward.py:1136-1151 \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 \u0060genesis/engine/solvers/rigid/constraint/backward.py:1136\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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b63a6b76e415c41e3715005f7a1449035164c9822536c6640d90733550fcb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): genesis/utils/particle.py:353-369 | genesis/utils/particle.py:377-393 \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":"genesis/utils/particle.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d5f7dfc254972958c89b50e41ff1277b56259947db463ce104fa14175f8c22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:5192-5207 | genesis/engine/couplers/sap_coupler.py:5233-5248 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":5192}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8e2f43870dc694e044a4ec9338a06ccbe44b06d03b7e91c97146a0d69dcad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): genesis/engine/solvers/rigid/collider/collider.py:1323-1338 | genesis/engine/solvers/rigid/collider/collider.py:1379-1394 \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 \u0060genesis/engine/solvers/rigid/collider/collider.py:1323\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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d60a980503da93a06da73177087595a9619f712acd6de4b169e291c240ff8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201316 lines \u00D7 4): genesis/engine/solvers/rigid/constraint/backward.py:920-933 | genesis/engine/solvers/rigid/constraint/backward.py:1084-1099 | genesis/engine/solvers/rigid/constraint/solver.py:1271-1274 | genesis/engine/solvers/rigid/constraint/solver.py:2011-2014 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. 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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a559e75769f59a35d148fc95670e1482167fb71da7e80fb646d27b487c8403f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:5276-5290 | genesis/engine/solvers/rigid/constraint/solver_breakdown.py:38-53 \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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:5276\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5276}}}],"partialFingerprints":{"codehealthFindingId/v1":"06373ffeffedfc893c55ba744f63d708e8f71e194eb3bc68a659381b9ea72545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): genesis/ext/pyrender/material.py:378-393 | genesis/ext/pyrender/material.py:587-602 \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, \u0060genesis/ext/pyrender/material.py:604\u0060 calls \u0060ones\u0060 and \u0060genesis/ext/pyrender/material.py:395\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":"genesis/ext/pyrender/material.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef294b34dbf0eb8271f0b4e6e12c0462b65864153388c860ed76320f7d1dd4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): genesis/engine/couplers/sap_coupler.py:6486-6499 | genesis/engine/couplers/sap_coupler.py:7035-7049 | genesis/engine/couplers/sap_coupler.py:7387-7400 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0cf8437f9d9c5d60b183f6e0dfee639fa217b0a702f1ebb867101fe3b2ced2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): genesis/engine/solvers/rigid/collider/collider.py:1234-1248 | genesis/engine/solvers/rigid/collider/collider.py:1335-1349 | genesis/engine/solvers/rigid/collider/collider.py:1391-1405 \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 \u0060genesis/engine/solvers/rigid/collider/collider.py:1234\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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d38d6c5160e40ea1abb217db5c1e711a02ff0be20addae1bb72d75059ea86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): genesis/engine/couplers/legacy_coupler.py:1190-1204 | genesis/engine/couplers/legacy_coupler.py:1431-1445 \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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f96bd59e54cfdd151b31994968ab71b714830cb57dd649f62535dc5d8a0d009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): genesis/engine/sensors/point_cloud_tactile.py:505-519 | genesis/engine/sensors/point_cloud_tactile.py:521-533 \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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2f2a9849adeeb88c37f0a745a32c4395341bca1d9d510b7d86fb1295393561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:684-698 | genesis/engine/solvers/rigid/collider/diff_gjk.py:706-716 \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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be0c5b2dfb4a3a1f3e14a5f1952228e44b364e6135a6aed2d6e71858a7fb25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): genesis/engine/solvers/rigid/collider/diff_gjk.py:449-463 | genesis/engine/solvers/rigid/collider/epa.py:1051-1065 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe31075a24ca7f4e2d1cc7ec1bfda387ccde2f9387bbac01440c0e90506cdb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:3739-3753 | genesis/engine/solvers/rigid/collider/narrowphase.py:3960-3974 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:3739\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3739}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3a702644baf2bd1bed6a21bc439e10392a89e12ee97246a57b3fc93f98724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2346-2359 | genesis/engine/solvers/rigid/constraint/solver.py:2713-2727 \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, \u0060genesis/engine/solvers/rigid/constraint/solver.py:2730\u0060 calls \u0060static\u0060 and \u0060genesis/engine/solvers/rigid/constraint/solver.py:2360\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"131049795152a4ba20bbb3e5408b20cb4244cab3bd98a5c695c96079687dab66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): genesis/utils/geom.py:1055-1069 | genesis/utils/geom.py:1167-1180 \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":"genesis/utils/geom.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"27731beeae0d9e498047c6232cae9c1f5a9076f296a0bb98234150e0a83cdc0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): genesis/engine/sensors/kinematic_tactile.py:341-354 | genesis/engine/sensors/kinematic_tactile.py:461-474 | genesis/engine/sensors/kinematic_tactile.py:565-578 | genesis/engine/sensors/kinematic_tactile.py:639-652 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1efafe02cb43d31488cd03a3acd24867047c1145cff0a73301112f4158fe28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/backward.py:498-508 | genesis/engine/solvers/rigid/constraint/backward.py:952-965 | genesis/engine/solvers/rigid/constraint/backward.py:1153-1162 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060genesis/engine/solvers/rigid/constraint/backward.py:1163\u0060 calls \u0060qd_vec3\u0060 and \u0060genesis/engine/solvers/rigid/constraint/backward.py:509\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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"a525c00f8998805161395dbfdcffde4bf394ffa0883bb8564701db8636c10dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:925-938 | genesis/engine/solvers/rigid/rigid_solver.py:1809-1822 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea53b5ce1e6af431efc94d62ff81d5b5337b13a60421aa676895874d1027046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:547-560 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:752-764 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc9bee8f3851cf4d0f0ce75fd8755522f16694056dc4f19314be382482986b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1044-1057 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1103-1115 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:1044\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"f751c71842e0b2b4a5e58f24013e47be6b9b2ab9e759781e419e0c4d80016df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): genesis/engine/solvers/rigid/collider/epa.py:67-80 | genesis/engine/solvers/rigid/collider/epa.py:991-1004 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdab3f78d7805071137a3b48a1f11c0582889ece0aa7c3434293e08ee1a6263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:3240-3252 | genesis/engine/solvers/rigid/collider/narrowphase.py:3838-3851 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"92115ff9f9a90d8c0b2a691cc8bd7bc8b14b74e5e589b6a86bb5fa1880270f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:804-817 | genesis/engine/solvers/rigid/constraint/linesearch.py:1013-1024 \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 \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:804\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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d8c86aee5649f66f6104339a968de33d32ac0e139a8f87a89b71d029ca62f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/noslip.py:64-77 | genesis/engine/solvers/rigid/constraint/noslip.py:105-112 \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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cc87103d29a75870480d24f41c0c63c4d44cdcb3c56cd74d63ab3be942a34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:5304-5317 | genesis/engine/solvers/rigid/constraint/solver_breakdown.py:77-88 \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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:5304\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3500f463934f1b25f25cc39e20bc6ae9c6b698f7b3fcd72b824619b34ac161cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:1793-1815 | genesis/engine/solvers/rigid/rigid_solver.py:1919-1940 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16938fb3d199705ddb6be44c05a349c137398011e15eb830f63619b3df1d0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): genesis/ext/isaacgym/terrain_utils.py:15-40 | genesis/utils/terrain.py:197-222 \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 \u0060genesis/ext/isaacgym/terrain_utils.py:15\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":"genesis/ext/isaacgym/terrain_utils.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57354f55a2e610694145bcfcc0dfdf9bb6eb610d282d3cd6624cc3c38ec8d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): genesis/ext/urdfpy/urdf.py:3040-3053 | genesis/ext/urdfpy/urdf.py:3124-3137 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":3040}}}],"partialFingerprints":{"codehealthFindingId/v1":"6105fc586a743337bdcd9890baccd2558ff149ead8a7f660850ea1643c8007ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/backward.py:1003-1015 | genesis/engine/solvers/rigid/constraint/backward.py:1201-1213 | genesis/engine/solvers/rigid/constraint/solver.py:1901-1913 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973a8b2982118d494cff6d0025f60aa8ad8911a8849723c6f996cde4c54bb75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/solver.py:2435-2447 | genesis/engine/solvers/rigid/constraint/solver.py:2606-2617 | genesis/engine/solvers/rigid/constraint/solver.py:2757-2766 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060genesis/engine/solvers/rigid/constraint/solver.py:2432\u0060 calls \u0060static\u0060 and \u0060genesis/engine/solvers/rigid/constraint/solver.py:2756\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da576ba2385bf24c8a55886280ae399177ccc6f721d651c1d2f8182b19fe1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): genesis/ext/isaacgym/terrain_utils.py:377-387 | genesis/utils/terrain.py:284-297 | genesis/utils/terrain.py:333-343 \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":"genesis/ext/isaacgym/terrain_utils.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd412e1512319395df07a1744e6f393ee9f69c7f3841f582b3ec447960d20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:2892-2904 | genesis/engine/solvers/fem_solver.py:2821-2833 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2892}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b0dcbe8d1010529ffb08075bb00e91d55b57d5aeb94063b0d61a403ba889f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6572-6584 | genesis/engine/couplers/sap_coupler.py:7101-7113 \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 \u0060genesis/engine/couplers/sap_coupler.py:6572\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4877bc0e6774a97959859b2fc184b62fe30ecaadc64c992a4826792209e26f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): genesis/engine/entities/rigid_entity/description.py:793-805 | genesis/engine/entities/rigid_entity/description.py:2031-2041 \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 \u0060genesis/engine/entities/rigid_entity/description.py:793\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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150397ce3f58d39beaa3753ab358eabf2990afed1cef5424c40013d7af07f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:954-963 | genesis/engine/solvers/rigid/rigid_solver.py:1884-1896 \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, \u0060genesis/engine/solvers/rigid/rigid_solver.py:1882\u0060 calls \u0060reset\u0060 and \u0060genesis/engine/solvers/kinematic_solver.py:953\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cce0a2945a9bfcb2618c3f03c86f894f8f1db5cce59677e3729d35b478305e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): genesis/engine/solvers/rigid/collider/diff_gjk.py:559-569 | genesis/engine/solvers/rigid/collider/epa.py:1190-1202 \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 \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 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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73c8d7ca11b4f9619e89507dd2db621ac81855f7e7171bf3acbc987b13c8b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:1706-1718 | genesis/engine/solvers/rigid/collider/narrowphase.py:4436-4448 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8af36d59935093956b98dedd1b6f0d8ed8d72a9aeb973efcade30740059345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:2810-2822 | genesis/engine/solvers/rigid/collider/narrowphase.py:3481-3492 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:2810\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbb9199173032d5753c08b8215162a67acecba2041f9eb0174d0516df0d0f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:640-649 | genesis/engine/solvers/rigid/constraint/solver.py:2174-2186 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10de40df5895cb38f9f00f4d96678d2c3c8db0d8f79644722a729017241c9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2627-2639 | genesis/engine/solvers/rigid/constraint/solver.py:2832-2844 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccbf6929701febfd0fd1a58985f7c5c9673683c5fd35cc2f6e2c5b42aea28c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:3107-3119 | genesis/engine/solvers/rigid/constraint/solver.py:3136-3148 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5a6087fc626dec96f4532504d7e73440176b1a41fbb43e7bf5730779f8fc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): genesis/engine/solvers/rigid/collider/epa.py:479-490 | genesis/engine/solvers/rigid/collider/epa.py:614-625 | genesis/engine/solvers/rigid/collider/epa.py:733-744 | genesis/engine/solvers/rigid/collider/epa.py:1275-1286 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0b9e01ee6f689f9f2de3ebb42586260aea56563e979c7ff0c16e448ac4219a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): genesis/engine/solvers/rigid/collider/epa.py:529-540 | genesis/engine/solvers/rigid/collider/epa.py:683-694 | genesis/engine/solvers/rigid/collider/epa.py:749-760 | genesis/engine/solvers/rigid/collider/epa.py:1288-1299 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfc11c6ffc9417ca90ebb9a0f54b40b6667184fe0f65ca09a5803c2a86f2920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/force_fields.py:103-114 | genesis/engine/force_fields.py:297-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/force_fields.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fe2403ddb4f5f0a67065ab1bf719fe696a380d5c73d73f0a359b231455769e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/pbd_solver.py:770-781 | genesis/engine/solvers/sph_solver.py:786-797 \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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a7c59f091aebe8b14a7f696933a259bf1230a4bc7c42d6ce7902dd87ad6a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/rigid/collider/epa.py:244-255 | genesis/engine/solvers/rigid/collider/epa.py:1249-1260 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbddf58c256f7f3cbb02922d1db029924b00d4d561f589b9ff80d143b7e00fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:2931-2942 | genesis/engine/solvers/rigid/collider/narrowphase.py:4371-4377 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea76c0191cb1991950de036487bd824f4df577cdc43dea6c3cb113b3136865a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:1360-1371 | genesis/engine/solvers/rigid/constraint/linesearch.py:1491-1502 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d706859981a8d798d320c9c409aa4d9ce60830977edc2743a4f63393114a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:1863-1874 | genesis/engine/solvers/rigid/rigid_solver.py:1997-2008 \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 \u0060genesis/engine/solvers/rigid/rigid_solver.py:1863\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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d6c8aa0b6ef91c18163f1078542625efa157df25729f864b21bd57ec827a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/utils/geom.py:1110-1121 | genesis/utils/geom.py:2079-2090 \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 \u0060genesis/utils/geom.py:1110\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":"genesis/utils/geom.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"db08af335bbc9a278e7d58e49e32f6e2851ab051f30ecf65678d816cc9bbf819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): genesis/utils/path_planning.py:417-434 | genesis/utils/path_planning.py:779-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/path_planning.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"286cfdf795c9c75553184edc2164cf9f573209d5417b045a7d3ec9c4a0d02bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): genesis/utils/path_planning.py:531-548 | genesis/utils/path_planning.py:913-930 \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":"genesis/utils/path_planning.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"013b320478acac2b5fac88ccf23d89b1fe6462f69109eedb5b3c5bb17ffb6d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): genesis/engine/couplers/sap_coupler.py:6536-6546 | genesis/engine/couplers/sap_coupler.py:7075-7084 | genesis/engine/couplers/sap_coupler.py:7435-7445 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060genesis/engine/couplers/sap_coupler.py:6547\u0060 calls \u0060tet_barycentric\u0060 and \u0060genesis/engine/couplers/sap_coupler.py:7446\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6536}}}],"partialFingerprints":{"codehealthFindingId/v1":"393eafa77eee1d8dadad4d1be9c96d0a9a6128269cc291bac92a4e0a668ef059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/backward.py:535-545 | genesis/engine/solvers/rigid/constraint/backward.py:983-992 | genesis/engine/solvers/rigid/constraint/backward.py:1190-1199 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0872275ff4a876222eb68ecc012c86ca9a3a587b93d2be177554ac932e775d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6568-6579 | genesis/engine/couplers/sap_coupler.py:7460-7470 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b8f10bf83a4bfb782ade360bb8f0020302d15fed8731f2e779d1a449afd8af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6569-6580 | genesis/engine/couplers/sap_coupler.py:6899-6909 \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, \u0060genesis/engine/couplers/sap_coupler.py:6910\u0060 calls \u0060u64\u0060 and \u0060genesis/engine/couplers/sap_coupler.py:6581\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f215abe8258ce2ffdab24a2d261a467c240bd8ae64dd55ef2e43066d2a5dc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/engine/entities/hybrid_entity.py:450-460 | genesis/engine/entities/hybrid_entity.py:537-547 \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":"genesis/engine/entities/hybrid_entity.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d47cea6503b28cb1af6a8579160a5f62346fb1a27ac1db8e59f7dc2fc66a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/engine/sensors/point_cloud_tactile.py:1208-1218 | genesis/engine/sensors/point_cloud_tactile.py:1454-1464 \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 \u0060genesis/engine/sensors/point_cloud_tactile.py:1208\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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24388ef715a9e4fdf64806714f876c863a7e3554ec33af15027f3b195d03816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): genesis/engine/solvers/fem_solver.py:1347-1353 | genesis/engine/solvers/fem_solver.py:1454-1464 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8965850df0eda8f4a5a228781b7cddcfafaf9193e239549e7c3448f98dcaefc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:1002-1015 | genesis/engine/solvers/rigid/rigid_solver.py:2198-2211 \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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"49020d2fb70bf52077602a8c19f0a6b2d639d84f9fa5c1fc263935663d7e9059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 5): genesis/engine/solvers/rigid/abd/forward_kinematics.py:378-381 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:919-922 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1221-1224 | genesis/engine/solvers/rigid/abd/manual_bw.py:237-252 | genesis/engine/solvers/rigid/abd/manual_bw.py:411-421 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060genesis/engine/solvers/rigid/abd/forward_kinematics.py:378\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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c940a186b21c77a7614d90232ddebe2a230dca60630d70e2e92fe7f10456c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): genesis/engine/solvers/rigid/collider/epa.py:128-138 | genesis/engine/solvers/rigid/collider/epa.py:1059-1068 \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 \u0060genesis/engine/solvers/rigid/collider/epa.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. 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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"548f1725c0c07c05a652ddeaef893ed47dfbaf0c49505b605558f040e14d8f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): genesis/engine/solvers/rigid/collider/mpr.py:108-117 | genesis/engine/solvers/rigid/collider/utils.py:24-34 \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":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e88e273799986db12e6809a2250da9adb23f7cad16ab9d3c26503f33df53238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:546-555 | genesis/engine/solvers/rigid/constraint/solver.py:1077-1087 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d700b813989cf39ffbe8aa2f88fb32a5bb76204895c1e7782151ec849b54264a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:970-980 | genesis/engine/solvers/rigid/constraint/backward.py:1175-1185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060genesis/engine/solvers/rigid/constraint/backward.py:1171\u0060 calls \u0060Vector\u0060 and \u0060genesis/engine/solvers/rigid/constraint/backward.py:968\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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"181c780c5f354f01221b6ff5084ab10528261527493cbd3f7f07cfa0590ddde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/island.py:284-294 | genesis/engine/solvers/rigid/constraint/island.py:501-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"da80deb51ae1bd3e57d0a2881f4d3c24d20eb0c8f7d6b0d1d921d42c626b0c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:4099-4109 | genesis/engine/solvers/rigid/constraint/solver.py:4174-4184 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4099}}}],"partialFingerprints":{"codehealthFindingId/v1":"09583d0546710a3e247f8397963284bfa40aee2b7c1a071a87321df4f3aaea02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): genesis/ext/pyrender/overlay/plugin.py:1125-1135 | genesis/ext/pyrender/overlay/plugin.py:1215-1225 \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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"714702976f5fe5b38fc77e929c36a5c64681235d5db4c27c6bd3f996a2dbfe96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): genesis/engine/couplers/sap_coupler.py:6571-6580 | genesis/engine/couplers/sap_coupler.py:6900-6909 | genesis/engine/couplers/sap_coupler.py:7100-7109 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060genesis/engine/couplers/sap_coupler.py:6910\u0060 calls \u0060u64\u0060 and \u0060genesis/engine/couplers/sap_coupler.py:6581\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a575db1572a3902436107326f93ad1bc83e733613e6550d3e9d90dee5c540a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): genesis/engine/solvers/pbd_solver.py:890-898 | genesis/engine/solvers/pbd_solver.py:922-931 | genesis/engine/solvers/pbd_solver.py:961-970 \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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ae35e39f846fc8748da908dd5e855fa76e734cc73ec1dec5167298bd06b7fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:941-950 | genesis/engine/solvers/kinematic_solver.py:989-998 \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 \u0060genesis/engine/solvers/kinematic_solver.py:941\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd21ae7538db9ca1471b60046d9402e2c4c95386b0c4b32ec669358c45d5851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:82-91 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:2377-2386 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa7539ea4dac8a507b97d95e38407ed27ee438bb6b0c171852f674622cd5be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1644-1655 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1692-1703 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:1644\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb29e23d9871293fec43843cfdf512a043fdd439d3113dad8f5920af6cffabf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:444-452 | genesis/engine/solvers/rigid/collider/box_contact.py:715-724 \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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5d4d3f81ba0bf1bf5bb9c4844ec9bc0a1a5ab4dd51f61161d135aafb5d12f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:1269-1274 | genesis/engine/solvers/rigid/constraint/linesearch.py:1383-1392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb104e5d33c93b0438addb6f7f3927495672ac7933aa1152234ffa0af3563cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:1293-1302 | genesis/engine/solvers/rigid/constraint/linesearch.py:1583-1592 \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 \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:1293\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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c668a6361042d279e6026d53c7392fad997444db7ad95e341f42f6359c0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:679-688 | genesis/engine/solvers/rigid/constraint/solver.py:706-714 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85fd63591332a28dc7cc65095e122306d77384d8d051006de8b725a0ecf34b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:5325-5334 | genesis/engine/solvers/rigid/constraint/solver.py:5571-5580 \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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:5325\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d65afc32a146cf5562159c66517b2d5948ce21728f5ad0fddf8bf63ce92b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:2479-2488 | genesis/engine/solvers/rigid/rigid_solver.py:2499-2508 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c63a41d3d8c5986f67cfbd6106060c0ef9c5dc984da0b0439579ed750f825b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:2812-2827 | genesis/engine/solvers/rigid/rigid_solver.py:2831-2846 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffed2c75cc1d6ad383c620fbb439e78d18344ed1543877708bb75118ac7c7498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): genesis/engine/solvers/sph_solver.py:859-868 | genesis/engine/solvers/sph_solver.py:950-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb969f60fbd47ebc0da6e01e1f26a84b59ad2d21d43033d3f9003369974c8526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/ext/pyrender/jit_render.py:477-486 | genesis/ext/pyrender/jit_render.py:497-506 \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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"105fe259b124187baf071c1ab47b659ec66f06f4e728b5fb39afff5447a798dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/ext/pyrender/scene.py:73-82 | genesis/ext/pyrender/scene.py:535-544 \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":"genesis/ext/pyrender/scene.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b9bc46c354beab0abc43893de05d81396df9c48b0da4156649f43a253e38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): genesis/utils/path_planning.py:362-371 | genesis/utils/path_planning.py:708-716 \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":"genesis/utils/path_planning.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca6364452b77b314d5702a17b3dd19df63d09fd21e27744d3e5094b888070c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/utils/sdf.py:333-342 | genesis/utils/sdf.py:415-426 \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":"genesis/utils/sdf.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8a7ef67ae375009583cbfdd7caf0282930ffadd5c54ba37886a31dcf53bcd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/backward.py:458-465 | genesis/engine/solvers/rigid/constraint/solver.py:808-816 | genesis/engine/solvers/rigid/constraint/solver.py:1029-1037 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e0528eb8affa3065a4a49ea3f96cca906d1d71eb1c4b6cf4efb79b8ee9446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/sensors/kinematic_tactile.py:757-766 | genesis/engine/sensors/kinematic_tactile.py:1016-1025 \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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db07a4211d68300c670f2f778577d3d78a5cdadecf5a3d52e2dd44d8bea5797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:994-1002 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1009-1017 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:994\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23f69fab8cd365bfd8d3dc0d1016a7638487ae53bb6860a985de9756bcf7ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1456-1464 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1542-1551 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71340b6d937a9f5cde0d66ea40cf6510673c154fbc2b222417f28caeae7c4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:1369-1377 | genesis/engine/solvers/rigid/collider/narrowphase.py:4295-4303 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"893bb7c312b83f49b8af3107d2df37fb669d875a71f3af10b4935db19f653442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:1212-1220 | genesis/engine/solvers/rigid/constraint/linesearch.py:1566-1574 \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 \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:1212\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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"13740a227d7cf0ff8d8143ac05d1c9f4b301b552d0898acd7d3280eab3e53bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/noslip.py:210-218 | genesis/engine/solvers/rigid/constraint/noslip.py:486-494 \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 \u0060genesis/engine/solvers/rigid/constraint/noslip.py:210\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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"825d049b8dcda2fe8aa0422ccafde8f21b5ca30048c6b4347d9b54dcd0a83c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2423-2431 | genesis/engine/solvers/rigid/constraint/solver.py:2488-2496 \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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:2423\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, \u0060genesis/engine/solvers/rigid/constraint/solver.py:2432\u0060 calls \u0060static\u0060 and \u0060genesis/engine/solvers/rigid/constraint/solver.py:2497\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e7b8f52ca3397fdef097f0e52d2b6f8582d03ae110dceae41c069517739eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2446-2457 | genesis/engine/solvers/rigid/constraint/solver.py:2616-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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e4384adbb567993b1ba1d20ce7069d5f70937a6c21b5856e4e086621be25d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2494-2502 | genesis/engine/solvers/rigid/constraint/solver.py:2754-2762 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b6099895df973a7707367754bd3ba4c8893e0b5822ac5272814f3c4000f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:3292-3300 | genesis/engine/solvers/rigid/constraint/solver.py:3340-3348 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e699dceeb72fdd8327d90aca819b6ab2fc0c7ad83c77fe84e60617ec5725e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/ext/urdfpy/urdf.py:658-666 | genesis/ext/urdfpy/utils.py:259-267 \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":"genesis/ext/urdfpy/urdf.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a17f780e3f88f98b451c59f9a9b3f94da5fb5eeb3705b4d7a43183cd3e6590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): genesis/utils/usd/usd_rigid_entity.py:507-515 | genesis/utils/usd/usd_rigid_entity.py:610-617 \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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97c3b520c3145e332f9ef22995683a38ea6e254142a6c8d0d762a2118407c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/vis/rasterizer_context.py:349-357 | genesis/vis/rasterizer_context.py:666-674 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65aa0fac607cfe9194c5848b5fda8e5834581c186d8c2db1b7c26fba4de7162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): genesis/engine/solvers/rigid/abd/forward_dynamics.py:545-552 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:750-757 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:905-912 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:913\u0060 calls \u0060SharedArray\u0060 and \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:555\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c1e2b2f4daffee45762203b551f200868201065ebeee19850b97464aeb9957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): genesis/engine/solvers/rigid/abd/forward_kinematics.py:650-657 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:888-896 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1044-1051 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060genesis/engine/solvers/rigid/abd/forward_kinematics.py:1040\u0060 calls \u0060template\u0060 and \u0060genesis/engine/solvers/rigid/abd/forward_kinematics.py:646\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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"079fb3c957e0135b409b0292fe619aca0c97a36d1a1bee290d3eb55d2727897b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/solver.py:2630-2637 | genesis/engine/solvers/rigid/constraint/solver.py:2698-2705 | genesis/engine/solvers/rigid/constraint/solver.py:2835-2842 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4d51360886d31cf1c79e31454192f913556d5ee78f9ee547149940efae7034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:1994-2001 | genesis/engine/couplers/sap_coupler.py:2054-2061 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"11734bb772c5b45e3cea67e05c4a9886997e532d608ae6eb3351532db5038c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6463-6470 | genesis/engine/couplers/sap_coupler.py:7363-7371 \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 \u0060genesis/engine/couplers/sap_coupler.py:6463\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abafc5b9421dd798c7a75474170bd680bdae84cacaef35c9d3c0b1658712f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/mesh.py:343-350 | genesis/engine/mesh.py:715-723 \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":"genesis/engine/mesh.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa7acb1431ecc369052764e5aedc2afaed6617495fe861cde89af8a2f462e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/mpm_solver.py:1385-1394 | genesis/engine/solvers/mpm_solver.py:1485-1494 \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 \u0060i_p\u0060 to \u0060int\u0060 in one and \u0060is_g2p_backward=True) for\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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1cc2e5c8546885b3beda34ca40903d95b668ef1c9f0a6e7e8f76739384e3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1233-1240 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1266-1273 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:1233\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98fe32e398924f3f55a1364436862dcb4ea22e2abe80d3c3ce5ca3143ab9137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_kinematics.py:339-346 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:370-377 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cf822b0b8c8332ef8ad29d631ddb9938af10ad17e278a4bb695593db718ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:467-474 | genesis/engine/solvers/rigid/collider/box_contact.py:758-765 \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 \u0060genesis/engine/solvers/rigid/collider/box_contact.py:467\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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b33fa8d4e7f25a9230442b6f5cb92c1a90a26dc84523bf8d899e56f9b2b95d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:1453-1460 | genesis/engine/solvers/rigid/collider/contact.py:1826-1833 \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, \u0060genesis/engine/solvers/rigid/collider/contact.py:1836\u0060 calls \u0060qd_block_max\u0060 and \u0060genesis/engine/solvers/rigid/collider/contact.py:1462\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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ad6b542cebc1b9a022756bcf4b5a1df574110537ecf67a0abc3248f2d5f079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:162-169 | genesis/engine/solvers/rigid/collider/narrowphase.py:930-937 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"349a0a9a627dd85619adba12762de65eb6c6734a24abdf2b125ca5c6b91a485c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:1163-1176 | genesis/engine/solvers/rigid/collider/narrowphase.py:1181-1188 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:1163\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f065391e6759ef50636f9959b8a5710104b6481d6c36bb1b669f23c8c72d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:804-811 | genesis/engine/solvers/rigid/constraint/solver.py:1507-1514 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04bf56733f8ad06be9504981e3917b4c79d9e0bf3b2e0bf7c1e23616a862d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:783-790 | genesis/engine/solvers/rigid/constraint/linesearch.py:912-919 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc6032de4cefff1129cedc7b01b3230e8b61ff57233b5c4b448319b4e96d543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/noslip.py:145-153 | genesis/engine/solvers/rigid/constraint/noslip.py:196-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060genesis/engine/solvers/rigid/constraint/noslip.py:145\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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1ef2ee85a735cf6a30547caff59fccf2fad3e7797355123812bc358d0ab3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/noslip.py:224-231 | genesis/engine/solvers/rigid/constraint/noslip.py:239-245 \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 \u0060genesis/engine/solvers/rigid/constraint/noslip.py:224\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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a38130061b86400e325ed384b00e95d54d2cd32c751ba38fea163b8c044b16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2541-2548 | genesis/engine/solvers/rigid/constraint/solver.py:5566-5576 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"914215e3555e0add2039c3dfd50c54c6e9c44c1d358bb2a6817639cba985bd68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/ext/pyrender/camera.py:181-188 | genesis/ext/pyrender/camera.py:381-388 \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":"genesis/ext/pyrender/camera.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc44c56bcd95753d2c74cfa94bd0a6787f1d568fa991787266010b033085311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/options/solvers.py:801-809 | genesis/options/solvers.py:879-887 \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":"genesis/options/solvers.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721870c97e9426b075bfd0c235d4e79bd849706a8a8e726fa295149d63d8732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): genesis/utils/geom.py:825-832 | genesis/utils/geom.py:855-861 \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":"genesis/utils/geom.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf2ad6d989f25c6a1e8615663f0d3ffcb76f8bc9a37342bc7fcdc63bbc31bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/utils/geom.py:2257-2264 | genesis/utils/geom.py:2293-2300 \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":"genesis/utils/geom.py"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1e66b0cf4e8c3747c60b923aa184ad3d3251b48c2392983ed5645ac0d25efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/utils/particle.py:194-201 | genesis/utils/particle.py:787-794 \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":"genesis/utils/particle.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d764f9d77c641ae414d2e40d79b33497832a4bab27eb351d813b2397d91fcef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/vis/rasterizer_context.py:1164-1171 | genesis/vis/rasterizer_context.py:1187-1194 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"afab6d872ef23d785fc9caae68276d3de19a935409fe4660bccdabe466d5e727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/vis/raytracer.py:276-283 | genesis/vis/raytracer.py:290-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/raytracer.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6babd3e3668a8a1bc2a076248bc70ebe8f797efb41b5e8665a1459da3a4212f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): genesis/utils/particle.py:193-199 | genesis/utils/particle.py:207-213 | genesis/utils/particle.py:786-792 | genesis/utils/particle.py:802-808 | genesis/utils/particle.py:822-828 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/particle.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2c754ec3f87294ecdc734a0f166d7a1e95ab368aecd654f27ff2e469619cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/solver.py:2092-2098 | genesis/engine/solvers/rigid/constraint/solver.py:5327-5333 | genesis/engine/solvers/rigid/constraint/solver.py:5573-5579 \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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:2092\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42099ffad90762263c2fa6a5318dc0544e71a49c3cc4157eefe334418b9a405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/solver.py:5114-5121 | genesis/engine/solvers/rigid/constraint/solver.py:5182-5189 | genesis/engine/solvers/rigid/constraint/solver.py:5227-5234 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"692bf730b6e9c28362e17dbcd6de338ba45d8d62eb50b21ece30a794633d4fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): genesis/options/surfaces.py:424-427 | genesis/options/surfaces.py:508-514 | genesis/options/surfaces.py:598-604 | genesis/options/surfaces.py:695-701 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"genesis/options/surfaces.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2659d9a75a000299dbba1b7cbfd277e442c5cdd069ff9e275f96fc782f8120b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/bvh.py:334-343 | genesis/engine/bvh.py:405-414 \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":"genesis/engine/bvh.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49a2c25c4e2f0dd3e316f2f8f36b3facda1a69fbc5432633047ef6d7b241f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/bvh.py:527-533 | genesis/engine/bvh.py:545-551 \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 \u0060genesis/engine/bvh.py:527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/bvh.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"8638eb7b27b3bace80ad78533bd5a44a8e2eb82d19d90d83edc72c49684788a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:3813-3819 | genesis/engine/couplers/sap_coupler.py:4798-4805 \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 \u0060genesis/engine/couplers/sap_coupler.py:3813\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3813}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a43d5b8b89a425cd5ce50ceb457ff6c15860255a775470807a766855e68f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:4520-4526 | genesis/engine/couplers/sap_coupler.py:4709-4715 \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 \u0060genesis/engine/couplers/sap_coupler.py:4520\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4520}}}],"partialFingerprints":{"codehealthFindingId/v1":"7386c551d0b08df1fbfb5e26353fd0d23c25436181afb930ec888238b4df2187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6441-6447 | genesis/engine/couplers/sap_coupler.py:6992-6998 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e56ca9603545d9c31a27c91c81cffe49adcd9e87fe91aa92f2087319a6b8185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6526-6537 | genesis/engine/couplers/sap_coupler.py:7425-7436 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed474290656659827131075b3769aea6df8401478d82ee3cfbc47b62bd8a5857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:214-220 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1799-1805 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a237705e4f15996731db119f0810da603200974c010d0874af495046da1465d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:630-639 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:971-977 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:630\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"75efe91cf25b1bad7a092c2680f8e51f04483446fb73be741c543f92d02460a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:780-786 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:856-862 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:780\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe623712fba11cf87e60106cc6ec9cbd1d3f3e5e34480a5bdb6b4fdd33e3d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/abd/inverse_kinematics.py:862-869 | genesis/engine/solvers/rigid/abd/inverse_kinematics.py:882-889 \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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b11f742dae8811c890e9b0fdf3a22bc98cb8f6e087ba35d5dcb1a6659ff7da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/abd/manual_bw.py:253-260 | genesis/engine/solvers/rigid/abd/manual_bw.py:422-429 \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 \u0060genesis/engine/solvers/rigid/abd/manual_bw.py:253\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":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a9a3502e63a1d0d81f0cd2644ea8a1809e016365583f317f2882c74d1f07b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:1429-1435 | genesis/engine/solvers/rigid/collider/contact.py:1793-1799 \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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"210d6e2fb29bf82a870f7f6a1d03dd91c22bfd116b1883eb199ea2780d3cfaac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:2802-2811 | genesis/engine/solvers/rigid/collider/narrowphase.py:4283-4289 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:2802\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"141024fd18f847c4d0619b5c90c3c164e5bd7f1a30e7376c5fae3f5945bef9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:4561-4569 | genesis/engine/solvers/rigid/collider/narrowphase.py:4619-4627 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:4561\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c172227b599e52cd3f8fdb965e208c12dd6190bb9d6f0948773390c64ce1a748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:239-245 | genesis/engine/solvers/rigid/constraint/solver.py:4837-4843 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c7dc325d6e815c1e3afe0e1858e0da640217ef505c5c0313c2420fe32169b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:871-879 | genesis/engine/solvers/rigid/constraint/linesearch.py:1073-1081 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"33783f9dca083cf50c665873be53081c5b7abb72fc82f1a7553aa8d4d5a1e7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:1125-1131 | genesis/engine/solvers/rigid/constraint/linesearch.py:1605-1611 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c7d1c0a7a5af784206359b2ad2f99a57571aedeba6c58ced8b60f0f48e3145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:3184-3193 | genesis/engine/solvers/rigid/constraint/solver.py:3199-3208 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae25578fac1d14ad2f01e22831cd05a16aa57f134f69f6b17a6e6a170abdbec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/solver.py:3254-3260 | genesis/engine/solvers/rigid/constraint/solver.py:3308-3315 | genesis/engine/solvers/rigid/constraint/solver.py:3385-3391 \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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:3254\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f488575b07ab63840da5d3935ea97bd41219a2f8e793f99be372110573dfbab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:1822-1830 | genesis/engine/solvers/rigid/rigid_solver.py:1962-1968 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b67befa19f4988badabb1f01b114944ac4a73c2d67b3ab959c603289d96f3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/utils/urdf.py:351-359 | genesis/utils/urdf.py:363-369 \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 \u0060genesis/utils/urdf.py:351\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":"genesis/utils/urdf.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc80b7b92cdae78ec59b097a162053a9241078ceee00fb179720171950834bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/vis/rasterizer_context.py:1055-1061 | genesis/vis/rasterizer_context.py:1078-1084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"211c0448fe2c176e623317fd9e0a003a0545068fe50fb79476ca58578e78fcf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): genesis/engine/solvers/rigid/abd/accessor.py:284-290 | genesis/engine/solvers/rigid/abd/accessor.py:330-335 | genesis/engine/solvers/rigid/abd/accessor.py:373-378 \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 \u0060genesis/engine/solvers/rigid/abd/accessor.py:284\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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"697dddc77fe57d92e361bf47e29e70009c1fe8f4638fa3cc1a71fc1c3e82e80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/solver.py:4094-4101 | genesis/engine/solvers/rigid/constraint/solver.py:4169-4176 | genesis/engine/solvers/rigid/constraint/solver.py:4607-4614 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":4094}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e866e32e60f70d5ef4d3ea39e48eb1bc4c395448bee316a0744672e3758f70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): genesis/utils/geom.py:1064-1069 | genesis/utils/geom.py:1175-1180 | genesis/utils/geom.py:1250-1256 \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":"genesis/utils/geom.py"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"438671c9cd2fe1e1ffaae0c3ddb5baca3cdd280818c7ad12ccc6990a29ce7db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): genesis/utils/watertighten.py:101-108 | genesis/utils/watertighten.py:110-117 | genesis/utils/watertighten.py:119-126 \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":"genesis/utils/watertighten.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cd0726029dfff2974b5ca0e5f3c96fde636f4d39c1450f0eb5e1febe42e348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:4286-4291 | genesis/engine/couplers/sap_coupler.py:4344-4349 \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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdc04a39e7fa3e8279b818ebb6b7e52b2c81f87891b4dee797007f03a3e7175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/couplers/sap_coupler.py:6557-6565 | genesis/engine/couplers/sap_coupler.py:7452-7457 \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, \u0060genesis/engine/couplers/sap_coupler.py:6554\u0060 calls \u0060dot\u0060 and \u0060genesis/engine/couplers/sap_coupler.py:7449\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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6557}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8600c1227ba1cbeb3689ffccfb4433472e66fb357bbc4973744a0f92b4635b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/entities/rigid_entity/description.py:1223-1228 | genesis/engine/entities/rigid_entity/description.py:1785-1790 \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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca43a4d22329354feef8d1872e3624db130e7da2dd9a8d7109b411ae83c607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/entities/rigid_entity/description.py:1428-1433 | genesis/engine/entities/rigid_entity/description.py:1977-1982 \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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fd322e42f16579181166a35b62df7fe7132d8cfde1e9e5d24dc3950ae42943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/fem_solver.py:2666-2671 | genesis/engine/solvers/fem_solver.py:2788-2793 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2666}}}],"partialFingerprints":{"codehealthFindingId/v1":"812f9f0219c5a610e0f07dac2e0e77f664620bb9364a954b7fade03e1bbc4276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/pbd_solver.py:786-792 | genesis/engine/solvers/sph_solver.py:802-808 \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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"241a59de928cec1d48d64328952189a31cf420d4d01c15a2e0f6ace66eef78f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/accessor.py:47-52 | genesis/engine/solvers/rigid/abd/accessor.py:214-219 \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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e875c7ecafce75b7702104e8005844b3c516ae0b3a44374be303d4ba22070c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/accessor.py:75-80 | genesis/engine/solvers/rigid/abd/accessor.py:258-263 \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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2c54226b65d976bcfc718c9d867cfa419d8700bf73d9654c9e34ac9b6a021f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1066-1071 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1124-1129 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:1066\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"961901ac7f43d842203ae2b9b04ceb75366cc94c51cf3a548a8e2866e4535d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1723-1729 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:2205-2210 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a968fcea87825cd1a395fc4c982fadf20d9afac32df50e4126d48f82bac933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_kinematics.py:614-620 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:694-700 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"3720b739fb6aad8e996627ab24d20baa0f40acf58ee520d7f318e0003cfb21ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_kinematics.py:934-946 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1247-1260 \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 \u0060genesis/engine/solvers/rigid/abd/forward_kinematics.py:934\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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f9b8de372431a8dedc14140e06b0b40a32fb528668837d9728ef41b333c57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/misc.py:523-528 | genesis/engine/solvers/rigid/abd/misc.py:564-569 \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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"51945b27368e9272539628ff3c04bf4a0b40a1db482ddf1bf5e52ed2e91410fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:457-462 | genesis/engine/solvers/rigid/collider/box_contact.py:745-754 \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 \u0060genesis/engine/solvers/rigid/collider/box_contact.py:457\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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"775310ab76851ff66b14268607f5fbe0915af10a02f47de5593e92b000e84b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:626-637 | genesis/engine/solvers/rigid/collider/box_contact.py:641-652 \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 \u0060genesis/engine/solvers/rigid/collider/box_contact.py:626\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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6543c6b91b61908076b00c6de271d1f051c2fd28742ba8c0364d9de3dfda27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:688-693 | genesis/engine/solvers/rigid/collider/box_contact.py:698-703 \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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ce656091ee3a4f71151a7959021d467ee7148d503ed92faa977a17c47861c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/collider/capsule_contact.py:43-50 | genesis/engine/solvers/rigid/collider/capsule_contact.py:188-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/capsule_contact.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc41a98076913b50aaa9dd8a9eaf5fdfaddefd0357f75dea78360cebbb60a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:4295-4300 | genesis/engine/solvers/rigid/collider/narrowphase.py:4985-4999 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:4985\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45c0a4d9242756363cc86b589bc91df2c7f24389b4729e8def5d3c3540a2119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:817-823 | genesis/engine/solvers/rigid/constraint/solver.py:1517-1523 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"725d5f6434a72c98de2a446f85178e043874269c9684aca78dcdc57df9e1118d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:686-691 | genesis/engine/solvers/rigid/constraint/linesearch.py:731-737 \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 \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:731\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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"51de9bdedc08d28685983415211176f820aadc7751651720b04d19ed102db114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:1291-1296 | genesis/engine/solvers/rigid/constraint/linesearch.py:1417-1422 \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 \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:1291\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, \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:1423\u0060 calls \u0060Vector\u0060 and \u0060genesis/engine/solvers/rigid/constraint/linesearch.py:1297\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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1514491ff1724a51ac0c9502bdc38aa5e753c243a2265c09461d4d113d8afbc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:5119-5127 | genesis/engine/solvers/rigid/constraint/solver.py:5232-5240 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1186a420eda251d2d20f71bb00003008ac5ed8df3fea0f4ee86d47648c33971b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): genesis/utils/geom.py:263-268 | genesis/utils/geom.py:293-298 | genesis/utils/geom.py:1189-1190 \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":"genesis/utils/geom.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"987b70a85cede4ad46836afde68a15ab979f6b306ab65cf352ed8deb903d80dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/utils/path_planning.py:587-593 | genesis/utils/path_planning.py:976-982 \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, \u0060genesis/utils/path_planning.py:973\u0060 calls \u0060info\u0060 and \u0060genesis/utils/path_planning.py:583\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":"genesis/utils/path_planning.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d1ea12d774624f46b05882c3e5b44caa82e8a325311b7e13bd63f39f0c0c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/utils/sdf.py:355-360 | genesis/utils/sdf.py:455-460 \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 \u0060genesis/utils/sdf.py:355\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, \u0060genesis/utils/sdf.py:354\u0060 calls \u0060qd_float\u0060 and \u0060genesis/utils/sdf.py:454\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":"genesis/utils/sdf.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adff764f8461a1975ab97117163a029f95f2a603d40f8477e17702c3f205402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/utils/urdf.py:338-344 | genesis/utils/urdf.py:356-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/urdf.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"472635c6757404f78554bd2b36b511e42a2c4ad6d5bb7d6fe531b0b1de1e7396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): genesis/engine/solvers/rigid/constraint/backward.py:551-555 | genesis/engine/solvers/rigid/constraint/backward.py:1010-1015 | genesis/engine/solvers/rigid/constraint/backward.py:1208-1213 | genesis/engine/solvers/rigid/constraint/solver.py:1082-1087 | genesis/engine/solvers/rigid/constraint/solver.py:1908-1913 \u2014 there are 5 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 5 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, \u0060genesis/engine/solvers/rigid/constraint/backward.py:550\u0060 calls \u0060qd_float\u0060 and \u0060genesis/engine/solvers/rigid/constraint/backward.py:1009\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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"814413c7319cc7bc72a801432d434beb7856653be2108f528cb142514292c32f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): genesis/utils/particle.py:209-214 | genesis/utils/particle.py:244-249 | genesis/utils/particle.py:804-809 | genesis/utils/particle.py:824-829 | genesis/utils/particle.py:834-839 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/particle.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb309af6a5efcfeb8ec8ec7d5d682c67e8849a99e97f93403b1cda4679697df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): genesis/engine/solvers/rigid/abd/accessor.py:74-79 | genesis/engine/solvers/rigid/abd/accessor.py:181-186 | genesis/engine/solvers/rigid/abd/accessor.py:257-262 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060genesis/engine/solvers/rigid/abd/accessor.py:188\u0060 calls \u0060static\u0060 and \u0060genesis/engine/solvers/rigid/abd/accessor.py:80\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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"345fb6b41f1289c848fd38615f1b4aad15a7e8c1eb6641cb0479628e09888af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/engine/solvers/rigid/abd/forward_kinematics.py:115-119 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:160-164 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:198-202 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b990b0452076729aef3caf708bc98aec9b30ab85b995c101b493dd35ef4f46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/engine/solvers/rigid/collider/narrowphase.py:1154-1158 | genesis/engine/solvers/rigid/collider/narrowphase.py:1175-1179 | genesis/engine/solvers/rigid/collider/narrowphase.py:1187-1191 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cffa5f1adfcb21e5cff9fa0f031037a022b5039e2c191d4bdb3815670ee72c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): genesis/engine/solvers/rigid/collider/narrowphase.py:2807-2813 | genesis/engine/solvers/rigid/collider/narrowphase.py:3478-3484 | genesis/engine/solvers/rigid/collider/narrowphase.py:4285-4291 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff32de01007ac6f2747eb5ee8c56c923445f775efb13572d1c6ad21a657dc2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/backward.py:551-555 | genesis/engine/solvers/rigid/constraint/backward.py:1283-1288 | genesis/engine/solvers/rigid/constraint/solver.py:1082-1087 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64d44907e3e52a037c0c3861d0118ae332d8b6e6480fa36c6aa40917784b86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/engine/solvers/rigid/constraint/linesearch.py:1242-1246 | genesis/engine/solvers/rigid/constraint/linesearch.py:1366-1370 | genesis/engine/solvers/rigid/constraint/linesearch.py:1497-1501 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7333618d4a235cf665fbb48d50ce86ca898d65207d633b53699f7fd8e17d8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/utils/watertighten.py:361-365 | genesis/utils/watertighten.py:373-377 | genesis/utils/watertighten.py:385-389 \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":"genesis/utils/watertighten.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d783cc33a10e78cd855db6b13de2185c7301f38e524111d2972b9f7ed4cd0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/vis/rasterizer_context.py:768-772 | genesis/vis/rasterizer_context.py:851-855 | genesis/vis/rasterizer_context.py:934-939 \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 \u0060genesis/vis/rasterizer_context.py:768\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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f52afed731df1dd4ea0af9ae1886f69813586ae79588991b4a7cde9dd56223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/vis/rasterizer_context.py:1165-1169 | genesis/vis/rasterizer_context.py:1188-1192 | genesis/vis/rasterizer_context.py:1202-1208 \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 \u0060genesis/vis/rasterizer_context.py:1165\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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0be206835d4fd336f32c66cee7d7f2753d4402c950d40e0fa34ff52bcc4bcd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/couplers/legacy_coupler.py:2663-2668 | genesis/engine/solvers/sph_solver.py:761-766 \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 \u0060genesis/engine/couplers/legacy_coupler.py:2663\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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ad15126a6aa4c7ef505b855a5d345d14a91db208d2bccd55fa605d414d4fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/entities/rigid_entity/rigid_geom.py:282-288 | genesis/engine/entities/rigid_entity/rigid_link.py:509-515 \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 \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":"genesis/engine/entities/rigid_entity/rigid_geom.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3500076d6c31355bbf13d3c77b10912ee796ae9616570b07b653b0726157422d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 5): genesis/engine/sensors/camera.py:106-107 | genesis/engine/sensors/camera.py:294-295 | genesis/engine/sensors/camera.py:520-524 | genesis/engine/sensors/camera.py:618-622 | genesis/engine/sensors/camera.py:656-657 \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. 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":"genesis/engine/sensors/camera.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9568af618ec7d673e86520eba0c73de9903c8e500f70c09550b3c14606d21412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:819-825 | genesis/engine/solvers/rigid/rigid_solver.py:1256-1262 \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 \u0060genesis/engine/solvers/kinematic_solver.py:819\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bade3606870304d6c447ec4e53e2c1c3a8d98568d512f86c47df7df0d576f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/pbd_solver.py:1009-1013 | genesis/engine/solvers/sph_solver.py:1169-1173 \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 \u0060genesis/engine/solvers/pbd_solver.py:1009\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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dfb3384886abe22f3b94d09b0b7273c4fcbcca22044f4cb7b4682237f847e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): genesis/engine/solvers/rigid/abd/accessor.py:795-797 | genesis/engine/solvers/rigid/abd/accessor.py:813-817 | genesis/engine/solvers/rigid/abd/accessor.py:832-836 \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 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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbfe18d0cdaf8d261417a93c474f2dcb30846ba18308e74d47ec6c8e83c65c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:597-601 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:619-623 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"00da62b2fb880d74eecf37934d5f85467e0a5cf8cb72aa2d8ff8a78888c57ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1059-1064 | genesis/engine/solvers/rigid/abd/forward_dynamics.py:1117-1122 \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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1828d46a4833c7ae7b37dce614311e1ffd6fd990e13d3d202fff4d2b37ff77aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_dynamics.py:1784-1789 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1226-1231 \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 \u0060genesis/engine/solvers/rigid/abd/forward_dynamics.py:1784\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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"105f1e645ce55c17b64b6bb90264bd5a3438a6ac8d0ac716cadd7b9c063d1291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:425-429 | genesis/engine/solvers/rigid/collider/box_contact.py:682-686 \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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea263c628e840ce946547ffe32c18cb74af4f9f9a86591b62b3fd3dac5d0a399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/collider/box_contact.py:511-516 | genesis/engine/solvers/rigid/collider/box_contact.py:792-797 \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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c992c8f47352909d6cc3039e1409c61c5c4a981312b3947bf42b4dac07b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): genesis/engine/solvers/rigid/collider/collider.py:1048-1056 | genesis/engine/solvers/rigid/constraint/solver.py:433-440 \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, \u0060genesis/engine/solvers/rigid/collider/collider.py:1045\u0060 calls \u0060tolist\u0060 and \u0060genesis/engine/solvers/rigid/constraint/solver.py:431\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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1190d51db17e14511dba37b2301e750fe44977e270bd9af66512232aa5c7ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:353-359 | genesis/engine/solvers/rigid/collider/contact.py:376-382 \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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9452fc6c78a127e902bcec94b32a234c4686a4f3ee769a4e6783352d30e7bc25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/collider/epa.py:699-704 | genesis/engine/solvers/rigid/collider/epa.py:759-764 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44b7d1447c0501d9c23f97c979b499afa3409dc65b36e2c60f8277eb9a77d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/collider/mpr.py:612-616 | genesis/engine/solvers/rigid/collider/mpr.py:620-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"372a4fabbd34b8534b3c3caa2d5b94481268edfc65d6ffab5ebbafe987731753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:554-558 | genesis/engine/solvers/rigid/constraint/solver.py:878-882 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b41acd8e1aaaa88a9309b51c65613a16b3db19762eed924e09b6cc8926173e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:943-948 | genesis/engine/solvers/rigid/constraint/linesearch.py:1137-1142 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d525301b4c4664170af47fde37ca27be0a42876c18e4f0c2e3614cdc2448db90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:2595-2600 | genesis/engine/solvers/rigid/constraint/solver.py:2751-2756 \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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2efac5840f9704bc1be7ebc82bba2d5826c9b8208c47e6e32005f632de102d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/solver.py:5293-5298 | genesis/engine/solvers/rigid/constraint/solver_breakdown.py:54-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 \u0060genesis/engine/solvers/rigid/constraint/solver.py:5293\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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcdf8b7f4b8b6f962a0b6498699eab9a7c980789aa5ff9742f04be277917fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): genesis/ext/isaacgym/terrain_utils.py:355-370 | genesis/utils/terrain.py:264-279 \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":"genesis/ext/isaacgym/terrain_utils.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26781bca81d2112c9205350f8f4aa35b5fd6d0fb736fec2b54d5b2236c3eeb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/vis/camera.py:642-646 | genesis/vis/camera.py:648-652 | genesis/vis/camera.py:653-657 \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 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, \u0060genesis/vis/camera.py:642\u0060 calls \u0060raise_exception\u0060 and \u0060genesis/vis/camera.py:653\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":"genesis/vis/camera.py"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"202a2d292c160874fa02dffa1cd761d1968c2f0fcb7f4d2629b51c926383b1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/entities/fem_entity.py:114-119 | genesis/engine/entities/mpm_entity.py:21-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/fem_entity.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72bb96511433ff3cfe3775fde83da49d753fd1183df292310e56620a102647f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): genesis/engine/entities/fem_entity.py:484-498 | genesis/engine/entities/fem_entity.py:502-515 | genesis/engine/entities/particle_entity.py:323-338 | genesis/engine/entities/particle_entity.py:374-389 | genesis/engine/entities/particle_entity.py:439-454 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/fem_entity.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ef1c8ef0679cdddca5290e36cca177f9fa4f5f18d387d5ba4a956be7fdaf81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): genesis/engine/solvers/fem_solver.py:1124-1143 | genesis/engine/solvers/mpm_solver.py:636-655 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7c39a68d2ac98fa5bf41e45fe09b4bd29ab537927c1558ec426a7692827b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/fem_solver.py:1147-1158 | genesis/engine/solvers/mpm_solver.py:664-675 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c79b39119fd3f4e1dead592735d3afa4d521eecc1e38405cf3b3c223a46e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): genesis/engine/solvers/fem_solver.py:1162-1173 | genesis/engine/solvers/mpm_solver.py:683-694 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b07ccddf582d20ddbc4622c28f3801a68a10ca6c8d86c569fb51b110f18034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/ext/pyrender/font.py:22-26 | genesis/ext/pyrender/shader_program.py:20-24 \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":"genesis/ext/pyrender/font.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"07992827c9a0f5d58b0e973b575b4c014d5eb7da4b5e4f9ba8373a6c41eb3800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/ext/pyrender/font.py:45-50 | genesis/ext/pyrender/shader_program.py:68-73 \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":"genesis/ext/pyrender/font.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf4f54306723f96e2dfeb96bdb5cc908dd5dbc28da5246725fa7084351dfb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/bvh.py:316-320 | genesis/engine/bvh.py:387-391 \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":"genesis/engine/bvh.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fc883b71bc50688884344139ce1e782262aa1f559f3a88ec6a8b67d1e64531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/entities/particle_entity.py:262-267 | genesis/engine/entities/particle_entity.py:281-286 \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":"genesis/engine/entities/particle_entity.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90f96963711254be567c0de31dc529eecd281a988661c0f45aec452895be0e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/entities/particle_entity.py:271-276 | genesis/engine/entities/pbd_entity.py:194-199 \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":"genesis/engine/entities/particle_entity.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f16e8390d0ca991bf22d1ead9e0676810b8a062717f91f19ab662403c9e2a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): genesis/engine/entities/rigid_entity/rigid_entity.py:805-813 | genesis/engine/entities/rigid_entity/rigid_link.py:190-198 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1839c73882ae07bb45943f63495e454176beba89ed0fd0f3e365bfb729b0be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/sensors/kinematic_tactile.py:1133-1138 | genesis/engine/sensors/point_cloud_tactile.py:2083-2088 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fec2b64127ce8305a6d608006734f282069abd396755f3de7694391f7805ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/sensors/tactile_shared.py:644-648 | genesis/engine/sensors/tactile_shared.py:653-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/tactile_shared.py"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a98e78e5ba461db894b164b55a85da16aaffd61e94821b8d951174ce760004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/fem_solver.py:2343-2348 | genesis/engine/solvers/fem_solver.py:2566-2571 \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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadbe79c72f930cda99402fb974f7691fd63d99a7a3aab4018912cfbfca4f636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/kinematic_solver.py:1074-1078 | genesis/engine/solvers/rigid/rigid_solver.py:2431-2435 \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, \u0060genesis/engine/solvers/rigid/rigid_solver.py:2428\u0060 calls \u0060_wake_dofs\u0060 and \u0060genesis/engine/solvers/kinematic_solver.py:1071\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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"060a787e173b47e21aae9f79152a08a083da9eb00e7af3abba2179ad47f52946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/mpm_solver.py:1318-1322 | genesis/engine/solvers/mpm_solver.py:1435-1439 \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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"874b55dbe448b929894142b1a82d6f43ac586b85e3c2bc4ab9c45b88f7fbd2d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/engine/solvers/mpm_solver.py:1600-1605 | genesis/engine/solvers/sph_solver.py:1392-1397 \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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"397328fe79e89df6d8620c7b21114aa6b1839e5aed5c91d1e7c8a5b190f0983c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/particle_solver.py:369-373 | genesis/engine/solvers/particle_solver.py:400-404 \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":"genesis/engine/solvers/particle_solver.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce93cffc891f4d7117612c180853e9c9c15a5b15e19098a3a3b7b32c920f5352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): genesis/engine/solvers/pbd_solver.py:841-845 | genesis/engine/solvers/pbd_solver.py:905-909 | genesis/engine/solvers/pbd_solver.py:939-943 | genesis/engine/solvers/pbd_solver.py:975-979 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060genesis/engine/solvers/pbd_solver.py:902\u0060 calls \u0060qd_float\u0060 and \u0060genesis/engine/solvers/pbd_solver.py:973\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":"genesis/engine/solvers/pbd_solver.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a98482b86bbf00639d3350510612149226de6c5e7056f606649599b46ae475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): genesis/engine/solvers/rigid/abd/forward_kinematics.py:86-90 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:143-147 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:179-183 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:1302-1306 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"66522e73aab385f89e633a074a57b99e3d880d6fb80e25d4fc3540459f30854b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/abd/forward_kinematics.py:363-369 | genesis/engine/solvers/rigid/abd/forward_kinematics.py:387-393 \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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d07bd302fde80877c37341b3e6a70d48e9ca235ce69868d8f2eb35bf1b67c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/engine/solvers/rigid/abd/forward_kinematics.py:442-446 | genesis/engine/solvers/rigid/abd/inverse_kinematics.py:145-149 | genesis/engine/solvers/rigid/abd/manual_bw.py:38-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0799a7313f26b40128ade0b3d78c68cf28f5bdc07f426796df47bb68f7c39b44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/abd/manual_bw.py:107-113 | genesis/engine/solvers/rigid/abd/manual_bw.py:130-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":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d5851fdd09ceb15f3d33d661e8818b776f57c8a1061618ae32298a90996555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/abd/misc.py:822-826 | genesis/engine/solvers/rigid/abd/misc.py:853-857 \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":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d641c6687078bc6a661dcff3c770ef959c68b9eea89c57ff84abc276228bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): genesis/engine/solvers/rigid/collider/contact.py:568-575 | genesis/engine/solvers/rigid/collider/diff_gjk.py:340-347 \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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed27b035baab46ef009ceaf90273b567b370a4b3516d7036a14e3948ab225828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): genesis/engine/solvers/rigid/collider/epa.py:232-237 | genesis/engine/solvers/rigid/collider/epa.py:1159-1164 | genesis/engine/solvers/rigid/collider/epa.py:1213-1218 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c688479d0c3ddaace8c016a47e65fdf659df1db7f863f0d14f67fd6fd441769c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/collider/epa.py:892-898 | genesis/engine/solvers/rigid/collider/epa.py:1324-1330 \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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ca5ebbd7dc544ab383c0ee00ff1eb618cf0890b442f0c13340518a270bc23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:136-140 | genesis/engine/solvers/rigid/collider/narrowphase.py:922-926 \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 \u0060genesis/engine/solvers/rigid/collider/narrowphase.py:136\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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec375f073be6d1e62af23bc1b0bff6049b9dff959d3084f090c66ffa4edfa552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:2349-2355 | genesis/engine/solvers/rigid/collider/narrowphase.py:2371-2377 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ef1e609c1bb1b13c41c2378519646df3e559a644b6042c0e985c7a90c3f75a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/collider/narrowphase.py:4499-4503 | genesis/engine/solvers/rigid/collider/narrowphase.py:4795-4799 \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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4499}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ef2fbdf3552f9c12a09c48fc78b633b5de908f31b568311e0c5b81c3598761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:687-691 | genesis/engine/solvers/rigid/constraint/backward.py:738-742 \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, \u0060genesis/engine/solvers/rigid/constraint/backward.py:744\u0060 calls \u0060dot\u0060 and \u0060genesis/engine/solvers/rigid/constraint/backward.py:692\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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8d4ca188db054e10b3f38c3de58b8b3711c1358d36b06b67ec12cc892be751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:935-941 | genesis/engine/solvers/rigid/constraint/backward.py:1111-1117 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bef321c8a41e04fad97a368da2b47ca688f11dceafa2931de1c77807adf5e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/backward.py:1054-1058 | genesis/engine/solvers/rigid/constraint/backward.py:1437-1441 \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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf29de95ab74b74d9ea4db73f284b8b4af4cd76064de06dcde3e1aa2e38f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/island.py:419-423 | genesis/engine/solvers/rigid/constraint/island.py:444-448 \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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7bffe7044f3257d468ae3feb70373bba55ecef186682fa07db222a12d7119c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/engine/solvers/rigid/constraint/linesearch.py:652-656 | genesis/engine/solvers/rigid/constraint/linesearch.py:1166-1170 \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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d8f199802b3ef48ff3cf5c4c5e5f9a6e6f7a8b0b79c7d554c0cfac1c16b8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/engine/solvers/rigid/rigid_solver.py:2514-2520 | genesis/engine/solvers/rigid/rigid_solver.py:2536-2542 \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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a1da9518821dce784057b51bc16f243331bb691a59d897601d30f102af1db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): genesis/utils/mesh.py:1259-1263 | genesis/utils/mesh.py:1280-1284 | genesis/utils/mesh.py:1301-1305 | genesis/utils/mesh.py:1367-1371 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"genesis/utils/mesh.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a25ced147688ed33b7e4e73e0186704d80808671303d62cbb7e82fa28334d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/utils/path_planning.py:336-341 | genesis/utils/path_planning.py:680-685 \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 \u0060genesis/utils/path_planning.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/path_planning.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"da129332ee3fd37874ce1f6b30e936651271c2350061f94eb8a76d111dc79c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/utils/path_planning.py:602-607 | genesis/utils/path_planning.py:1001-1006 \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":"genesis/utils/path_planning.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"8003092c0d57dd37b1fbf704637587af822ed0cfc10028664696961751b95a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/utils/usd/usd_rigid_entity.py:145-150 | genesis/utils/usd/usd_rigid_entity.py:153-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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e922fdf3c513e94e795332e1ce22b0c70bce50f289cf7c6e1c946ad175e0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): genesis/vis/rasterizer_context.py:690-694 | genesis/vis/rasterizer_context.py:1013-1017 | genesis/vis/rasterizer_context.py:1021-1025 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"642f5d4b2349fdd8e7597f726abf8422ed0004afa295cf453eae61c2453e0693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): genesis/vis/rasterizer_context.py:802-808 | genesis/vis/rasterizer_context.py:885-891 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"49266ce5e54de94ed5453fb991a58e466f987af6c4722ea1987eb09cd079767b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): genesis/vis/rasterizer_context.py:913-917 | genesis/vis/rasterizer_context.py:1048-1052 \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 \u0060genesis/vis/rasterizer_context.py:913\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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de175c60de012dc13a468956a2e9eb5880c87e09facdcd6ce8f0398b63c043a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): genesis/vis/rasterizer_context.py:1156-1161 | genesis/vis/rasterizer_context.py:1174-1179 \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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ad8403ed031e3a12c9f8bbe1545f5ef04d91ab0b19dfc63e0b4eb58fafba58"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): examples/sap_coupling/franka_grasp_fem_sphere.py:8-89 | examples/sap_coupling/franka_grasp_rigid_cube.py:7-83 \u2014 These two members are variants of one another: 62 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/sap_coupling/franka_grasp_fem_sphere.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db737f30473dd956022b4746ae32413ec05f90ce0c43066e319031dd48eb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): examples/sap_coupling/fem_fixed_constraint.py:14-80 | examples/sap_coupling/fem_sphere_and_cube.py:8-71 \u2014 These two members are variants of one another: 38 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/sap_coupling/fem_fixed_constraint.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b792829d4ef7792d4f64091bf94d4c2e0164686ad3400d80acce29c038a9fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (29 shared lines): examples/rigid/ik_duck.py:9-70 | examples/rigid/ik_franka.py:9-71 \u2014 These two members are variants of one another: 29 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/rigid/ik_duck.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8b0a6ade40e770361771ae7f6da1dfcb798daf906554f926aa57b1cfda1f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): examples/coupling/fem_cube_linked_with_arm.py:11-130 | examples/coupling/grasp_soft_cube.py:9-104 | examples/rigid/control_franka.py:9-110 | examples/rigid/grasp_bottle.py:9-115 | examples/rigid/suction_cup.py:7-129 | examples/sensors/imu_franka.py:12-137 \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/coupling/fem_cube_linked_with_arm.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe910172478d0a44d33e1ea5bf20af9c562612cbc18b60616d548325adf4168"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 60\u002B corresponding lines): examples/coupling/cut_dragon.py:7-72 | examples/coupling/sph_mpm.py:8-71 | examples/coupling/sph_rigid.py:8-67 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 60 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/coupling/cut_dragon.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8330b56b736c529fb7759309841f1b9b8d5d1ec18249718c5a472442bbf65344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): examples/rigid/rolling_coast.py:47-101 | examples/rigid/torsional_grasp.py:48-100 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rigid/rolling_coast.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7105ff63798c3de002a48aed91496b80af57dbf874958b4b5a95e15280792364"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): examples/drone/hover_train.py:115-157 | examples/locomotion/go2_train.py:143-172 \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":"examples/drone/hover_train.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"769faf16df710c8d9ccaa69250b9bd343708c4c3c8139748c945de86bc846e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): examples/rigid/gravity_compensation.py:7-50 | examples/rigid/nonconvex_mesh.py:7-40 | examples/rigid/single_franka.py:7-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 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/rigid/gravity_compensation.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"92346c63ccb4d694f1aaf3c75bfd9a82efe88834fee4b799af05c7f5a60abdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): examples/manipulation/grasp_eval.py:23-34 | examples/manipulation/grasp_eval.py:38-49 \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":"examples/manipulation/grasp_eval.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f19a15a4fd006c48b4fe741b95c76aff13d8af797f8577fa2a407275d4d34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): examples/rigid/ik_custom_chain.py:9-35 | examples/rigid/ik_shadow_hand.py:9-35 \u2014 before extracting anything, compare \u0060examples/rigid/ik_custom_chain.py\u0060 and \u0060examples/rigid/ik_shadow_hand.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 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 \u0060examples/rigid/ik_custom_chain.py:9\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/rigid/ik_custom_chain.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17e12aefb57ec960f4cc0614f545638eea53c69dc4263e0462c9038b06d8220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): examples/rigid/ik_custom_chain.py:25-50 | examples/rigid/ik_shadow_hand.py:46-70 \u2014 before extracting anything, compare \u0060examples/rigid/ik_custom_chain.py\u0060 and \u0060examples/rigid/ik_shadow_hand.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 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 \u0060examples/rigid/ik_custom_chain.py:25\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/rigid/ik_custom_chain.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a355333eeddd7c9d24b9658c0b4da8a56d9fc1a1e1100d0ed01c496de1d07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): examples/sensors/imu_franka.py:19-40 | examples/sensors/joint_torque_franka.py:35-57 \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/sensors/imu_franka.py:19\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":"examples/sensors/imu_franka.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f8e99de9e2e7e4c3db55e2c2a3ae6facc68dc3d6183290db321c87a6f4efcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): examples/sap_coupling/franka_grasp_fem_sphere.py:30-51 | examples/sap_coupling/franka_grasp_rigid_cube.py:26-47 \u2014 before extracting anything, compare \u0060examples/sap_coupling/franka_grasp_fem_sphere.py\u0060 and \u0060examples/sap_coupling/franka_grasp_rigid_cube.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 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 \u0060examples/sap_coupling/franka_grasp_fem_sphere.py:30\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/sap_coupling/franka_grasp_fem_sphere.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"817c433706f83deffb359f5ce6f552ad683138479e9196b92551e10c851d1e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/rigid/single_franka.py:17-37 | examples/rigid/single_franka_envs.py:28-48 \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/rigid/single_franka.py:17\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/rigid/single_franka.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a9ba58687ae002e87fcd848f69726c3682dda847b7960b28a5d718af2c2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/rigid/terrain_height_field.py:13-33 | examples/rigid/terrain_subterrain.py:12-32 \u2014 before extracting anything, compare \u0060examples/rigid/terrain_height_field.py\u0060 and \u0060examples/rigid/terrain_subterrain.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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, \u0060examples/rigid/terrain_height_field.py:34\u0060 calls \u0060zeros\u0060, \u0060arange\u0060, \u0060choice\u0060 and \u0060examples/rigid/terrain_subterrain.py:33\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/rigid/terrain_height_field.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f0e646d38084f8d6aeed6cbcadbaa34b3f906f7a7ae14d77d6b41911d17c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/sap_coupling/franka_grasp_fem_sphere.py:8-27 | examples/sap_coupling/franka_grasp_rigid_cube.py:7-26 \u2014 before extracting anything, compare \u0060examples/sap_coupling/franka_grasp_fem_sphere.py\u0060 and \u0060examples/sap_coupling/franka_grasp_rigid_cube.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 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 \u0060examples/sap_coupling/franka_grasp_fem_sphere.py:8\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, \u0060examples/sap_coupling/franka_grasp_fem_sphere.py:28\u0060 calls \u0060FEMOptions\u0060 and \u0060examples/sap_coupling/franka_grasp_rigid_cube.py:27\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/sap_coupling/franka_grasp_fem_sphere.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef538a3f3d5d5c07dfd2cb80c2c13900e0e74f8018737ce736a0031bc10265f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): examples/coupling/fem_cube_linked_with_arm.py:22-40 | examples/deformable/fem_hard_and_soft_constraint.py:24-41 \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/coupling/fem_cube_linked_with_arm.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b9f6cab1e3c97e960f1a0675be3a5f552a047eccbafa06f8f9223a0ceeb5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): examples/kinematic/go2_kinematic.py:54-73 | examples/sensors/depth_camera_custom_vverts.py:137-155 \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/kinematic/go2_kinematic.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdba1a71af8db5c487cfcf1ed60fcf445371cea6432a6fbd1c752d03ea521e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): examples/rigid/ik_franka.py:23-41 | examples/rigid/ik_franka_batched.py:29-46 \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/rigid/ik_franka.py:23\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/rigid/ik_franka.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ea6955c808f99222117bbcde94e9215907bce0ae3794d73d6fdc7081d632b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): examples/rigid/hibernation.py:102-118 | examples/rigid/wrecking_ball.py:223-239 \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/rigid/hibernation.py:102\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/rigid/hibernation.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0314dc59654c52b4130a5a1b8069843c894caadcbd4d51b4a5baef009fca3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): examples/rigid/suction_cup.py:87-98 | examples/rigid/suction_cup.py:108-124 \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/rigid/suction_cup.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rigid/suction_cup.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4722adfb7e8a6474ef9ab95bcd4a50f73bccff3eed9a9c81458e6ddd877d2a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): examples/drone/fly.py:17-32 | examples/rigid/control_franka.py:17-32 \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/drone/fly.py:17\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/drone/fly.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8013f055683cc1f8b8a1169b258dba7ffde64d42b9c97b6420dbb481b547007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): examples/rigid/diffik_controller.py:49-61 | examples/rigid/ik_franka.py:30-45 \u2014 before extracting anything, compare \u0060examples/rigid/diffik_controller.py\u0060 and \u0060examples/rigid/ik_franka.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rigid/ik_franka.py:30\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/rigid/diffik_controller.py:49\u0060 calls \u0060add_entity\u0060 and \u0060examples/rigid/ik_franka.py:30\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/rigid/diffik_controller.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afd5c96ff445d5a4699a912927a52db4b5c0fb4d5891ff3be888d4bfb54bc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): examples/rigid/accelerometer_duck.py:7-21 | examples/rigid/control_franka.py:9-23 | examples/rigid/control_mesh.py:7-21 | examples/rigid/set_phys_attr.py:9-23 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rigid/accelerometer_duck.py:7\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/rigid/accelerometer_duck.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"245f924c5eb9b8bd72a246a40e28addfe017a64995e06f6836f83d53ac60c803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/coupling/flush_cubes.py:22-36 | examples/coupling/sand_wheel.py:24-38 \u2014 before extracting anything, compare \u0060examples/coupling/flush_cubes.py\u0060 and \u0060examples/coupling/sand_wheel.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/coupling/flush_cubes.py:22\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/coupling/flush_cubes.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e230fc7038238391d93f6935230791a3321eb91463b0d09ba5e1d9cb39e86f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/rigid/control_franka.py:15-29 | examples/rigid/grasp_bottle.py:17-31 \u2014 before extracting anything, compare \u0060examples/rigid/control_franka.py\u0060 and \u0060examples/rigid/grasp_bottle.py\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060examples/rigid/control_franka.py:15\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/rigid/grasp_bottle.py:11\u0060 calls \u0060add_argument\u0060 and \u0060examples/rigid/control_franka.py:10\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/rigid/control_franka.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"173175ade1ba583d5498db2cadccc7f6f312e1977492699ddbc34102269f4d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): examples/rigid/gravity_compensation.py:10-23 | examples/rigid/nonconvex_mesh.py:10-23 | examples/rigid/single_franka.py:10-23 \u2014 before extracting anything, compare \u0060examples/rigid/gravity_compensation.py\u0060 and \u0060examples/rigid/nonconvex_mesh.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rigid/gravity_compensation.py:10\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/rigid/gravity_compensation.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b286a68bb0d3f2fec320fc1acb9ab9205d93feb4684e61210ef7163f1388c3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/coupling/sand_wheel.py:61-74 | examples/coupling/sand_wheel.py:85-98 \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/coupling/sand_wheel.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/coupling/sand_wheel.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ff619820526e8ef6990d995491b0dac183f7b6a3ad746aea49bcdc11df7673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/sap_coupling/fem_fixed_constraint.py:46-59 | examples/sap_coupling/fem_sphere_and_cube.py:50-63 \u2014 before extracting anything, compare \u0060examples/sap_coupling/fem_fixed_constraint.py\u0060 and \u0060examples/sap_coupling/fem_sphere_and_cube.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/sap_coupling/fem_fixed_constraint.py:46\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/sap_coupling/fem_fixed_constraint.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c1644641e591398d087d5421b3228656e1e96aec8f7b9729de0150bd5a6e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): examples/drone/fly.py:17-29 | examples/rigid/control_franka.py:17-29 | examples/rigid/grasp_bottle.py:19-31 \u2014 before extracting anything, compare \u0060examples/rigid/control_franka.py\u0060 and \u0060examples/rigid/grasp_bottle.py\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060examples/drone/fly.py:17\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/drone/fly.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33a6f3987a5f9f9c5aede73cdb5be3e9cba6597e16a981e8fad8f44d9645df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): examples/rendering/moving_camera.py:15-26 | examples/rigid/single_franka.py:15-27 | examples/rigid/single_franka_envs.py:26-38 \u2014 before extracting anything, compare \u0060examples/rendering/moving_camera.py\u0060 and \u0060examples/rigid/single_franka.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/rendering/moving_camera.py:15\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/rendering/moving_camera.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed42261e8b597a02a066c9052b0977faeddd7586eb563a639307aad57969dc69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): examples/rigid/friction_breakaway.py:37-58 | examples/rigid/rolling_coast.py:22-43 | examples/rigid/torsional_grasp.py:23-44 \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. 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/rigid/friction_breakaway.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cac676c2b53eed657a7e48095dbbd1d490c42a1e439af6dcb1decfc7b7d4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): examples/rigid/ik_custom_chain.py:15-27 | examples/rigid/ik_shadow_hand.py:15-27 | examples/rigid/nonconvex_mesh.py:14-26 \u2014 before extracting anything, compare \u0060examples/rigid/ik_custom_chain.py\u0060 and \u0060examples/rigid/ik_shadow_hand.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 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 \u0060examples/rigid/ik_custom_chain.py:15\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/rigid/ik_custom_chain.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fa9d7fd9140371452fccb818ee5b757ad9b78aa37ccc3c20b72bb290672d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): examples/coupling/cloth_attached_to_rigid.py:37-46 | examples/coupling/cloth_on_rigid.py:23-35 \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/coupling/cloth_attached_to_rigid.py:37\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/coupling/cloth_attached_to_rigid.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"302b498efdd435d968b9d6c3ef0f0b3faefbbfb5697f9bbe7755aaadf9b12a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/coupling/cloth_on_rigid.py:19-31 | examples/coupling/water_wheel.py:31-43 \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/coupling/cloth_on_rigid.py:19\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/coupling/cloth_on_rigid.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f4ca3831dff16fe8b3e6f3dc9a48bf36e7f2c326645bb4d593d23cbb419044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/drone/hover_eval.py:47-59 | examples/locomotion/go2_eval.py:36-48 \u2014 before extracting anything, compare \u0060examples/drone/hover_eval.py\u0060 and \u0060examples/locomotion/go2_eval.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/drone/hover_eval.py:47\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/drone/hover_eval.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a5e256daf48119e9bae4030308091a935783729c1e48fa81a4c7b0548221b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/rigid/apply_external_wrench.py:8-20 | examples/rigid/merge_entities.py:18-30 \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/rigid/apply_external_wrench.py:8\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/rigid/merge_entities.py:17\u0060 calls \u0060add_argument\u0060 and \u0060examples/rigid/apply_external_wrench.py:7\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/rigid/apply_external_wrench.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae29baae217ca9fc58b986ebf871abfbb98092a37d49cd2ad9373af6f6631e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/rigid/screw_constraint.py:28-40 | examples/tutorials/position_control_comparison.py:18-30 \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/rigid/screw_constraint.py:28\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/rigid/screw_constraint.py:27\u0060 calls \u0060add_argument\u0060 and \u0060examples/tutorials/position_control_comparison.py:17\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/rigid/screw_constraint.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2822b5f0ce42a37814f270a362cd3de4b84fbc98f93ae2b77abb20859910dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/sap_coupling/fem_fixed_constraint.py:14-26 | examples/sap_coupling/fem_sphere_and_cube.py:8-20 \u2014 before extracting anything, compare \u0060examples/sap_coupling/fem_fixed_constraint.py\u0060 and \u0060examples/sap_coupling/fem_sphere_and_cube.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/sap_coupling/fem_fixed_constraint.py:28\u0060 calls \u0060Elastic\u0060 and \u0060examples/sap_coupling/fem_sphere_and_cube.py:22\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/sap_coupling/fem_fixed_constraint.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483248523c66d07b3af9192e1e3f272e8dcf2f802ad2ae27d23d5ac443358a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): examples/sap_coupling/fem_fixed_constraint.py:30-42 | examples/sap_coupling/fem_sphere_and_cube.py:22-32 \u2014 before extracting anything, compare \u0060examples/sap_coupling/fem_fixed_constraint.py\u0060 and \u0060examples/sap_coupling/fem_sphere_and_cube.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/sap_coupling/fem_fixed_constraint.py:30\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/sap_coupling/fem_fixed_constraint.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e25b76104ca28b218af3f6424c7ebe9df348f1a0ed6eb259fbc48927a91fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): examples/rendering/moving_camera.py:14-25 | examples/rigid/gravity_compensation.py:14-25 | examples/rigid/single_franka.py:14-25 \u2014 before extracting anything, compare \u0060examples/rendering/moving_camera.py\u0060 and \u0060examples/rigid/single_franka.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/rendering/moving_camera.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"353d14a997192837ff4d1348b5ccc3340aee4c5e9b05f65e6307c250395b542c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): examples/rigid/ik_duck.py:14-25 | examples/rigid/ik_franka.py:14-25 | examples/rigid/ik_franka_batched.py:15-26 \u2014 before extracting anything, compare \u0060examples/rigid/ik_duck.py\u0060 and \u0060examples/rigid/ik_franka.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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 \u0060examples/rigid/ik_duck.py:14\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/rigid/ik_duck.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b960e11850186e277fd50750bc9861c8e6701b9a293a95b065dee4a7b8abc1be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/coupling/grasp_soft_cube.py:15-26 | examples/coupling/sand_wheel.py:16-27 \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/coupling/grasp_soft_cube.py:15\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/coupling/grasp_soft_cube.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0245eafde96ac774820df76d43a34eb04168c05fbfd648e284e320000126a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/ipc/ipc_robot_cloth_teleop.py:101-112 | examples/ipc/ipc_robot_cloth_teleop.py:120-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/ipc/ipc_robot_cloth_teleop.py:101\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/ipc/ipc_robot_cloth_teleop.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129a69147e66a0ee8bf7146ee4062d757e4d8c707fd3bfc1a23b41fa89e426c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/locomotion/go2_env.py:243-254 | examples/manipulation/grasp_env.py:238-249 \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/locomotion/go2_env.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b6072790b5ea8f954e7f81090fed024386bfbbbe56ab625410fca3c11e354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/rendering/demo.py:70-81 | examples/rendering/demo.py:118-129 \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/rendering/demo.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":"examples/rendering/demo.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed57ce4c215dafa9b656b94d044ed8e097b3b2778fe31d70098207e97f6f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): examples/rendering/moving_camera.py:12-23 | examples/rigid/closed_loop.py:26-36 \u2014 before extracting anything, compare \u0060examples/rendering/moving_camera.py\u0060 and \u0060examples/rigid/closed_loop.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/rendering/moving_camera.py:12\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/rendering/moving_camera.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fd28339bc69e21c0c41436feab2ebc58b7a993e83d11f1518da252bd9c9541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/rigid/ik_franka_batched.py:35-46 | examples/rigid/ik_shadow_hand.py:32-44 \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/rigid/ik_franka_batched.py:35\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/rigid/ik_franka_batched.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6945a3ad8f503c7b780b4612d3912d8ef5c8419adea2a4445617d88c2234fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): examples/rigid/merge_entities.py:23-34 | examples/rigid/screw_constraint.py:33-42 \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/rigid/merge_entities.py:23\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/rigid/merge_entities.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"70edc27f510e62e944354f5233134417d81088a95f75b17e92bb88a8484a9948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/coupling/cloth_attached_to_rigid.py:36-46 | examples/coupling/cloth_on_rigid.py:22-32 | examples/coupling/water_wheel.py:34-44 \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/coupling/cloth_attached_to_rigid.py:36\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/coupling/cloth_attached_to_rigid.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7820202be3d09507ff183a6b74f37773ec9e79befe067cec66684d2724b2cad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/coupling/cut_dragon.py:9-19 | examples/coupling/flush_cubes.py:10-20 | examples/coupling/sand_wheel.py:12-22 \u2014 before extracting anything, compare \u0060examples/coupling/cut_dragon.py\u0060 and \u0060examples/coupling/flush_cubes.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/coupling/cut_dragon.py:9\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/coupling/cut_dragon.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7759aa94209bb1bc35c71017e707fac86935fc2de9aca882413b3ae3ccf278d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/rendering/demo.py:82-92 | examples/rendering/demo.py:94-104 | examples/rendering/demo.py:106-116 \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/rendering/demo.py:82\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/rendering/demo.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"530df53242c2880de0e9a33c298ea90320b04c2c96e9a1b188433cf5086c07f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/rendering/moving_camera.py:10-20 | examples/rigid/closed_loop.py:24-34 | examples/usd/import_stage.py:50-60 \u2014 before extracting anything, compare \u0060examples/rendering/moving_camera.py\u0060 and \u0060examples/rigid/closed_loop.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/rendering/moving_camera.py:10\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/usd/import_stage.py:49\u0060 calls \u0060add_argument\u0060 and \u0060examples/rigid/closed_loop.py:23\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/rendering/moving_camera.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c57de48446150a5200a4a5c4dd99f0e12ddc9eb21004b217e47dddf1b04fdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/rigid/apply_external_wrench.py:16-26 | examples/rigid/diffik_controller.py:24-34 \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/rigid/apply_external_wrench.py:16\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/rigid/apply_external_wrench.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"53461741f46e6d038a0c9c6afe09c34e3158e0364ed20f241d7e30515589fa7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/sap_coupling/franka_grasp_fem_sphere.py:61-75 | examples/sap_coupling/franka_grasp_rigid_cube.py:55-69 \u2014 before extracting anything, compare \u0060examples/sap_coupling/franka_grasp_fem_sphere.py\u0060 and \u0060examples/sap_coupling/franka_grasp_rigid_cube.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 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 \u0060examples/sap_coupling/franka_grasp_fem_sphere.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/sap_coupling/franka_grasp_fem_sphere.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbdf135582c890ef3f3564716b7b9b6c51a00bbcfa8e93100defb2e26a62d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): examples/sensors/imu_franka.py:15-17 | examples/sensors/surface_distance_shadowhand.py:36-46 | examples/sensors/tactile_franka.py:187-197 \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/sensors/surface_distance_shadowhand.py:36\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/sensors/surface_distance_shadowhand.py:36\u0060 calls \u0060add_argument\u0060 and \u0060examples/sensors/imu_franka.py:15\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/sensors/imu_franka.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"874332fc96f844c994d30f9d6c7a0a885f8b46baa73ed06b3b94c856c896a887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): examples/coupling/cut_dragon.py:9-18 | examples/coupling/flush_cubes.py:10-19 | examples/coupling/sand_wheel.py:12-21 | examples/coupling/sph_mpm.py:10-19 | examples/coupling/water_wheel.py:16-25 \u2014 before extracting anything, compare \u0060examples/coupling/cut_dragon.py\u0060 and \u0060examples/coupling/flush_cubes.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/coupling/cut_dragon.py:9\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/coupling/cut_dragon.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"725d4ea385365d73b8d714913cd3ec603f3e1a453aca3ef8fab598874d61e374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): examples/rendering/moving_camera.py:10-19 | examples/rigid/closed_loop.py:23-33 | examples/usd/import_stage.py:50-59 | examples/viewer_plugin/mouse_interaction.py:18-27 \u2014 before extracting anything, compare \u0060examples/rendering/moving_camera.py\u0060 and \u0060examples/rigid/closed_loop.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/rendering/moving_camera.py:10\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/usd/import_stage.py:49\u0060 calls \u0060add_argument\u0060, \u0060parse_args\u0060 and \u0060examples/rigid/closed_loop.py:23\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/rendering/moving_camera.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7bafc73aca8c4a9de15ec5a2e9c8b54385d8054784a724997215189143237d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): examples/rigid/apply_external_wrench.py:12-21 | examples/rigid/merge_entities.py:22-31 | examples/rigid/screw_constraint.py:32-41 | examples/tutorials/position_control_comparison.py:22-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rigid/apply_external_wrench.py:12\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/rigid/merge_entities.py:17\u0060 calls \u0060add_argument\u0060 and \u0060examples/rigid/apply_external_wrench.py:7\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/rigid/apply_external_wrench.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5622089bfa4f9f7dfe32dba0a1bab1e5fd1148753f5632e767dbd0d812dd31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 4): examples/rigid/franka_cube.py:61-70 | examples/rigid/suction_cup.py:91-97 | examples/rigid/suction_cup.py:107-113 | examples/rigid/suction_cup.py:117-123 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rigid/franka_cube.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c5ff8750049fcbf75e4fa9ca438d6ee306ea4018a01a352604a8bde9b09663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): examples/collision/contype.py:37-46 | examples/collision/contype.py:49-58 | examples/collision/contype.py:61-70 \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/collision/contype.py:37\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/collision/contype.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5eef363cab3269050defbaabdb139267aec982670a63e54fdaa5ff8d3bee94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/rendering/demo.py:44-55 | examples/rendering/demo.py:141-150 \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/rendering/demo.py:44\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/rendering/demo.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1e6fb67ed6df97f3dad3664a0bf76948785dfa6ad749795838700cdb9d1a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/rigid/ik_duck.py:41-50 | examples/rigid/ik_franka.py:38-47 \u2014 before extracting anything, compare \u0060examples/rigid/ik_duck.py\u0060 and \u0060examples/rigid/ik_franka.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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 \u0060examples/rigid/ik_duck.py:41\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/rigid/ik_duck.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2913c1bc4c4752a31af92666bcfb1a492508519ba1f29f42f35201acf4d8f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/rigid/rolling_coast.py:47-56 | examples/rigid/torsional_grasp.py:48-57 \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/rigid/rolling_coast.py:47\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/rigid/rolling_coast.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4630293d4ea5f984728776fb12b5acc643f14e2f0eda8958a9f3a6c5ec08f6ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): examples/coupling/cut_dragon.py:8-16 | examples/coupling/flush_cubes.py:9-17 | examples/coupling/sand_wheel.py:11-19 | examples/coupling/sph_mpm.py:9-17 | examples/coupling/sph_rigid.py:9-17 | examples/coupling/water_wheel.py:15-23 | examples/deformable/differentiable_push.py:11-19 \u2014 before extracting anything, compare \u0060examples/coupling/cut_dragon.py\u0060 and \u0060examples/coupling/flush_cubes.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/coupling/cut_dragon.py:8\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/coupling/cut_dragon.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d23816763360f8aecac42fb0240ccc52ef3791b4b53b77f84f16b8e8d4b697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): examples/rendering/moving_camera.py:14-23 | examples/rigid/closed_loop.py:28-36 | examples/rigid/gravity_compensation.py:14-23 | examples/rigid/nonconvex_mesh.py:14-23 | examples/rigid/single_franka.py:14-23 \u2014 before extracting anything, compare \u0060examples/rendering/moving_camera.py\u0060 and \u0060examples/rigid/closed_loop.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/rendering/moving_camera.py:14\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/rendering/moving_camera.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36489572e1fcc7c487590391fd39b99c9cc54b41937106db700ca3ef149cee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): examples/rigid/suction_cup.py:9-17 | examples/rigid/terrain_height_field.py:12-20 | examples/rigid/terrain_subterrain.py:11-19 | examples/tutorials/position_control_comparison.py:17-25 \u2014 before extracting anything, compare \u0060examples/rigid/terrain_height_field.py\u0060 and \u0060examples/rigid/terrain_subterrain.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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 \u0060examples/rigid/suction_cup.py:9\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/rigid/suction_cup.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"50314c749f4d20cc30df7cc715de3496dbfda211cf7a9f0ac87379b384106a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): examples/rigid/diffik_controller.py:53-61 | examples/rigid/ik_duck.py:39-48 | examples/rigid/ik_franka.py:36-45 \u2014 before extracting anything, compare \u0060examples/rigid/diffik_controller.py\u0060 and \u0060examples/rigid/ik_franka.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rigid/diffik_controller.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/rigid/diffik_controller.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2459ee1a5d9e18a3fca180b6c4603733aedf3a3e6975def8ccef2a5d6b31d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/deformable/pbd_liquid.py:10-18 | examples/rigid/domain_randomization.py:11-19 \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/deformable/pbd_liquid.py:10\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/deformable/pbd_liquid.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d0de7511ab72721ad33de71584f08663244876634b751c800b6d8a7e1a6eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): examples/coupling/cut_dragon.py:8-15 | examples/coupling/flush_cubes.py:9-16 | examples/coupling/sand_wheel.py:11-18 | examples/coupling/sph_mpm.py:9-16 | examples/coupling/sph_rigid.py:9-16 | examples/coupling/water_wheel.py:15-22 | examples/deformable/differentiable_push.py:11-18 | examples/deformable/pbd_liquid.py:10-17 | examples/rigid/domain_randomization.py:11-18 \u2014 before extracting anything, compare \u0060examples/coupling/cut_dragon.py\u0060 and \u0060examples/coupling/flush_cubes.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/coupling/cut_dragon.py:8\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 after the matched lines, \u0060examples/deformable/pbd_liquid.py:19\u0060 calls \u0060PBDOptions\u0060 and \u0060examples/deformable/differentiable_push.py:19\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/coupling/cut_dragon.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be149da4b9c73f6860ea712853701c9be2a5df41eb1969d4959a79990ce8d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): examples/coupling/rigid_mpm_attachment.py:18-25 | examples/rigid/suction_cup.py:9-16 | examples/rigid/terrain_height_field.py:12-19 | examples/rigid/terrain_subterrain.py:11-18 | examples/tutorials/position_control_comparison.py:17-24 \u2014 before extracting anything, compare \u0060examples/rigid/terrain_height_field.py\u0060 and \u0060examples/rigid/terrain_subterrain.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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 \u0060examples/coupling/rigid_mpm_attachment.py:18\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":"examples/coupling/rigid_mpm_attachment.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"43765ba9909bf905f674941e5e1f66c5f0a59a17cf5ad6cb0c57ca834bc0dedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 3): examples/rigid/grasp_bottle.py:74-74 | examples/rigid/grasp_bottle.py:83-89 | examples/rigid/grasp_bottle.py:100-107 \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/rigid/grasp_bottle.py:83\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/rigid/grasp_bottle.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a870e7f6b2dfc6d3aad644f4bbb4752e4308ea1b3e69658b3b55d21fc172e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): examples/coupling/rigid_mpm_attachment.py:17-23 | examples/rigid/gravity_compensation.py:8-14 | examples/rigid/nonconvex_mesh.py:8-14 | examples/rigid/single_franka.py:8-14 | examples/rigid/suction_cup.py:8-14 | examples/rigid/terrain_from_mesh.py:11-17 | examples/rigid/terrain_height_field.py:11-17 | examples/rigid/terrain_subterrain.py:10-16 | examples/tutorials/position_control_comparison.py:16-22 \u2014 before extracting anything, compare \u0060examples/rigid/gravity_compensation.py\u0060 and \u0060examples/rigid/nonconvex_mesh.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/coupling/rigid_mpm_attachment.py:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/tutorials/position_control_comparison.py:23\u0060 calls \u0060SimOptions\u0060 and \u0060examples/rigid/terrain_from_mesh.py:18\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/coupling/rigid_mpm_attachment.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae18c9dd95cacd8a17f83ef3babb67e50559b3952ec1ee9cc4fe324a5fa38e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 6): examples/coupling/fem_cube_linked_with_arm.py:82-88 | examples/coupling/grasp_soft_cube.py:64-70 | examples/rigid/control_franka.py:57-59 | examples/rigid/grasp_bottle.py:58-64 | examples/rigid/suction_cup.py:57-63 | examples/sensors/imu_franka.py:98-104 \u2014 before extracting anything, compare \u0060examples/rigid/control_franka.py\u0060 and \u0060examples/rigid/grasp_bottle.py\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060examples/coupling/fem_cube_linked_with_arm.py:82\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 after the matched lines, \u0060examples/coupling/fem_cube_linked_with_arm.py:88\u0060 calls \u0060set_dofs_force_range\u0060 and \u0060examples/rigid/control_franka.py:59\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/coupling/fem_cube_linked_with_arm.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"504bb9e9e743c42bf3b738eb172e26c9ef1e1c9386f2dd1524436d7a9f2b2515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/collision/pyramid.py:24-30 | examples/sap_coupling/franka_grasp_fem_sphere.py:14-21 | examples/sap_coupling/franka_grasp_rigid_cube.py:13-20 \u2014 before extracting anything, compare \u0060examples/sap_coupling/franka_grasp_fem_sphere.py\u0060 and \u0060examples/sap_coupling/franka_grasp_rigid_cube.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 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 \u0060examples/collision/pyramid.py:24\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/collision/pyramid.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0a8653f2b78a35abe03341455335b18417049ac5c99cc96dbfe2928f44cd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 6): examples/coupling/fem_cube_linked_with_arm.py:89-91 | examples/coupling/grasp_soft_cube.py:72-78 | examples/rigid/control_franka.py:59-60 | examples/rigid/grasp_bottle.py:66-73 | examples/rigid/suction_cup.py:64-66 | examples/sensors/imu_franka.py:105-107 \u2014 before extracting anything, compare \u0060examples/rigid/control_franka.py\u0060 and \u0060examples/rigid/grasp_bottle.py\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060examples/coupling/fem_cube_linked_with_arm.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. 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/coupling/grasp_soft_cube.py:72\u0060 calls \u0060array\u0060 and \u0060examples/coupling/fem_cube_linked_with_arm.py:89\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/coupling/fem_cube_linked_with_arm.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a439d5a33be1d411ab9f7bb614226f0093bfcf74d2485a79a32f9e1510fad99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/drone/hover_eval.py:31-37 | examples/locomotion/go2_eval.py:26-32 \u2014 before extracting anything, compare \u0060examples/drone/hover_eval.py\u0060 and \u0060examples/locomotion/go2_eval.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/drone/hover_eval.py:30\u0060 calls \u0060add_argument\u0060 and \u0060examples/locomotion/go2_eval.py:25\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/drone/hover_eval.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d77ee2f7d9e54f1269b75707bae7d6f6c0b9836db1370519e527d3440564f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): examples/ipc/ipc_robot_grasp_cube.py:99-100 | examples/ipc/ipc_robot_grasp_cube.py:101-106 | examples/ipc/ipc_robot_grasp_cube.py:113-118 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/ipc/ipc_robot_grasp_cube.py:100\u0060 calls \u0060control_dofs_position\u0060 and \u0060examples/ipc/ipc_robot_grasp_cube.py:99\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/ipc/ipc_robot_grasp_cube.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d18bda68e93fdd76aa679c5176652dddb87cf02fbbbc12ab9de34b4557c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/rigid/set_phys_attr.py:173-178 | examples/rigid/set_phys_attr.py:183-189 \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/rigid/set_phys_attr.py:173\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/rigid/set_phys_attr.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeb738012d0d5b937847675e86890dc33fade4c86d597954c572455a6ee42a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/sap_coupling/franka_grasp_fem_sphere.py:81-86 | examples/sap_coupling/franka_grasp_rigid_cube.py:75-80 \u2014 before extracting anything, compare \u0060examples/sap_coupling/franka_grasp_fem_sphere.py\u0060 and \u0060examples/sap_coupling/franka_grasp_rigid_cube.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 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":"examples/sap_coupling/franka_grasp_fem_sphere.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45670bb407b40c2fa1527f21b54a29eb0fcde46926465a892f94a9f96e44064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/sensors/contact_force_go2.py:15-20 | examples/sensors/temperature_grid.py:40-45 \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/sensors/temperature_grid.py:40\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":"examples/sensors/contact_force_go2.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c71eab11f54c1d379d251a8cccdacaffa10eeb84a0db47cb5981906e2ce957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/rigid/diffik_controller.py:71-75 | examples/rigid/ik_duck.py:54-58 | examples/rigid/ik_franka.py:52-56 \u2014 before extracting anything, compare \u0060examples/rigid/diffik_controller.py\u0060 and \u0060examples/rigid/ik_franka.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rigid/diffik_controller.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c559c9c0a772cc3d26dad0aba7f37021b43c2fda2e18f8e13cd1ff7660ad29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/sensors/lidar_teleop.py:150-156 | examples/sensors/surface_distance_shadowhand.py:138-144 | examples/sensors/temperature_grid.py:200-206 \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/sensors/lidar_teleop.py:150\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, \u0060examples/sensors/temperature_grid.py:209\u0060 calls \u0060Keybind\u0060 and \u0060examples/sensors/surface_distance_shadowhand.py:147\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/sensors/lidar_teleop.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c4753e912dba26b3512f688b307c75acbe7517185e8a3bb3e5bc09bae5d633"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/tutorials/position_control_comparison.py:77-81 | examples/tutorials/position_control_comparison.py:89-93 \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/tutorials/position_control_comparison.py:94\u0060 calls \u0060cos\u0060 and \u0060examples/tutorials/position_control_comparison.py:83\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/tutorials/position_control_comparison.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11446b309260003c622a81bbc954700d7c9ebedf743a6fe7925c111587274d1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RigidEntity (LCOM4 58): RigidEntity\u0027s methods fall into 58 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 58 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afe0c33c017427d31368ac9c6c1b65a67b9a602c568b5a1dd2017c3a234445a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RigidSolver (LCOM4 35): RigidSolver\u0027s methods fall into 35 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 35 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4861f406674da7f52fff7d79d15295dd2cf58e2b3aaa3303fca2ea5072230280"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: KinematicSolver (LCOM4 14): KinematicSolver\u0027s methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"811293920a37208597c840325bd3926bce780553aae5f15888d8425e58997d4d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Solver (LCOM4 6): Solver\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d46c3edf70fd1d8b38246c2e1d3e2b0a127d21d75105859a55777e3363220f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UsdContext (LCOM4 5): UsdContext\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_context.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee819cc9a598c2e2759830273c95d8cddc81ba6a31816c6e13bc2c9b54dd4d2e"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: frozendict: \u0060frozendict\u0060 2.5.1 is published on PyPI under \u0060LGPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eabaddc5ace4df0a4a80aedb35b4fd43e6e12a49965a667944eb8cfdda09c895"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/narrowphase.py: genesis/engine/solvers/rigid/collider/narrowphase.py changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 137 in narrowphase.func_add_polytope_vertex_contacts_sdf at line 71. 12 of those changes were fix/bug commits, and the other 28 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/narrowphase.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":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"034378589f74b47a5c4e7f4cf5592d04fd3d5c2c15f91570b5b9d5e63bfe22f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/rigid_solver.py: genesis/engine/solvers/rigid/rigid_solver.py changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in RigidSolver._build_config at line 519. 25 of those changes were fix/bug commits, and the other 53 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1148fc4cd1a7bc22f3bfff76131b8fbdf9c1a865967da9a24b6e9ed762b9dd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/constraint/solver.py: genesis/engine/solvers/rigid/constraint/solver.py changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in solver.func_island_assemble_factor_solve_tiled at line 2894. 17 of those changes were fix/bug commits, and the other 36 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/constraint/solver.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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"353a816c5522ebfc39171303ead0257563c27c0c070eb816d2610b781f0a7c78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/couplers/sap_coupler.py: genesis/engine/couplers/sap_coupler.py changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in SAPCoupler.build at line 1331. 19 of those changes were fix/bug commits, and the other 24 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/couplers/sap_coupler.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":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"88093613cb0ef348af88fff90ec8265ab9bf3303e28b70c805be8cadd0406368"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/contact.py: genesis/engine/solvers/rigid/collider/contact.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in contact.func_clamp_prune_contacts_coop at line 1556. 13 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/contact.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":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4a1110a5b874a559c24813796d6e8293c9d7ee1167395a6d89820ef766327e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/misc.py: genesis/utils/misc.py changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in misc.assign_indexed_tensor at line 1588. 17 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/misc.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":"genesis/utils/misc.py"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5ad578e475405371dd23bcb8736fe7ca96d8ad168fdb4f6026ccaa24f3b9a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/collider.py: genesis/engine/solvers/rigid/collider/collider.py changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Collider.get_contacts at line 942. 6 of those changes were fix/bug commits, and the other 32 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/collider.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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c69706aa6ef496051f023731e805d1e471b484dbdf96286d48e64fed8a6561"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/entities/rigid_entity/description.py: genesis/engine/entities/rigid_entity/description.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in KinematicEntityDescription._parse_scene at line 915. 9 of those changes were fix/bug commits, and the other 11 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/entities/rigid_entity/description.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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1f3459859e51ade441a41607c81159af283657d8f9f83bf5e2393b71ae1f9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/couplers/legacy_coupler.py: genesis/engine/couplers/legacy_coupler.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in legacy_coupler.kernel_sph_boundaries_impulse at line 2453. 15 of those changes were fix/bug commits, and the other 15 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/couplers/legacy_coupler.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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c0f79324d3d3df68b56bef667449efd1bebf5d650f2c1387c3c8d4e34f0d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/mesh.py: genesis/utils/mesh.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in mesh._postprocess_collision_geoms_impl at line 677. 11 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/mesh.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":"genesis/utils/mesh.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba6ea8caccd5770e0e0a8319d6dcb5b9bf447c1f82df2c320dd687b4d15dabe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/fem_solver.py: genesis/engine/solvers/fem_solver.py changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in fem_solver.func_accumulate_vertex at line 2175. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/fem_solver.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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"360d691f54484a0049546eeee358a5ae3e3f740119215f0b158f5747afe57ea4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/entities/rigid_entity/rigid_entity.py: genesis/engine/entities/rigid_entity/rigid_entity.py changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in KinematicEntity.attach at line 371. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/entities/rigid_entity/rigid_entity.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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37cfee4633b9476b860596e6d7a30e0fd22f5ac47c34a44ede41b9bbb0cb52d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/abd/forward_dynamics.py: genesis/engine/solvers/rigid/abd/forward_dynamics.py changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in forward_dynamics.func_factor_mass_tree_shared at line 882. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/abd/forward_dynamics.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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c6eaac692979b72e18210f8f86169e2707279a53f33abd7b6d5e35c215821"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/__init__.py: genesis/__init__.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in genesis.init at line 59. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/__init__.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":"genesis/__init__.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd39c94ec41abab78a359496991616af3b1cf74ab5439b60e8659d51831783f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/constraint/linesearch.py: genesis/engine/solvers/rigid/constraint/linesearch.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in linesearch.func_linesearch_islands_coop at line 1176. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/constraint/linesearch.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":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec6aabba81fb03fdfd053c847f19d87b564c51cd036c899e67775cebbe16d13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/mpm_solver.py: genesis/engine/solvers/mpm_solver.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in mpm_solver.kernel_transfer_particles_to_grid at line 949. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/mpm_solver.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":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd3e442b14059b7c911f1d58aefc15546c87ef9a85458cfac200fc028b3cae2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/simulator.py: genesis/engine/simulator.py changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Simulator.build at line 199. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/simulator.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":"genesis/engine/simulator.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8804672a14c13aac26561eff34627f32ee495b1f1564af3ac16f5b32f20954"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/kinematic_solver.py: genesis/engine/solvers/kinematic_solver.py changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in KinematicSolver.build at line 239. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/kinematic_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"802e7a785907165f1a68de2c0cbcfc62e53867097c62380b816af8596115a9d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/box_contact.py: genesis/engine/solvers/rigid/collider/box_contact.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in box_contact.func_box_box_contact at line 187. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/box_contact.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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd062adb82e84ee2473d53b316559e73df775679125083d54173ae0a171d20c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/mpr.py: genesis/engine/solvers/rigid/collider/mpr.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in mpr.func_mpr_contact_from_centers at line 465. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/mpr.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":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0c84e4c3a3879d4fafed018ee46ffbfac6972081682298c22344d5ab76d0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/constraint/backward.py: genesis/engine/solvers/rigid/constraint/backward.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in backward.kernel_manual_add_equality_constraints_bw at line 751. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/constraint/backward.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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f920b6998cdbffe37b421b405998c89b79d30ebdc8e53b16c4cf3c712b70338"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/constraint/island.py: genesis/engine/solvers/rigid/constraint/island.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in island.func_build_islands_coop at line 474. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/constraint/island.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":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91370c95d92315a27e51b6d465aec0de91ed7dabeabc520465e56711c0e02f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/data.py: genesis/utils/data.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in Data.__init__ at line 409. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/data.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":"genesis/utils/data.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7094aa9e138fb7533a502a81d32b31856e8a86d15aa683ed34f2176c38f7e911"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/abd/forward_kinematics.py: genesis/engine/solvers/rigid/abd/forward_kinematics.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in forward_kinematics.func_sweep_links_by_level at line 1060. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/abd/forward_kinematics.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":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c127803ead2050379d42c1d89a07cabe8b6a0816a90a5e5f0091ad94a412d65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/mjcf.py: genesis/utils/mjcf.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in mjcf.parse_link at line 292. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/mjcf.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":"genesis/utils/mjcf.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6144bafb74ef4ccc0c4190ffda5a9f7a41974c555a567a5436fe239c8ab57a5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/urdf.py: genesis/utils/urdf.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in urdf.parse_urdf at line 135. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/urdf.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":"genesis/utils/urdf.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e8654522cd1afa8e69bbf4a9b2428ad5d9efae805b50fcb8358c20d6c2445d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/abd/inverse_kinematics.py: genesis/engine/solvers/rigid/abd/inverse_kinematics.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in inverse_kinematics.func_inverse_kinematics at line 448. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/abd/inverse_kinematics.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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c1a1f3d1b0a1e1eea28e33206a66cb5a3becc2748d47c3e4ee83c88ff54f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/gjk.py: genesis/engine/solvers/rigid/collider/gjk.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in gjk.func_gjk_contact at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/gjk.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":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e1c7d9e398f8f2323b2cec4a266537f6b11baaa58212625165e1f663208f01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/epa.py: genesis/engine/solvers/rigid/collider/epa.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in epa.func_safe_epa at line 950. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/epa.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":"genesis/engine/solvers/rigid/collider/epa.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b337bfbb4888a0e3176b5419747863a0fb1b4aceb51f3569dbb9b0632994db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/bvh.py: genesis/engine/bvh.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in bvh.func_build_bvh at line 425. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/bvh.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":"genesis/engine/bvh.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9346104688b7538d7557651960c5be1121bee405c08101b5b633f93945536a9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/sph_solver.py: genesis/engine/solvers/sph_solver.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in sph_solver.func_solver_iteration at line 1213. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/sph_solver.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":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"966df396523d280e74243ed960bfcffc02fff978739bf92dae779156a6d405e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/base_solver.py: genesis/engine/solvers/base_solver.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Solver._sanitize_io_variables at line 592. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/base_solver.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":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"75218d24422a6c4e8fa0153e09df3dfadfa69d5360dce9d519186d32812bb6f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/couplers/ipc_coupler/coupler.py: genesis/engine/couplers/ipc_coupler/coupler.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in IPCCoupler._add_rigid_geoms_to_ipc at line 483. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/couplers/ipc_coupler/coupler.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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ee062d3706ce4d8a4db72253262aad255335a3e173559b170b15582f6c4f9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/mesh.py: genesis/engine/mesh.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Mesh.from_trimesh at line 443. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/mesh.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":"genesis/engine/mesh.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f18cf07c412c5dc0fffecf167bf1f0295ee3d9f2d500e49dec8518d138bd492"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/vis/camera.py: genesis/vis/camera.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Camera.set_pose at line 591. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/vis/camera.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":"genesis/vis/camera.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5ca992e43749a88e5c163e6fe92632c6e7833ec2f54fc58ad1e682d2c88d38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/multi_contact.py: genesis/engine/solvers/rigid/collider/multi_contact.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in multi_contact.func_multi_contact at line 20. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/multi_contact.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":"genesis/engine/solvers/rigid/collider/multi_contact.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a68c34ec57dd2812d6782849a37604a78c325d49d883d978a978e5195c24e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/geom.py: genesis/utils/geom.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in geom.func_sort_particles_by_slot at line 2627. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/geom.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":"genesis/utils/geom.py"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"867a665197418974aa4e1dd597b41dc03ef16c6879907926a79a1611aea0c628"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/diff_gjk.py: genesis/engine/solvers/rigid/collider/diff_gjk.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in diff_gjk.func_gjk_contact at line 12. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/diff_gjk.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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"942ca0a2113f7693896c5e10e4ecfd01d38038615fe5e8436ccf4a89c7936cc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/usd/usd_rigid_entity.py: genesis/utils/usd/usd_rigid_entity.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in usd_rigid_entity._parse_link at line 166. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/usd/usd_rigid_entity.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":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d897069e8b504d6e9310cf4cf63b54fa8727778cb18f3a0752e99b761cdb0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/recorders/trajectory.py: genesis/recorders/trajectory.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TrajectoryFileWriter.build at line 524. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/recorders/trajectory.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":"genesis/recorders/trajectory.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d267f75ac53bb96e2371d9c6f74da0ab7e756acf5d4f2594bad814a47c7b68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/serialization.py: genesis/utils/serialization.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in serialization._load_value at line 468. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/serialization.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":"genesis/utils/serialization.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceb1f63c40bbc979c5f5e5070f70bd859e9578b779780cf2afb208fba63429b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/gltf.py: genesis/utils/gltf.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in gltf.parse_glb_material at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/gltf.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":"genesis/utils/gltf.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a37b2c7c7fde6f04e2afcf285cbd19391298376aea3bece6eea61eb9f345b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/usd/usd_geometry.py: genesis/utils/usd/usd_geometry.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in usd_geometry.parse_prim_geoms at line 38. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/usd/usd_geometry.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":"genesis/utils/usd/usd_geometry.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcf13c13e6b546427722c21b1bd08876a2b75525591b9d1fbed020c2451bad1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/vis/raytracer.py: genesis/vis/raytracer.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Raytracer.build at line 215. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/vis/raytracer.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":"genesis/vis/raytracer.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfc57ef269da156932315bb36553672917229cb3613b5b5b58d605baf8e0f8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/collider/broadphase.py: genesis/engine/solvers/rigid/collider/broadphase.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in broadphase._func_broad_phase_links_sap at line 165. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/collider/broadphase.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":"genesis/engine/solvers/rigid/collider/broadphase.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"093a1637967767757abc11eed14037337d166f45488c0a6e0b18a53f9796979f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/sensors/point_cloud_tactile.py: genesis/engine/sensors/point_cloud_tactile.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in point_cloud_tactile._kernel_point_cloud_proximity_taxel_bvh at line 373. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/sensors/point_cloud_tactile.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":"genesis/engine/sensors/point_cloud_tactile.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"08461bc705c7816608de63ef56c541a45a0a89b8bd4878a34aaf83283056c853"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/vis/rasterizer_context.py: genesis/vis/rasterizer_context.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in RasterizerContext.update_rigid at line 632. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/vis/rasterizer_context.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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e5d9fb5142929b928b64f891f78e31fa6d1e8adb24418381e5984230e3bb80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/constraint/noslip.py: genesis/engine/solvers/rigid/constraint/noslip.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in noslip.func_noslip_update_row at line 252. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/constraint/noslip.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":"genesis/engine/solvers/rigid/constraint/noslip.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00d2a54ce9325a92486e5212fbff31269fd422be2b72ad7c79dc2823babbf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/path_planning.py: genesis/utils/path_planning.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in RRTConnect.plan at line 895. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/path_planning.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":"genesis/utils/path_planning.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2cf1ce49e86cbde26e37fe027397dd523b0026a3df665d42a3ba57da784cf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/interactive_scene.py: genesis/engine/interactive_scene.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in InteractiveScene._apply_rebuild at line 228. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/interactive_scene.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":"genesis/engine/interactive_scene.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0eaa8ef1b340b99215a072966565a29ce58983d7c0c6240e9a952e0ff4b4f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/terrain.py: genesis/utils/terrain.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in terrain.parse_terrain at line 19. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/terrain.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":"genesis/utils/terrain.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f56d8620ca646e0905c7d37e385d46fec546ea5a076b2c2b2faea2b53e0af58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/solvers/rigid/abd/manual_bw.py: genesis/engine/solvers/rigid/abd/manual_bw.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in manual_bw.func_forward_kinematics_link_bw at line 18. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/solvers/rigid/abd/manual_bw.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":"genesis/engine/solvers/rigid/abd/manual_bw.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e93e5ef67da0598be34428f33c10bbd4718089b46112e47fe07422d39e3649"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/sensors/temperature.py: genesis/engine/sensors/temperature.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TemperatureGridSensor.build at line 523. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/sensors/temperature.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":"genesis/engine/sensors/temperature.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7417f99bd50ff546d7f95d044f78fb866feaa958840ae331587306c6a7d02b6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/utils/usd/usd_collision.py: genesis/utils/usd/usd_collision.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in usd_collision.apply_collision_filtering at line 16. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/usd/usd_collision.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":"genesis/utils/usd/usd_collision.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd896c80a0da4c5d9067fa252ba07ec27d9c8a8d5f61f97d74afc419b52e30cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/vis/viewer_plugins/plugins/mouse_interaction.py: genesis/vis/viewer_plugins/plugins/mouse_interaction.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MouseInteractionPlugin.on_draw at line 220. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/vis/viewer_plugins/plugins/mouse_interaction.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":"genesis/vis/viewer_plugins/plugins/mouse_interaction.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e6196e44870befba0dc8424574e3ae636e818f321a205fed411893b004b3b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/recorders/plotters.py: genesis/recorders/plotters.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MPLLinePlotter._update_plot at line 570. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/recorders/plotters.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":"genesis/recorders/plotters.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0af50309a2f4a871582b22517ac6dde59bef0c0ddf55d777c8b3dd87f264f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/grad/bridge.py: genesis/grad/bridge.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LaunchRecorder.insert at line 336. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/grad/bridge.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":"genesis/grad/bridge.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d79582d1bd5e982ffba1c6849c7b3acf44ec3a71d134fabdd4c32609f097f8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: examples/sensors/tactile_franka.py: examples/sensors/tactile_franka.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in tactile_franka.main at line 177. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- examples/sensors/tactile_franka.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":"examples/sensors/tactile_franka.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"932465e7ea4764f8cf95a3a55194b97e40563462cb195bf1dd8c7ee244411326"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/sensors/sensor_manager.py: genesis/engine/sensors/sensor_manager.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SensorManager.build at line 146. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/sensors/sensor_manager.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":"genesis/engine/sensors/sensor_manager.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c483c1eaa6d273b50a4d5cd283058424c92f3fa1037d673e17d53620c0bc414b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: examples/sensors/tactile_sandbox.py: examples/sensors/tactile_sandbox.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in tactile_sandbox.main at line 236. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- examples/sensors/tactile_sandbox.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":"examples/sensors/tactile_sandbox.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d87584029d151727ce8732e6695bf8853ea26830ba39b160dadb907489981"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/engine/entities/rigid_entity/rigid_joint.py: genesis/engine/entities/rigid_entity/rigid_joint.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RigidJoint.dofs_length at line 313. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/entities/rigid_entity/rigid_joint.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":"genesis/engine/entities/rigid_entity/rigid_joint.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"337c2a0beb5618e738bbc527f5a4ab59ed421555994717458abcf594b8715c0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: genesis/ext/pyrender/offscreen.py: genesis/ext/pyrender/offscreen.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in OffscreenRenderer.render at line 65. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/ext/pyrender/offscreen.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":"genesis/ext/pyrender/offscreen.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ce03a6eac2bee002282a32a7ba0e32ef67115f2a0ae560a2964866b311eb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: genesis/utils/simt.py: genesis/utils/simt.py changed 7 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 9 (its worst body is simt.qd_lane_local_set at line 151), 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: \u201C[BREAKING][BUG FIX] Fix SPH liquids seeping into rigid bodies and pushing on them with the wrong force. (#3778)\u201D; \u201C[BUG FIX] Add support for deterministic mode to coupling rigid vs SPH or MPM. (#3776)\u201D; \u201C[BUG FIX] Fix rigid simulation crashing or hanging on AMD RDNA4 GPUs. (#3580)\u201D; \u201C[BUG FIX] Fix the incremental Hessian update of the rigid constraint solver on AMDGPU. (#3537)\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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/simt.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":"genesis/utils/simt.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a23908b3429f19b7287054384a53741807c2be0de096cbe1483d2ad379ac8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: genesis/vis/viewer.py: genesis/vis/viewer.py changed 6 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 15 (its worst body is Viewer.build at line 79), 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: \u201C[BREAKING][BUG FIX] Fix crashes using scene objects before build or after destroy. (#3831)\u201D; \u201C[BUG FIX] Fix setters paced at simulation rate when the interactive viewer is open. (#3591)\u201D; \u201C[BUG FIX] Fix rendered views depending on the precision of the simulation. (#3571)\u201D; \u201C[BUG FIX] Support offscreen rendering with OSMesa. (#3302)\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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/vis/viewer.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":"genesis/vis/viewer.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e19fcb70205ec643201924764cd4c6bf405b0239073d2ccb6b20fb1f964e940"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: genesis/utils/cache.py: genesis/utils/cache.py changed 6 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 15 (its worst body is cache.get_hashkey at line 429), 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: \u201C[BUG FIX] Fix watertighten wrap resolution of meshes smaller than 10 cm. (#3826)\u201D; \u201C[CHANGING][BUG FIX] Fix the SDF grid of thin-walled non-convex meshes being sized from a biased wall thickness. (#3815)\u201D; \u201C[BUG FIX] Make the signed distance fields of meshes reproducible. (#3659)\u201D; \u201C[BUG FIX] Fix setters paced at simulation rate when the interactive viewer is open. (#3591)\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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/utils/cache.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":"genesis/utils/cache.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa06fa3b8e2b2f483caab281a0f73a255feb7685dc3e30676e428b79cb34d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: genesis/engine/entities/rigid_entity/inertial.py: genesis/engine/entities/rigid_entity/inertial.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 inertial.finalize_inertial at line 194), 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: \u201C[BUG FIX] Fix dynamics of attached entities and resolve assets identically in every precision. (#3311)\u201D; \u201C[BUG FIX] Recover a usable inertia for URDF links stating a zero mass or inertia. (#3261)\u201D; \u201C[BUG FIX] Fix COM frames of fixed links on aligned bodies breaking thrust points. (#3283)\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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/entities/rigid_entity/inertial.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":"genesis/engine/entities/rigid_entity/inertial.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3701307a825dd7698d2fff0d97af22e5e473bfb7ac392802a7ceada74470be"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: genesis/engine/sensors/imu.py: genesis/engine/sensors/imu.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 5 (its worst body is imu._kernel_update_imu_raw_data at line 24), 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: \u201C[BREAKING][BUG FIX] Fix crashes using scene objects before build or after destroy. (#3831)\u201D; \u201C[BUG FIX] Fix setters paced at simulation rate when the interactive viewer is open. (#3591)\u201D; \u201C[BUG FIX] Apply scalar cross-axis coupling to IMU readings. (#3436)\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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/sensors/imu.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":"genesis/engine/sensors/imu.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba89d607a55ee9c9e04c25fbf1e6fe12675b41eac55f3186fe9b0e2a83c2f83"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: genesis/engine/sensors/contact_force.py: genesis/engine/sensors/contact_force.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 12 (its worst body is contact_force._kernel_get_contacts_forces at line 62), 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: \u201C[BREAKING][BUG FIX] Fix crashes using scene objects before build or after destroy. (#3831)\u201D; \u201C[BUG FIX] Fix kernel caching of the legacy coupler, MPM, sensors and rigid queries. (#3818)\u201D; \u201C[BUG FIX] Fix setters paced at simulation rate when the interactive viewer is open. (#3591)\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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:32:13 \u002B01:00\u0027 --until=\u00272026-11-15 23:32:13 \u002B01:00\u0027 --full-history --no-merges -- genesis/engine/sensors/contact_force.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":"genesis/engine/sensors/contact_force.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"475bec789b333dc5a956af6d050899f76105740807fa684ae3dbb019590f870a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 22 significant file(s) lose their only recent owner: genesis/engine/couplers/sap_coupler.py, genesis/engine/solvers/rigid/collider/narrowphase.py, genesis/engine/couplers/legacy_coupler.py, genesis/engine/solvers/rigid/constraint/linesearch.py, genesis/ext/pyrender/jit_render.py, genesis/recorders/trajectory.py, genesis/engine/solvers/rigid/abd/forward_kinematics.py, genesis/engine/solvers/rigid/collider/epa.py (\u002B14 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4958035c123f6bc1a7b4154c6ecca39d301f5607aa17fe478a59a3851eab4a08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Enabling multi-threading in benchmark is making compile time estimation unreliable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb8a670e286282c0e5c648b6034e582e0704e8ff71292592dfe3ba55760718d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: There is no easy way for Intel ARC device. Ignore device visibility issue 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":"tests/conftest.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2286ae6d7342beab8a50174dba9eb894c2495fbde9a920d35e6badb81dc23d37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Must set temporary cache even if caching is forcibly disabled because this flag is not always honored \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7c6fb0560a31eacb6b132cfa934dbba0d17b6684689fbfc7a0a7054530e65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Validating mesh files is more tricky. Ignoring them 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":"tests/utils/assets.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c089d636365c70946362f076b92585c47e5b7e10683a5ae9cdaff1ae6fb1b16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: only supporting 1DoF per actuator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/utils/mujoco_parity.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"365144f5c0b4b895854cda14e970c288b614b230f8d8df3ac840f99034095ff7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: 1 stiffness per joint in Mujoco, 1 stiffness per DoF in Genesis \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/utils/mujoco_parity.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"680c1d6f69ade6f64f574a0fb255f719db5c762667a8b563fd929160dcb6dc5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Masking geometries and equality constraints is not supported 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":"tests/utils/mujoco_parity.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2cacd0a7cb531e1d5326f506468740d5acb111b120736ce01f89416bd9a3e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: For some reason, mujoco is sometimes (seemingful) wrongly reporting 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":"tests/utils/mujoco_parity.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d1c46f4b8701b9f07553520d62ec81bebb0243bd780008b9d585c45f7ee97f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Genesis gives every contact at least the sliding-friction basis, so a geom asking for a frictionless \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/utils/simulators.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"327fcffa11607697868b79fbf3ebfd809b02b871f893eb712ef960754cfbf6fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Genesis has no tendons, so a tendon\u0027s range contributes no constraint row on its side. Releasing the range \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/utils/simulators.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cad8dc5d07cd9b0b2a8c11abbf12b3d232f155ee0316e50a211e86215b312c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This test fails without any entities in the scene. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/sensors/test_camera.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9f35c94850163c0453f8b5182b51183ec477db60ebe6ded1fa156be4047f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Adding CoM offset on box is disturbing contact force computations on box_2 for some reason... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/sensors/test_contact.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1399037cd8f78e6736fc8043f301a872ae691ea4d8986c0993a2448722465c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Not sure why tolerance must be increased for tests to pass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_api.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daa9a4adcdd626db9893694024f961c285a5a0bcdefd67b83f73447d019f41c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: pytorch#TBD - \u0027any\u0027 over an empty dimension returns uninitialized memory on MPS, so the contacts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_api.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"169525edd7b7ffa23ee1b42996447cb54ec056218f46255ccfd50e58f920825d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1086 - the replay drifts in the last bits, which contacts amplify to the tolerance in fp32."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rigid/test_api.py"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2415af97ed6cbd13f4ba3d195be576945fe1931010a782ba470ebe655a8895bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The tolerance must be very high when using 32bits precision. This means that our computation of the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rigid/test_asset_loading.py"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f7e7f20c6478b7f5bd4ed368caf9c485a059000a01c39df5a8b48e09182a67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: None of the robots being tested for now have linear joints... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_asset_loading.py"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e462e18482bcfa1c5f69160852e5b88e563039493138c30c12b4f17d9d8484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Scaling of bounds depending on the type of joint should be explicitly checked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_asset_loading.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"698c0bb0d60827d2d544bcf882ad55356b32680b491b46c44e055b425c1188a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The top ball is slightly rotating around z-axis (~0.5degree) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"196edf4e79c3cd7a376be34af217d95f293197b464418e8bc198679f399aa099"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The box test only checks that the body wedges at the L-corner equilibrium (position \u002B zero velocity). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49cbd7474e0027c0651109d6600480b84cb28b62a4dbbc4b4a73383e529b33c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The total energy should be not strictly decreasing but is not... relaxing the condition \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7519ef4232d58d758b44a26a32679317ba0374e711fd0890c25adf1c40e66937"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: There is spurious residual motion on both paths that prevents the objects from truly settling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd09dc1f9b4eb46b12aa4e30f6ba6beabe6e41939770ed1d9b0f12d446a3e22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The cup is falling on Windows OS because the convex decomposition provided by CoACD is different than \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d18452751d022df79d98ff8e2910ba568066fafee33f4bdeca0df7ca41e719"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Rare (~5% of initial-pose draws) stem-through-wall traps exceed this bound by design: a thin feature \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e8241fa5f518b8d213559a79eb04e5aae2175d0e5132341569a6e51ce7a4ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Why the angular velocity threshold has to be so large without any visual effect?! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e22dc12ed2731f30a762cdf776a0a5f89288992a28b3fb9c90f705ada5779a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Both path pumps net positive contact energy over this window. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e46c0dad2b011a9cb7c7bec9c834317aed6ad82a7d744514889156e47108d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Both paths suffer from fictitious energy injection. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_collision_nonconvex.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8740c3aab103235dbf0e314d49fcbc5be7510b1ef7a8881705d2f5e781cb11b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: We do NOT raise exception anymore when setting control targets that would have no effect \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_control.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"379bd1f55a83cf4838304919aeba4b9ddab9854716847e5bb42013f33e243a0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Cannot afford GPU test for this one \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_dynamics.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d7420b4a6e37a774d02810d4c48fd2844f9179d8c26f5b4271752af89cbd81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # The arms stop against each other instead of swinging through each other. FIXME: pytorch#TBD - \u0027any\u0027 over an \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_heterogeneous.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"931db0d2506baa4573722ff96e06b423848bfedb18154bcc4e18a0eaa692e3d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: pytorch#TBD - \u0027any\u0027 over an empty dimension returns uninitialized memory on MPS, so the contacts are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_islands.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f3ed32208ce668a905bebcac1da9d6360595ad5ee5faf9054aadd55c68d675"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Implement a more robust plan planning algorithm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_kinematics.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"59928d9005edba142ea6462e2ea0a5064cd8b02929e70c4caf40e8ace03c85ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: , \u0022chain_capsule_hinge_capsule\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":"tests/rigid/test_mujoco_parity.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"117f6a2016ce2c69ed8f0dc1170e5895eccf416f45061b5c4b2e71de403108b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # gs.constraint_solver.Newton,  # FIXME: This test is not passing because collision detection is too sensitive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_mujoco_parity.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"028d173f5446e9b8d83b283a54b048fa3a1ed99026a9e9350ce4ecf8f63e6b81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Mujoco is detecting collision for some reason... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_mujoco_parity.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cae318e4caa55d825d398c6f9407d9ffddbbea3530e5da0aaac6bc99906cb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Collision detection is very unstable for \u0027stepping_stones\u0027 pattern. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/test_terrain.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d9a5efa753fedae0698d2b4ac63a0f38e04357be683bd479cd7f4912d51acf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: It should not be larger than \u0027vertical_scale\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rigid/test_terrain.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"07224edb616859dcb52d4fb9301962a2707f8d1fbb27cb24eef14a13df3a8778"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: On the macOS CI runners the GPU is a virtualized \u0022Apple Paravirtual device\u0022. This test drives 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":"tests/rendering/test_dynamic_meshes.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e983cb9fb07741a5ab27071cf5ef202ce325786e109a5155c173ad75c9eda0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Use a more accurate model to predict final velocity. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rendering/test_interactive_viewer.py"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bc3463c0ccdcec80ddcb9b13fb1fa038d9077c7bcbeb03e6635d2cad5203a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Tolerance must be increased whe using Apple\u0027s Software Rendering, probably due to an OpenGL bug... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rendering/test_offscreen.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a3168a0aeb3be027ba7c8b592eb0ce3b6ce0124c496e19958faa992844deb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The STL files are actually different from the glTF... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parsers/test_mesh.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"62955186b986144717aa51dfdf6b97966f205055bfee8c4e529ccc737ef241d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This test is taking too much time on some platform (~1200s) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parsers/test_mesh.py"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3d8894ce998e317c86d40d124db1fa05a34d1cb02955593572f47fb0303e0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Why does the tolerance has to be so lax for this unit test to pass?! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parsers/test_usd.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd30ba67fdcfab370c31e0a36ef0b5cee8e5ba25993d46022cb7f21a0df5c1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The estimated force is not very accurate. Is it possible to do better? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ipc/test_deformable.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2c622027bbbf60019273d1c5da5535973bf000d89c6b563b13ee8e2db9995"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This test does not pass for sphere entity... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ipc/test_rigid.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ca54693fd09bcf0b54b38e3ee53c483b39a3f2f4b76099431826dbd78c38ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This test does not pass for sphere entity... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ipc/test_rigid.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c9121e96836af8df211661aa2597f6b2f642341e788a2bb79b59f1651fa443"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: For some reason it actually 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":"tests/ipc/test_rigid.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"753a10599a6cff866855148939fac5f85cae635fdc1c1c4d9a0481bcf3e451b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Why the tolerance is must so large if no fixed ?! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/ipc/test_rigid.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0ff940d9ca7cbf7c90cd36cc30a1b7c695de54be0930489a312f2892faff0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Why it is not possible to achieve better accuracy? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/integration/test_integration.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c3e6aefb5754b5ee41573248ab2cf7c980123801fbfd9790fab1e338a568a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Compute theoretical deformation to be able to reduce the tolerance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/deformable/test_fem.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b459780340ecc0c55170f88d236a695d4d3eec2372a01fcd4d890d3ca1c60c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Compute theoretical penetration depth to be able to reduce the tolerance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/deformable/test_fem.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd82cf05628f85df119e227e94352004e2ed8870bd63f3c399cdb7d7f17519f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # velocity of its vertices about it vanishes. FIXME: A soft sphere on a coarse tet mesh rolls toward its \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/deformable/test_fem.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4e8f6fa1ac195f4d699a74b55e3d82752fd45581d3b87a89c17077d0cafabf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: No closed form gives this depth: the elastic flattening of the ball and its pressure field near the contact \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/deformable/test_fem.py"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"49da2ad2380e11e480afc360f30102e38c5e70be924a4fd047c993c011613030"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Within a support radius of a wall, the ghost lattice and the continuous plane disagree on the boundary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/coupling/test_hybrid.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ae7fbdf3525ad635c2e3cbd9f55a85183c92d5760bd9d1c360c5a46455158"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Building should raise when the scene cannot meet the accuracy of the simulation. The explicit time step \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/coupling/test_hybrid.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7417f26308d08c42c54300a004ace87164055aacec2d222636640b1691f14d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The SAP solve stops before converging on resting contacts, so the sphere sinks into the ground 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":"tests/coupling/test_hybrid.py"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e4885e7e282b33eba9a4dd33c6a560ec39ed2dbcd73bbe7626bd5df0b4292"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Hijack video writter to keep track of all the frames that are being recorded \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/test_recorders.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1776c94e48a0a52c86d306c80bb0d56db93f6de2eeffc15c2b2411191b984d3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # the burial side). FIXME: replace the reference value with an analytical bound. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/test_utils.py"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c7f1374d9cd4720f906bf5a580d7839b861f5053a5056c864fa6b81097b566"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1075 - On Windows, the native logger of Quadrants writes to the standard error handle that it keeps"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/core/test_utils.py"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dae4a15c5d3d19cc1fc0b7a7ddc938c36b1f4251caa7c24552a01821c74b4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Entire scene reset is still slow currently because \u0027partial=False\u0027 by 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/benchmarks/test_rigid.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a916edb3b2d2df484ab68d395b849462864530279141e32a895ed17b31d099"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: qd.Field does not support zero-copy on Metal for \u0027torch\u003C=2.9.1\u0027. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ed954a7372faf87614172446bd11f6ae730aac8102949d6c56869a9582a87e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Enforcing Quadrants num threads to 1 by default when running on CPU \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab60e79e68c30766013989d23743662f82d5d0dbcc699da0390895c1ddd2d732"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#980 - The bound is a 32-bit integer, which caps it at 2 GiB, so a working set larger than that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc56036ed8e2b8b981a6cd7025b805a8c19e4301d4c92d2969e35d90761d68a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#983 - Buffers from the HIP memory pool fault on their first write on RDNA4 GPUs (gfx12), so"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"59933975c3c94c2d759de582812ab0fcd0f95c141772fe3681c06f8b9e96bb48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Turning off \u0027force_scalarize_matrix\u0027 is causing numerical instabilities (\u0027nan\u0027) on MacOS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbd37f5536f8b1559aca7bc6cc7f0d7d3a30494d04580c547bb89018d46d07b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Turning off \u0027advanced_optimization\u0027 is causing issues on MacOS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba8faf0e197426701359bdc6d83813c0918f8a48c0c256864cbb7de45d1be2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Use a kernel to do it efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/batch_renderer.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba0f157b3bbf9c286f7684086e82d65b2c105c00df6647bbf0e372aba12cffd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Use a kernel to do it efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/batch_renderer.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00d41850e7fb94cdc23c924f8fcde8c5af11482e9d4520af121b5ea1c46a3a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Use a kernel to do it efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/batch_renderer.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8fbec7715eff5b77ffbd655c34a9cc4a93bc0860946346070c226e3c1676ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support batch rgba \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/batch_renderer.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7213a89b651cc5c09ec160ba80b12b5e45e5fb3160b80b856cc56d7b3a7e0593"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: For some reason, it is necessary to update the camera twice... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/camera.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"74283f0aea70946ecaa503cfeccf3b6276ad3d77f48cbcb592a98caef8a0591f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Avoid converting to numpy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/camera.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee0f6a1ccc629bcedd86eccdaa9e80665b8a9b8614e368ca6bf66e929437cda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need to support multi-env visulaization for tet mode (it\u0027s using static node) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/rasterizer_context.py"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d45ad639d51f784808e34b59d6a3b89aaea75e2d14d10c98d272474996ac7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make this more principled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/raytracer.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a5108ecfa24c86e36dc1e8513b39c3969ace66631175286241704cdd3ac139"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#887 - a host-side read is refused while another thread traces a kernel, so the first"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/viewer_plugins/raycast.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d720cbe05361a641dea0aeb6b408b31bcedf1b2001262130d9771f6e598ce812"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#934 - a kernel reads the axis permutation of an ndarray argument through the private _qd_layout"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04e55dc10447ca75ee0b3ab1c4ee39d4d39e2fab600db4ad432dfc7653f1141"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1082 - a struct-for over a field ignores serialize on GPU, so loops over a whole tensor run over"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38a4213da4b78ea79036bca77bf5f8ab0cd1080938c64d50073e418bdb4210f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1081 - qd.ndarray takes no memory layout, so the ndarrays are allocated through the qd.tensor wrapper"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad86fa91b006f41274561bdca573a62e029b8fdf5a2c3726ef0444fe32d02f83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#XXXX - the all-Field launch shortcut ignores nested structs, so a kernel taking an aggregate in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff49e833063362045a23e527c8b97adaf1bd47f18cb496f7ccc65fac03375bb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#856 - a kernel cannot take None for a struct argument, so an unused array is a 0-d placeholder"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace872ace8b6a4913a444b4c889399c4a726fded4005095929aa8c0981cfb07f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#963 - Metal silently mis-addresses the tensors above 2 GiB instead of raising."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/data.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabbad9ad6d7f55922a4e6bd1da7f2ca2e8644646682ba24c016dd7cebaf685a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1065 - \u0027qd.svd\u0027 stops at an error near 2e-10 in double precision, which three sweeps of two-sided"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/geom.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7548df56e38e840a895f293771d61f99dd1664a02da407a16904b038f878aee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Parse occlusion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/gltf.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f7da980b0985f94e03f3a073ca011f04b44ac214cd54bad2e6ac93a1ac4f44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Parse 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":"genesis/utils/gltf.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"801a0b90b62d953ee2b7abf515d805ae746bb4848525bf12e0135a3f8c6174a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants should expose a query of the GPU core count and layout for every backend. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af3e998d56b8d642452f76055084935b16e52d72c1d49c314b02d975216602c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#976 - the shared memory of a block is a 64 KiB lower bound on AMDGPU, which caps what CDNA4"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"720a8f5383255836ebae647ac415f65973ad19538b843fc97071104e229aa42a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: torch exposes no allocation granularity of the local data share (LDS), which AMD sets per \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"85232ab424e84d1cd3416ae2a1aabe036e15d11d58880c4c98f48880c00fb90b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: torch exposes no cap on the resident blocks of a streaming multiprocessor, which NVIDIA sets per \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11dc06e5f4d8c0c3abcc3b9b43b970431a086c26a8d8faf288b6b131a9f78c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Ideally one should detect if slicing would require a copy to avoid enforcing copy 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":"genesis/utils/misc.py"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a93ca9feb263ce1955bdf1c8a55c266a479ed137089044756fc51ef986e02c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Ideally one should detect if slicing would require a copy to avoid enforcing copy 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":"genesis/utils/misc.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4033539eb28b8633d8fcfb672017679d0faed653d65bf1aa76430a706363b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: DLPack may return old values on Apple Metal if sync is not systematically called manually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a838557ed771c6db91b88009c670e8a36c877238f5fae883c0c2a016f4a96e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#882 - the fastcache key of a torch tensor omits whether it tracks gradients, on which the argument"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deb9d1c8bb88a28efc5f7c21166d6e5ac4e19ace87beaaa4ecacccb6f58dd02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1003 - a reverse-mode kernel misses the fastcache, since it lacks the callable marking it pure. Both"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"235df0a6c1962be6573531f86716ae47a888b32ac53fbf2f6ed51bab6734a4e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1037 - a kernel keeps the template arguments of every call across \u0027qd.reset\u0027, fields included, so"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb6eead82b1e22b88536a57f78f22081d1058e01703c48dda297e2e796d8971"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1038 - a performance dispatcher keeps the arguments of its last call for the lifetime of the process,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e73292344127c53ac3ce3e5d7b6f1aa1dae823eb300e70d2eb551de6736358"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This check is too expensive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/misc.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a46ce558b17a4e93f00b1a30b29287cbb6dced85a0cdd9f6f5cc51a9c2291d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This check is too expensive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/base_entity.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0e08be2cda1e0db9bf964dc19c10abf54ab305fd181b71a94f9d9af255e6b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This check is too expensive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/drone_entity.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec0a91563cb8ea953b75281913f80807c900951d5c2a0de589f994271310040"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: MuJoCo 3.10 weighs a childless body sliding on the world along its own axes as 1 / mass, leaving out the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/mjcf.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5243129890ad2a48dabbf086cbbafb8d8d54a01b963a953c0a458a57028c692a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Running in subprocess or manually reclaiming free-ed head memory is necessary to avoid unbounded growth \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/particle.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e323b04acebfaa2687ad9ca09d563e268864c557681313dd411f86537b97f3a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: AOS, which does not match other Genesis structs. Old, untested code. We prefer not to touch 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":"genesis/utils/path_planning.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a917f59d25325784981e9572e492068dc133de3ef6b839a949056cfc1ce2f73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: AOS, which does not match other Genesis structs. Old, untested code. We prefer not to touch 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":"genesis/utils/path_planning.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c935e8305fedf58f69119de1f321af1d5b0a8ce7923519167fe77ceca3a032f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1039 - the fastcache key misses the fields a data_oriented visitor or target reads through its"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/raycast_qd.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908f42375d0cdf77f52230406671fdc3040b817ae3fbf398344c86d1b11cfc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: set portable root to avoid extension conflicts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_bake.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ac016b97c461f2c1d2ca2e173116e13b7d03c4c9e037df997210c8cd0fd36d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: material_id is also reserved for group_by_material option. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_context.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc33daa0a9ede19a67cfda5d91e69617b9054109cf6ccb09b1974b67288017f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: discard degenerated faces \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_geometry.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"705918b5a374732e5f322fa9ba5d385d9db41e8fcb8a06092ebb908ed4edb2d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use attribute \u0022state:\u003CINSTANCE_NAME\u003E:physics:positiion\u0022 to parse init_qpos (but it is IsaacSim specific) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9b870cd836bf4a7f648e02f545ac89d8df83a02c12656a7edd485cd3c23987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use drive.GetTypeAttr().Get() to parse force or velocity. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"47759866d562a312a631ecbcd0979c655f053877fb112f32bc52915fa3c0f26d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Implement target solving in rigid solver. (GetTargetPositionAttr()) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fdf69883252df13fe056beecfd083cfbc317cdd32077c9b41a69b83acce150"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parse actuator in USD articulation, now all joints are considered to have actuators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_rigid_entity.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a318d6d5cea14afe72dd224a8edf43444cc490a62465eba7a925938e0aa71d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#970 - a 0-d field has no zero-copy view, and reading one per frame runs a copy kernel. The"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/recorders/trajectory.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73734c1576b00fb63989fbb4453f069c13685d8bf98cf9509df555364e7357d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Identical pixels loaded from distinct files are not shared, since \u0027image_path\u0027 is part of the key. Sharing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/options/surfaces.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb72fa8a407da4543458b91ce20f6005de507cd8137ad6ab4d15f97aa3299363"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Resolution should be made private or converted to properties in mixin to prevent setting them directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/options/sensors/options.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac0f7abd5b03fe2537ebbb6d6d49063897ea3851ee856095f3ef0fadcf8d39"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: Kept for more debug options. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/logging/time_elapser.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"21071f4df8ccc1d20cfa85efb409f0bff4cce55abf8f4236b22d737dab77a136"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: torch - \u0027torch.autograd.graph.queue_callback\u0027, the public alias of this call, is missing from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/bridge.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aeacbeda0c58469b9c0680e62ef196aeab5b2ad93f01f8a74566b53cee4348"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#997 - a forward launch allocates the gradient of a torch tensor tracking gradients, which"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/bridge.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e023ba2e986e98695b32b45fecb52ed608cf9f5b63a4150b460d5dc0440c3df2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1000 - the launch hook of Quadrants is reachable only through this private runtime slot"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/bridge.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c036ca5072cb491d485056c3cb4b52040311db686820d94043f5bd85cc886f60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1001 - Quadrants exposes no write set of a kernel, so it is derived from the source here, which"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/kernel_writes.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3273eeea944f1230506280b7c1ef0275a63d8910dffa2306ec29914f84a76f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO : should this be removed to always return a scene? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd131ca4bb6cd1424727e79ac0c2c8a30a4b0054ea0f42db3bae807edecd487"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: probably need to support 8 and 12 columns for quads \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd3f497fd60918fa48612988983a1c976fa209239e6e49d56ed9f23b2e4ce9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Scene.dump() has bug that uses copy without include_cache=True, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/urdfpy/utils.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba605a3156c624d49db2f3a396c628f144b2e88f713e18c4629fd87d93033ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO MAKE THIS MORE EFFICIENT, glBufferSubData is broken \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/font.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"735988268b7ae8c6ac496cf151891e03f47c2c6534e3ee4fe627f5e7e09ed520"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Note that enabling GL_BLEND yield non-deterministic results on Nvidia GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a2eb82625968307b94e9ff18b753848e4f9633ee2288db6a033942a3ce3333"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO TMP \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/material.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1080ab6ed086e395a449458a3621305bbfffd77acc5bf07db12539b70b5dd8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO JOINTS AND 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":"genesis/ext/pyrender/primitive.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5962f2f6d9d11732d4f8f5eebc7f77c2a8ce26ce61aee611917cbceb021d03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO OPENGL BUG? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/texture.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ffa71d4bef3d82a10471eb644f02e6c17fe1bd284574d1da2929b5ed824120"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO OPENGL BUG? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/texture.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b91699c1393c17a8d980ef95bef83fb41ac916340bf938c6bf39050d78c49ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO HANDLE INDEXING INTO OTHER UV\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/texture.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeb191a153ed55a14b4935ee6f64798a8c078f57b35245ab4cc51ff6c1dd0f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#925 - Metal lowers a fence to a control barrier, so the leaf walk, whose fences sit in divergent"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/bvh.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c5c68b3cf8b9ba6071f817729be06e240bd8797f494499c243e24ec115aeba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#925 - an atomic carries a memory barrier that Metal lowers to a control barrier, so the atomics"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/bvh.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc1cc3eb433a5f052d1dd6ff7d4f2a3c2fab55df837be4c71583b39599109bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # .copy() FIXME: For some reason forcing copy is causing some tests to fails... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/mesh.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df9e2d73e4e81281e539b828695149e15df5e549bf146a8d9020da98e5b367b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Parsing PBR in obj or not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/mesh.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6f7607867f7621859af9e7253218ce06b71c032eb62937f9644afa5eca3451"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support vertex/face colors in luisa \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/mesh.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de4f50da9e39ea2ad0bc5c42ae9d538104e1dd79a68578cc93344a59055836f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#981 - Quadrants frees device memory without making its CUDA context current."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/scene.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"180e20cb2c43ae83bf5e39b320d1a6ea4126795aedf66043ad72f2902743ffd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Could be optimized to only clear cache associated the the environments being reset. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/scene.py"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc865ebf5597e746c47de0fe11a97c6e8d306d72cae17e063f3453510c45caf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: sets _next_particle = 0; not sure this is env isolation safe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/scene.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b3185f885d1e56aa7314bc90776190c5ee90fc9413ca7d9ac606b16df25787"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: a field is what a kernel taking the solver as a template can read, since Quadrants resolves no \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/base_solver.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"93463c7e20b2cb6542ea4174f285b6557ba2c0b957b201f7f0c9268123ea3a63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: constraints set after a saved state survive \u0027scene.reset\u0027 (see MPMParticleConstraints in mpm_solver.py) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b404a24295e699bfd14819d9ccbeb293d2244bc9542875599aceef9b4474b6f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#946 - a graph refuses ndarrays owning a gradient, so the loops of \u0027kernel_batch_solve\u0027 run"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e31ddef5b0faa96be75c663a5c2a1385e8f06ffa200d3d529d94a95da81224"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1083 - the statements before a graph do_while run again on every pass when the loop body"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6e6526adb67b1831e0954cf589fe906c0a6e0ab6502085740c72e5f4c21a48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1086 - fast math reassociates sums by code layout, so the kinematics recomputed here can"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3ceaddbd8f642f752087cafa0e5616eb715cace95295b0f914170aaef39bfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: \u0027scene.reset\u0027 restores the state alone, so constraints set after a saved state survive its restore. To revisit, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2775d1b9218a91cecd08ad4af4f02b51c55183cf64e1974fdfd602fe6721b61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: validate the J = det(F_tmp) shortcut composes with quadrants autograd before enabling it there. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/mpm_solver.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"760ebcc97fb4cd4cb446c6c2243ab61965030f2ac734036a17cd07deb294b11b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1036 - a func parameter accepts no subclass of its dataclass annotation, so the funcs shared by the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/particle_solver.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7778b05129e8557a233e5614c8aec0b631a221c18f6a7994af137e9e5bc600d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support per-particle density \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f864773c57ea9274435b7086179ba4491ba8932113fdb2c7fee6872e1a914d29"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1083 - the statements before a graph do_while run again on every pass when the loop body opens"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/sph_solver.py"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"235ac2d37d357d1d5261598d51301eee248f0cd046e9bcf75a88973a1d3f72b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#946 - a graph refuses the ndarrays that own a gradient, so a scene tracking gradients"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c78363247bdb9a2400c661b2b9efdb700c120302e1f68c3967a30b6812a31d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#946 - a graph refuses the ndarrays that own a gradient, so a scene tracking gradients"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2360a68bb97702db09eb28d68445f69b371e73c9f7e0e0a09a070ba2e58fb08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support batching \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"86747e803b97722732617690fffbae09b1ee2eee0dde365365c785cb68026631"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1086 - see \u0027KinematicSolver.set_state\u0027"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef630e24ca7a093e7f6bb2488a022f6b3067e8e44a4c48eb04b4538cda8ee233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: the anchor of an aligned root keeps its mass block diagonal (see _init_tree_fields). A center of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/rigid_solver.py"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"027e543776f13a41cd8ee54bc266e825bb31c63a18403baf013ea1209b651d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Allocate the lower triangle alone. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/data.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c460724cc2536a3fbaec9b9417e2654dec495bde97e1baed6a307d0d73557479"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants debug builds check a loop-invariant access before the loop runs, so the empty dof loop of a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/island.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ec93e2e2c7fcfeb5739c0f447a231ce3371fbfcc2856e28e6c2c2c2da68cf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove the MuJoCo compatibility gate once on MuJoCo 3.11, which carries this criterion natively \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/linesearch.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d64d7261a00c5360d0564416d683196f366e9816b0b54740bf53e67c21b74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: a good unittest and a better implementation from Quadrants for this kind of reduction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a745f1e6ee66ae2b60beb9da4148c96cdeabd0044a578535b44adc92bb40e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The reference engine anchors the tangent frame of a plane-capsule contact to the capsule axis, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef0b807d9bb8aacd4bc159a8a66830019b54aac0a026e30c0a135f72c17a551"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: sparse mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5eebbb88e5cf1746fda546bcc0cab569e02c9ae3afdf8bdfc08d0d27374968a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: sparse mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bdda760dc6d443e54f33a62665d9ce9dbe861c1b2a8ef3e093bae3085ac6f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The condition \u0060if dofs_info.frictionloss[I_d] \u003E EPS:\u0060 is not correctly evaluated on Apple Metal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"279cea44a8491f1e8e9569e141e09a281e846f3ed2a1c23f94f85367c60aa404"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove the MuJoCo compatibility gate once on MuJoCo 3.11, which carries this criterion natively. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5763}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abdfe5ba33b0b607dd88068268883b4327ff0f0c535e9277339aca3eab9c8ef"}},{"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":"genesis/engine/solvers/rigid/collider/box_contact.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee8e7a92aa87d1c79539509e97ad2ec88b3ba95b4949be7853d5187e534038"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Adjust these values based on the case study. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fcd9649d2adddcb03d40343b38f109efcd2a3229a603dc97e0755279598556"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Links should be considered adjacent if connected by only fixed joints. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cd003c7ca56b3ae92b7b14f684f4973872825ef5adb015e5f90d58025b7348"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: MPS gathers zeros through an expanded index reading a zero-copy view of the quadrants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9ae864d9716f09dadd90587f7d42e78900afb63bb68fa413b50e23f907d11e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Better implementation from Quadrants for this kind of reduction. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/contact.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30ebbf8bf501a358ea198db94f0bd202f962d542e4f927f8901ee81953b195d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Leave the arrays specific to MuJoCo compatibility unused when it is disabled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/data.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9753ab8ed6c6ddd3d81d2da39ae214589b3c1c504f7f8dcacf1bf716eb7e5d3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Calibrate these values on real scenes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/data.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33cba4f3a851c93c27e9c308419a4aaefe5d090b949a2ae5cf16f0a02b3925b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: When we use if statement here, it leads to a bug in some backends (e.g. x86 cpu). Need to investigate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/gjk.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca7bbb70d25a30c659e9c6b4985b05073ab5b353ec8b9c07477d74e4855719"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: On the Metal backend, reading a fixed-size vector at a run-time index inside a dynamic loop returns 0.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":"genesis/engine/solvers/rigid/collider/gjk_utils.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8e0483409b4c38149633c2bce30fdffd78368497482fdc7c0bf55c4464dd59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The search of the third portal vertex can cycle when the penetration is below CCD_EPS and a geometry\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/mpr.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"356e3981d8ecea60dcb221d79cd2654580f40e8567ea02a6948ce73131ba2368"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Ten vertices per face and 40 support queries raise the area spanned by the contacts on a 32-sided face from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dc1121985abcf6c257787ba312ebf236b21e268d2882d389d77c5b138766ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add support of smooth refinement to differentiable contact. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e4e796a4c388f0ba2472b2e3993890af629930cc2ffb6d7cf58bc1e9f1271b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#925 - every lane of the block issues the claim atomic, the other lanes adding 0,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/narrowphase.py"},"region":{"startLine":4045}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011309bde5fffbd4aa10cd9d2ef1240143354a20948ef84085db18ce251a8b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Diagonal coeffs of L are ignored in computations, so no need to update 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc79a2385793a9f7f6995db9019fe19cbb96affd581f85435c7f9a71e1e34d65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Diagonal coeffs of L are ignored in computations, so no need to update 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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"12476f2af0dab4c1d92487c046186c508045e460ce56776119e74e247623ad40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # autodiff silently drops their gradient. TODO: once every sub-stage reverses correctly under autodiff, drop these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/forward_kinematics.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf962dd582041665103cd28689558d3ade69e06278aa85e8c747ce77121a83d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: the line below does not work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/abd/misc.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d77a78667cda002a2a2f6cf5d94713d441f24a48bb9f662c6ee55a0d37d22e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: the frame cache keys on a single timestep for the whole batch, so a partial-env reset invalidates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/camera.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6ccf0fccabbb0f0133db15798773dcc720e1518d59b757ceb3aa41d1deab4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Resolution should be made private in mixin, so that it cannot be set by the user directly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/imu.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b55efda06c18418cd345340c90ff601d56eb22e4263168ea2ae8fa75a46382c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK hardcoded \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/hybrid_entity.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c151c134d8cce76d30d2c8e42f1938e9653a087264fd0a9fbc6982a4729a872b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need FEM and PBD \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/hybrid_entity.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e82e006433a9174d8822d393ea95a8b1f5649a53509edc63667276ee9ada073"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: hack to avoid \u0060ValueError: No backends available for boolean operations!\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/hybrid_entity.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf7406cb9d094120fd963c5d00ba3e561f0c520665d5c5e75161524117ea19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check if this is 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":"genesis/engine/entities/hybrid_entity.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"532b42ea1015e7095472b0a592a7a86f2d24568da7cc6c186562cf3582b1dbba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This pattern not ideal because the inertial mass may be unknown at this point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"4711b824b33ec9af9eadc2a4894ee34d7726575ff037b40bb36aa11978c73b68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Remove this branch after implementing \u0027get_verts\u0027. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc676c124a0f4da0b28984bf08958db1306addae9f6c40e9d3a04a606fd588e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Remove this branch after implementing \u0027get_verts\u0027. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/entities/rigid_entity/rigid_link.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f20726125e30ace63af717c175a2d571fc9d39e86dbe78c333579976f0c6b8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The added mass also slows down the transients of a light body. Compensating it with the force of the added \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"920fcdffcb9b05949b947a1dc69f3d107a53abc8b27b9a80c36534479a625f4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1100 - from_numpy holds as much memory as it uploads on a unified-memory GPU, so these"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25977c22a4ef6326dd8835f9717103470bc47148e41d10d1689251eae2e964e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: all collisions are on vertices instead of surface and edge \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a73692d914557157d9a46484e18d977bbfb05797a3c9e71d00b7fa77379f21a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1039 - the fastcache key misses what the qd.func methods of a handler and of its query read through"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"96118c7799aea13c3c615eb746558db8872e0f20e1f2084ca5375178c061103a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1040 - a tuple argument hides the ndarrays of its items, so every kernel takes one named parameter"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f942a1389039e40a77c10b323a622cdf5e5f9d96161f4500f86725cab3bfecea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1098 - the device-resident count launches every phase of the sort with a saturating grid,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2e0a898fffc01ad0d1a8a2402602caadb6c4fe1e4d3a13bc7900c2d855371a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1083 - statements before a nested graph do_while rerun on every pass when its body opens with bare"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"71426c745feed0c8e239f4c8eb0933724810abba851b3953124ecd5013063d9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: quadrants#1097 - the thread index is a raw expression until bound to a local, which costs"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":5210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d976c4361bb1696010dd667c0550558fd9404c0e7d7ae1736e474e472f12e9e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME This is an approximated value, different from Drake, which actually calculates the distance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":6566}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f86cb6799b7da1de157d832dcf6ca6f11fedfd75a6a6ac788b5859bd38a206"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The published hydroelastic model treats the rigid side as infinitely stiff (g = FEM gradient alone). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/sap_coupler.py"},"region":{"startLine":7095}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e9d1faef4c716f66805b598cd00bbb8c86afe586fc0c224160efffd0d314fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider deriving from Genesis joint properties instead of hardcoding. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"295bdfe9fdea6962e58ae4a991154836b4d4e5688532c338286a468d6174c529"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: \u0027Solver.set_gravity\u0027 is not honored either, and goes through: it writes a solver buffer the IPC world \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ad335432d341128afa67907b2c8ed5639253e5a633e96412efd3aa82797d35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: It is currently necessary to enforce zero velocity to avoid double time integration by Rigid solver \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d737c38d05a86f8928b30d05a8db567d32ed438274100abfdc95d3a2bd64ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Forcing rendering device is not working reliably on all machines \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/rigid/ddp_multi_gpu.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84e8df3b2c7dba43fde075df77abc76482f6300dfbed22fd74f6c0ddf66a10e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The grip closes on position because force control on the fingers behaves erratically 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":"examples/ipc/ipc_robot_cloth_teleop.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"918dbaf67aa0a49c21f3aa940fcd0dcbf31084b90d52bfa6fab5410ae0e94be9"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 148)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"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":"d90d30ef8de200d674d16c4e42c30ee5d5e07ee1a1c2c2dfa23bcfe67238629e"},"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":"d6ed58a5b5c3b65169f12b4c23aec635b96e8ad6c839160fa532362ff76cba34"},"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":"76f72b0423843bf1a6befca15907812c4e320539bdc94e1934d1b128fd1ad341"},"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":"f0f8b157ffa635b2a867c0f98396f32f42f3b6a31b1caf06e40899e78086cf7f"},"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":"6f9911d70621d0bd2ba2e9119445ba1d7720b5b5e008154d646873d8cc2c3f31"},"taxa":[{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3acf81c700f810ee6c2ac7f5c7de69006449e6836d8762289d37a71488a3c897"},"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":"0fc88134e85d2bba1af3e88e64815c88c05272f8afe84fb421b6bda0a690400a"},"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":"6f38ef6cf1690c4820cc7f43e5b414df17d16d75c36d7a0f68f3ad0ff0ad696b"},"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":"83f59d8170b46424cafd73202895713e90fcd2823cad7032018be2cdda870ede"},"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":"41ef3da52fd363f35d5c45b57d597c1cf7eb5d7e71878fc62d7520e782c02d10"},"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":"d989b2c97ad4f572bd4038c9fae509faf5ff11d1eaae9bc0e42e3b011302aa58"},"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":"4cc055e248a6e3f3f11769beea7274f76b19d7b6c40129fe5ca87184d3d3fbef"},"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":"4a35fb5798b7c44272cca62f232fe75935a6a60ad4a6715ee68e42fd9ed3b0ff"},"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":"1151c8080827ccea7beee3d77d92114f52280342dc90e9f83bb51c5701009792"},"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":"10801a260d9f21062acba972337b894b19c09ee35fb93438861b895f49072efb"},"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":"b4237eca797b3d8c42a7416e4aa04504f283ed8e66fde5e1db6c29438918895e"},"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":"ff867bbe15e7961596db123f419bb6da4359bdfcc76645c545d253ae3d7cadd7"},"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":"a65dda5d44f24122300284a58bd29aec0c28f84289c8b15dc6c1d5f3fb5a9660"},"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":"9351a92c6787e1612092abb1ff1c3909f9f6aefb1e98ba431ca8dffe42816ebe"},"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":"f7898283901777bb1a3ef5d3c013b9ff2819bf6fb290c6fdd70251d4ccfa2fec"},"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":"4ae6ac057fce16e467447c07e976030039c71288ca4a6ed48686ef99092c43fd"},"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":"4c854cbc6130ba4e07104bf70a0596348d0dff7c558733cac1b46b4bae50a5ee"},"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":"b61b75db317b8201375a5a3132ec8f7180a60d94d9743c169cb71e40b2479227"},"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":"d402faca53012f207f4f54f90378cbaa6aa0391cc20f1bbfa29a2692334abaee"},"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":"f8aa09d277cf3cbda5db0db42b5aad1d5014562a050b6c3e243c29e09a3dc463"},"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":"23554f25ad033c15895de07b58f3403ffafcebd6c17ed9b1b1c3e852ece7d973"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"230a1a90482d43db85dc7fc6a13ab9e8fedea5d44333feb887ae7eb2b733f6ca"},"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":"e1e2b1da3d93a554251b2f245e34abf2b21336b37019c90566027535935f614c"},"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":"cc3f396a49eb71927a5f999fd979d92dfa442768f190f1c88c9f226b9c208491"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"de35745b12b6bd2625e9b1640b387b97e7852ceecbb575f8ed3ebc42225791f4"},"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":"8fc175bda5ca5b545c47072cd875ded656debca2eac3554a6a7a41c8201c837d"},"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":"e272db4a4c4d5db34e85b33927b42f5e64c84192135ccfab951cbe4a48269f3f"},"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":"35b53e1d61c7752d74428f6616bcef88007c020d15917624753f18d27f9ce592"},"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":"675c3bdc9520bfd4b92d8a7f5c0db1b0e2bb3507d4a3bb69a87593a06f853076"},"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":"173de5223036e060077ab07bdbcd20c15bfc4cffd8eed852f2f1eb16b466f35d"},"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":"e70c4a911647a3e68ccce765594f0e72c8a73b1b45274f40e53786ec0e4b1988"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"dc81657294b333fe1bcc6d50d158aea5709743a6c6af81b82b7b25052d440834"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"9cc355a573ebc3155914231a44d8b725291f44c7439fd8ada192ed30073d2b19"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"cb004e464fc687cf54390146c8d76101b4b054c890dcbcf2646dc571f9788641"},"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":"0819308039f5ff4e73a73b385c3778177e6be6f0b559efa4f6c271bb504af8db"},"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":"4b536279ff99205bdd11650217f0f232ab452fc56447eb9e6f5e160061712103"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"1de7258e5b32b05e69a61eaa05d66f2181d29006afa49e33d4f3b88f397121f9"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"fc2c90cd0081c9c10cd541b9751e26d6b7f44cd81f3ea3c22e9f957211e0ec14"},"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":"29dfc5dc35b00ce95c7bc2d033d86f06e2fef635a0f5811dc8e5e9873c7cf01f"},"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":"66703a40103325057aea6c14de9587be064aa4ebcf842185f39e6618d0529076"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89ef25b5f94d33bf08a05aee9784f4279551f05de1624b3894a7ce6ed8dedb56"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e6d8b4dbed0c3eee1a03e10c2420a7f9afef5b4140e8222b3be83f6856995f1c"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf4bdfb49472900d9ae769d8b2c1e5a1f2926a5cc2e77bef942e51c83d42fd3b"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20cfc07099e9ce6bb433da65f2c7e83c16bb25a04b9545be78542dd0b2deca39"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65551ca1e9777ebe65c9fceedf8b589467e7891665e7e346dc5f42cc37edab02"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfd3c8ccf4907280de202e716f26014811d7ef989355bc9b1968a88f55585528"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5aed6a0429e51f32ed4c83053759c62bf92925171d7951099bf6049e6174227f"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00656a043b853dd8af65a30ee07a813eb7f4216fee15291c6020b752991036b8"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"706203a9cfb16468b0954d6e7ab535e5ed842eea96c2079b935f9b33964cc5b4"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"58767ef2b357572a67bf1d86f0a297f9a94504f711feec25fbb4841ea759af09"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"94bc8cef1d35defa0fb5302acf9c13bce609f198c083c73ec95dc02c4ce7c4fd"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb464fc5698cbb3e608a6762836f7fe78f767091507d769968ddd4f96f9ebd7f"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ac41998987a99ed1e0d1b6353672e1b01f812c10ea7a0531f06bd35178f2e32"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"f63eeddee8572add97ad35751ae2bce83f5246b78dbecd62cb02fe467edab2b0"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"407a5e151d1b4b101779bc8b6a94f583aa802cc056ef718e33370007ee691d86"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"f4eaefeb637ab0556c942d830a37b64f321492777c23172512eef11576d1abc5"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"db2961a28e929374cf1332bb87a969895dfca7770082e3c1cd15006e8510ea4b"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6450971baa8c1c0a8c580ef85d75dff29cdd0cc3af5682e63bc3964fe97c515a"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e2f87d16b5be7b500eeecd792c9491b8e49261e9b534bec02ba8ebc9d02d303"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5df86035de6473a8a712fd53c992da43018fb2acfdca24b3875d516dee15672e"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f15e6980ddadba31409b2cd3ba401ee2b57371d6bce2ad8cf1e9f2e5332acad7"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d738a3bb326a3e40568bfbf79b331840f7fdf3cb385dff439c3c636014cd9776"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92d1ce30447d86876e02adccc7e53603ba890030ae84d29f28872586992111ec"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2f0e183582b61fe5d59944b223123013a1f8104e66643d76ec423b638f50f9f"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"9666679efef2cac7178e485faff3ea38922f43dd5dc344633c4073bad6e7e46a"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"3ff2da953c0cd98a177e3a5a704585c73628b43fdf73dec594df61c11451374a"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"c707b3c657f9e51a16dd09c11daa65b96e8f66276b26c46fa17af3841ebe4068"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"9d39d439c4586e1c6ad906ffd2c670bdd7e3f6f8e9b62396463496c45f1a8750"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"c7af01967fd1302b587fda6d5c64cc352db643974212836dc7acd013ed52a25c"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e9a6289256dc69003a8b463971e36b6df4592556d014e3d7a702725e3a8b19e"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"124261c39e0e5507fec2496673abc8bd8f72244ced73f1edc385e02dda067bcf"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"3df8b722c5d2244ab758a5053634ce6f9a9b6c70c411155e8fc83925ddd73ccb"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"9752c8078c172186c9f39104e481c90cbae33a8e789d7e2cb7e0bc6e1de9aa39"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"genesis/ext/pyrender/material.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df0a7032ddafec4ef2f23d3493497a8fd599cd60faf9dc2bd864ff421628fee"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 14 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: genesis/ext/isaacgym/terrain_utils.py, genesis/engine/force_fields.py, genesis/ext/pyrender/light.py, genesis/ext/pyrender/texture.py, genesis/ext/pyrender/camera.py, genesis/ext/pyrender/font.py, genesis/ext/pyrender/trackball.py, genesis/ext/pyrender/node.py (and 6 more) (15 orphaned of 194 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; 194 of the 260 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":"genesis/ext/isaacgym/terrain_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4a503a7148c6347f2adc7d334cf36ae24b6343031532af25cd224591ec776b"}},{"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":"genesis/engine/force_fields.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7010fd01b817292f7c5c577d5b4f9382804427cd0cea559e01dd1f745ee41f05"}},{"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":"genesis/ext/pyrender/light.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0901ea24c07decda99a5b4beb4dde79c48bc33dc936355f05daa95e988e692b2"}},{"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":"genesis/ext/pyrender/texture.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d5846c70d1650d2c74609ad8671b931ebb2d3d52868295d92e344b63e618d"}},{"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":"genesis/ext/pyrender/camera.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814b95cc2386b7f9f678a63887a8a15d64b281dd4cd0f8644bc8b31d548133c"}},{"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":"genesis/ext/pyrender/font.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01085d366b568a4f7c8e70c0101ac40eefec9c5b7f701beb2233751a630ecd70"}},{"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":"genesis/ext/pyrender/trackball.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"574ba91d45804b9621158053883faf0c4336543c57df514f3a180c20131b0463"}},{"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":"genesis/ext/pyrender/node.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9f7cbf630b9925d9af7bce0b5d7560ef4fd4c2073cfd2d3306f6e06de24dd0"}},{"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":"genesis/ext/pyrender/constants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece0d50366c8e8cce807f16d636cefacb6afbc59ecb69efa6c645bcfd1916c1c"}},{"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":"genesis/ext/pyrender/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a13d01dd949e913700fbe3ebccf77bae73ca1f78a620e3ab831be7f95844eb"}},{"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":"genesis/ext/pyrender/overlay/types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3f726a818db3f120e8348eaec6ba859e410f88921f4aca91a4f96506bb6c2b"}},{"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":"genesis/ext/pyrender/overlay/style.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca149d4388d7e9d56e0da2268655ec1a8a97d300a8b4984fe94bc31a88e041d4"}},{"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":"genesis/utils/linalg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6440ebaa55ae1187cab5f8559b2514654143be1366ae3c5bb8008fc2b5d4e32a"}},{"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":"genesis/ext/pyrender/sampler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb813a3aabbe5d5cf95fd6d06d26139bb0a8fb20d576b2f85069da9eb7e4079"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: diff_gjk.py \u2194 rigid_solver.py: \u0060genesis/engine/solvers/rigid/collider/diff_gjk.py\u0060 and \u0060genesis/engine/solvers/rigid/rigid_solver.py\u0060 change together 50% of the time (6 of the 12 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 6 shared commits counted here, the most recent 3 are \u00605153f8cb\u0060 [BUG FIX] Fix invalid gradients in differentiable rigid-body simulati\u2026; \u006021dd9d54\u0060 [MISC] Remove \u0027_decomp\u0027 suffix from rigid engine modules. (#2249) (at that commit the file was still \u0060genesis/engine/solvers/rigid/diff_gjk.py\u0060); \u006017f4e4b9\u0060 [BUG FIX] Various minor bug fixes. (#2222) (at that commit the files were still \u0060genesis/engine/solvers/rigid/diff_gjk_decomp.py\u0060 and \u0060genesis/engine/solvers/rigid/rigid_solver_decomp.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c994bb5fea8314cb3fd849a456e6c9e3fd761c87afeb35d02c3c2bdb50b723f"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae720aff866ceba9a77e88060077d18ff285b03b4b012fd4bf821d68ee9ae3aa"},"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":"9b7727f43727579d6e84cebac72afbf60ef34b2f29c4bd3f518219f56686d3cd"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f2edb65ca5a2c2a1893d63d33bcc6356d3c8a6557aecac23a22b4e76ccef8c3"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74f08b03260ddbfe3a0595f96571aef4db439814e25cb558a04d91f814bd7448"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ac0483cf1123b122d8c38c3339c27303db0b2efef5cbc8ec01427569618472"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier_after_merging.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"62672de691aa148bc2532e1f3d42bda3fcac363f88b1b2bf4e1553d12002280e"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd817d79bd8e2b5bf97c4e6b02658e0ebdd5dd2f73895d51dbd752e338e3c91a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d742a1767e999ffffce455bf0aa975f48ec3bc2e197b166de722757ec3c03e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d09a782091b5c3cb03f264eef58c8fda8ad260b1ed03a12fbafe4ec460eb3d"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier_after_merging.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51e5437638f75d68931ad79a1ebc542885955a00a5dfc5db489c3354492cf73"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier_after_merging.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77456430d2546e9d34b20b1b1886d242f339436d44d3eef2f1f212412f87ecb7"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/assets/urdf/3763/tree_hier_after_merging.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6996dcdf4ae9445c57b58cf1c5f3e28155e5e9e5aef3cd4e20494bdddfdd5a20"}},{"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":"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 6 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/examples.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060pyproject.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cb10b4cecf1ff8954b4572fe00acd990e1e486a213ddb60c937a99b3b59c61"}},{"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(gjk_state.polytope.nfaces_map[i_b] == 0) or (i_f_nearest == -1)\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/collider/diff_gjk.py, genesis/engine/solvers/rigid/collider/epa.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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9713ba69ab38a285e0e47c35d78dd731ce03beee2b0a58345edc66fd00f66f07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraint_state.n_constraints[i_b] \u003E 0 and constraint_state.improved[i_b]\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/constraint/solver.py, genesis/engine/solvers/rigid/constraint/solver_breakdown.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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"92407a0fbffc7bd848e95766b5cd363346220339f88d80a7810123a748e9e400"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dyn_info.joints.type[I_j] == gs.JOINT_TYPE.REVOLUTE or dyn_info.joints.type[I_j] == gs.JOINT_TYPE.PRISMATIC\u0060 appears character-identically in 3 files \u2014 genesis/engine/solvers/rigid/abd/inverse_kinematics.py, genesis/engine/solvers/rigid/constraint/backward.py, genesis/engine/solvers/rigid/constraint/solver.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":"genesis/engine/solvers/rigid/abd/inverse_kinematics.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f4b41978144aeab308593614d0a8d05f61e7da78e7807a65da360abdcf38c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dyn_info.links.parent_idx[I_l] == -1 and dyn_info.links.is_fixed[I_l]\u0060 appears character-identically in 3 files \u2014 genesis/engine/solvers/rigid/abd/accessor.py, genesis/engine/solvers/rigid/abd/inverse_kinematics.py, genesis/engine/solvers/rigid/abd/misc.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":"genesis/engine/solvers/rigid/abd/accessor.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f0e825b0efe6a90109b98344c49871945d4f1a9ef7ee146cdaf014ea31d93d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dyn_info.links.root_idx[I_l] == i_l_root and func_is_awake_link(i_l, i_b, dyn_state, rigid_config)\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/abd/forward_dynamics.py, genesis/engine/solvers/rigid/abd/forward_kinematics.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":"genesis/engine/solvers/rigid/abd/forward_dynamics.py"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2771cbb8743d0b3d1c1b8f8ae40d5daca7b7baed78a28934f0b3e017869309"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060g_info.get(\u0022contype\u0022) or g_info.get(\u0022conaffinity\u0022)\u0060 appears character-identically in 2 files \u2014 genesis/utils/usd/usd_collision.py, genesis/utils/usd/usd_rigid_entity.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":"genesis/utils/usd/usd_collision.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2bc3c3eaae3471076df4b4c9f2045703b06cb9fa48a4fbcaa913b62fbeb8b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060g_info[\u0022contype\u0022] or g_info[\u0022conaffinity\u0022]\u0060 appears character-identically in 2 files \u2014 genesis/engine/entities/rigid_entity/description.py, genesis/utils/mjcf.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":"genesis/engine/entities/rigid_entity/description.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05f857d1d7fc139be1ef492b2c8aeb93f3721813d0c2042b88b4f28480caac4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060geom_type == gs.GEOM_TYPE.SPHERE or geom_type == gs.GEOM_TYPE.CAPSULE\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/collider/diff_gjk.py, genesis/engine/solvers/rigid/collider/gjk.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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"abff76a9775a97109a864db9b1e1842a3d35775727adf38cc455a6bb76b9147a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gjk_state.polytope_verts.id1[i, i_b] == gjk_state.polytope_verts.id1[wi, i_b] and gjk_state.polytope_verts.id2[i, i_b] == gjk_state.polytope\u2026\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/collider/diff_gjk.py, genesis/engine/solvers/rigid/collider/epa.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":"genesis/engine/solvers/rigid/collider/diff_gjk.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc16d9132bde06aeb6c2c94e84d2e211740537fd88420d635bf82e63c6c48f57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gs.backend == gs.cpu and gs.use_zerocopy.is_supported\u0060 appears character-identically in 2 files \u2014 genesis/engine/simulator.py, genesis/engine/solvers/base_solver.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":"genesis/engine/simulator.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e028d285b65feabf9b2fd9094d8346a799847e314f02c5f2cfa38a62e7f8a291"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gs.use_zerocopy and gs.backend == gs.metal\u0060 appears character-identically in 3 files \u2014 genesis/engine/solvers/fem_solver.py, genesis/engine/solvers/mpm_solver.py, genesis/engine/solvers/particle_solver.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":"genesis/engine/solvers/fem_solver.py"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23753a25ff06295fd64c0bb1b0cb8615cfe6454abebddcfcba875a6d2e199c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gs.use_zerocopy.is_supported and gs.backend == gs.metal\u0060 appears character-identically in 5 files \u2014 genesis/engine/couplers/legacy_coupler.py, genesis/engine/couplers/rigid_mpm_hybrid.py, genesis/engine/simulator.py, genesis/engine/solvers/base_solver.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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2d8a4c309395d2ba0a0df4f14eb3535cd5a2e8bbaff2153d33fe5be04ea960"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(envs_idx, torch.Tensor) and envs_idx.dtype == torch.bool\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/collider/collider.py, genesis/engine/solvers/rigid/constraint/solver.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":"genesis/engine/solvers/rigid/collider/collider.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c8ba3f27030b5cfe85ca43b287a4f264cfb9e00cbcf2bf47a524eecdf49f9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(mesh.visual, trimesh.visual.texture.TextureVisuals) and mesh.visual.uv is not None\u0060 appears character-identically in 2 files \u2014 genesis/engine/mesh.py, genesis/ext/pyrender/mesh.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":"genesis/engine/mesh.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafc1cce1d9dca8732f0af5eb18bb5849b5e96bce6be605b03fa042dbe6ac022"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060link.is_fixed and not entity._batch_fixed_verts\u0060 appears character-identically in 2 files \u2014 genesis/engine/entities/rigid_entity/rigid_entity.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/entities/rigid_entity/rigid_entity.py"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"909464b69ad0670451a090af9677b9d8334228143780e42ee2afda1697b281e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mask and isinstance(mask[0], torch.Tensor)\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/kinematic_solver.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4f3d7165b34f2c03a4f88f428d29e548a8b0d0e312e89cb7d3a510544ad188"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mpm_config.is_deterministic and not is_backward\u0060 appears character-identically in 3 files \u2014 genesis/engine/couplers/legacy_coupler.py, genesis/engine/couplers/rigid_mpm_hybrid.py, genesis/engine/solvers/mpm_solver.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":"genesis/engine/couplers/legacy_coupler.py"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfccfc44da1cb2ebfe5b6e9c9f3a874a4dc9111947dbb3344fdb66d9f5dd695d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.mesh is None or len(node.mesh.primitives) != 1\u0060 appears character-identically in 2 files \u2014 genesis/ext/pyrender/jit_render.py, genesis/ext/pyrender/scene.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":"genesis/ext/pyrender/jit_render.py"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4a9ed006a00f8cd2d00771c8affc7e2535b6c496352795efbe65fd9f0fca0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not force_render and self._t \u003E= self.scene.sim.cur_step_global\u0060 appears character-identically in 3 files \u2014 genesis/vis/rasterizer_context.py, genesis/vis/raytracer.py, genesis/vis/visualizer.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":"genesis/vis/rasterizer_context.py"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2504d3c60f0b688d5cd05210cc3a048b9097454726daf1fa724f8633b3286d7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self._options.batch_dofs_info and envs_idx is not None\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/kinematic_solver.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f767a5f28b269043edab00a8cf3e23217fa69f077e789d230ddb13e6a1ff03b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative and not self._links_offset_pos_is_identity[idx].all()\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/kinematic_solver.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8358d2c17a36274ce2ccc38d4a297d1d16ed66695c7cf0c40ffa0f64a2cdcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative and self._links_offset_pos_is_identity[idx].all()\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/kinematic_solver.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5d75738c37544cba83cb4ab83b0d03af9ada952c8b7740466f8f721fa6531d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rigid_config.para_level \u003C gs.PARA_LEVEL.ALL and rigid_config.backend != gs.metal\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/constraint/backward.py, genesis/engine/solvers/rigid/constraint/solver.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":"genesis/engine/solvers/rigid/constraint/backward.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed61695bb9e36d9db12bc5fc80a47a10a23e3aaef73b9e9a42c5a5bde587d9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rigid_config.solver_type == gs.constraint_solver.Newton and not rigid_config.enable_elliptic_friction\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/constraint/solver.py, genesis/engine/solvers/rigid/constraint/solver_breakdown.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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5278}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e5f2d6f60693627069df6fe6cf125b4992b78a5618e2dc0684572c6f300354"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rigid_config.solver_type == gs.constraint_solver.Newton and not rigid_config.has_per_env_solve_seed\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/constraint/solver.py, genesis/engine/solvers/rigid/constraint/solver_breakdown.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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5738}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a621aa2ebace0fa9fbfbe669aca69ecba194fe67302c538a20653c87899bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rigid_config.solver_type == gs.constraint_solver.Newton and rigid_config.enable_elliptic_friction\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/rigid/constraint/solver.py, genesis/engine/solvers/rigid/constraint/solver_breakdown.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":"genesis/engine/solvers/rigid/constraint/solver.py"},"region":{"startLine":5197}}}],"partialFingerprints":{"codehealthFindingId/v1":"776ac02c28b9f84544dba87e08ecdfbcf18ee594af4cd062e8f528d973e93e00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._links_offset_quat_is_identity[idx].all() and self._links_offset_pos_is_identity[idx].all()\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/kinematic_solver.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d3b78dd3ac749b8e510e29ed73501c3dca427d9b8d154b0bb8a2bb087c1b52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._options.is_crosstalk_enabled and self._use_grid_crosstalk\u0060 appears character-identically in 2 files \u2014 genesis/engine/sensors/kinematic_tactile.py, genesis/engine/sensors/point_cloud_tactile.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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615dcb1c38e3da7473b67ecbeb6410231626e63d244ba70da7daba5863d616b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_fixed and not self._entity._batch_fixed_verts\u0060 appears character-identically in 2 files \u2014 genesis/engine/entities/rigid_entity/rigid_geom.py, genesis/engine/entities/rigid_entity/rigid_link.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":"genesis/engine/entities/rigid_entity/rigid_geom.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"54061ec7cbeaafa1f42839b6f6798cee3dc162fb06682b2ef7e8cb1a09dfc1d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.n_envs == 0 and self._options.batch_dofs_info\u0060 appears character-identically in 2 files \u2014 genesis/engine/solvers/kinematic_solver.py, genesis/engine/solvers/rigid/rigid_solver.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":"genesis/engine/solvers/kinematic_solver.py"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346b2063a8cfd8b8ea085e24054e38b3796fdb73e5cc537bf490f37543262c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shared_metadata.contact_depth_query or \u0022sdf\u0022\u0060 appears character-identically in 2 files \u2014 genesis/engine/sensors/kinematic_tactile.py, genesis/engine/sensors/point_cloud_tactile.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":"genesis/engine/sensors/kinematic_tactile.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168459f2506b384f2f5d5068f3dc3b4053663e32b4d89dda1b424b4f3a5712f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is not None and not isinstance(value, Mesh)\u0060 appears character-identically in 2 files \u2014 genesis/ext/pyrender/node.py, genesis/ext/urdfpy/urdf.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":"genesis/ext/pyrender/node.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dbf68b4a89ddf29f86f5145c73e000c90810471f40dfddc371381853188f31"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_written_paths\u0060 is public and takes \u0060owner: object | None\u0060 from its caller, and it calls itself at line 115 (\u0060get_written_paths\u0060) with a piece of \u0060owner\u0060 \u2014 and nowhere in \u0060get_written_paths\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060get_written_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/grad/kernel_writes.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ff364761ffaad580af18db6bf719f6e2f44a2b96722528ce5905d537cba49e"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060init_context\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060DISPLAY\u0060 environment variable (set at line 227, put back at line 231) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception raised in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, \u0060subprocess\u0060 launch, \u0060os.environ\u0060 read or \u0060print\u0060 in ANY module sees it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory, the environment, the umask and \u0060sys.stdout\u0060 are per-process, not per-thread, so a concurrent thread sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd=\u0060 and \u0060env=\u0060 arguments of \u0060subprocess.run\u0060/\u0060Popen\u0060 scope both to the CHILD, absolute paths built with \u0060os.path.join\u0060 or \u0060pathlib\u0060 need no working directory, and a stream handed to the code that writes needs no \u0060sys.stdout\u0060. Where the global genuinely must move, \u0060contextlib.chdir\u0060 (3.11\u002B), \u0060contextlib.redirect_stdout\u0060 or a \u0060try\u0060/\u0060finally\u0060 makes the restore run on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/platforms/egl.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b264fd55f6df2a90543742406bf9e2f863499cf504686bfd74af28d0905cccf"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 155 is called with an argument built by \u0060\u0022\u2026\u0022.join(traceback.format())\u0060 (line 155), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/viewer.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902c5ba57536dd22e7877511f710d445148812c6be3eab0edda3af7d46b9639"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 404 is called with an argument built by \u0060\u0022\u2026\u0022.join(commands)\u0060 (line 404), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_context.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b4208593dd4a889fb20f1cea18de04892f32678cdeac328d27c73cc9684867"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 491 is called with an argument built by \u0060set(self._coup_type_by_entity.values())\u0060 (line 491), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd96e927387ca18defc27bb6b6ae55af4f82f846e6b7b82b148b275ffb508fa8"}},{"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":"genesis/repr_base.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe08dab187a50d86c0fab13e88d343e096b3183fcc7236e85d306421120a3bf2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/vis/viewer.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca564c8ed11a7092ab4aa168a322fa49561ce7a6ffaac9ad8bbdcd5f8c90b0f"}},{"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":"genesis/utils/misc.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f3d8b18103fc2520f92b945c517572033c543ed815cb178f0159a6dee8105d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"adda6454e5acfd6cf2cafe444641aadae506566f760c91e53ee5a876daba8353"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2779f3a19f57cd6105d421544c46ea051e12827243f30f4b1d7e1390d5885fc2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/_trimesh_patch.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac467c2576614a4c2f45b38afb0e0ba494199d8e383205d884162c7c0e9e2bea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/offscreen.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"affaf522e0cbd5b7b140a2e2ea234f093d6ae2c77ef9daca7f9c0823f26356c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/offscreen.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b01601618022d04c919a75de0d4d908fd93735a2e3a57900a08f9d7ac5e519"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f53096f5bbe5f82d543f2dff06dfc5dd402714f93eaf874d87adeaab87aa49e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30e2f1f117b31090559e5c7bae6ab030fb0ec89147a22c7241162550f6ff54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a884c7dae7595fe3354b21fb43a3b851129dd87dd8a00d69dd9861b28b16a6fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9f5957ba446bf65052d2301abd309338aa0f11e12b44159b5b0fd1918faa57"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fbe5e51917f588e29180218f63e103cd3ed3df7a61bbd11018ed15db3c0f60"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b6fb8635e0034f4c1cc9f3f00285166129f15b12fb7f412632fb4f179fdf18"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"63340f6217d164da9c09e757b10808c2de7025cc3625d6bd84724a3f3e9d1428"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/viewer.py"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfda9fe0a5c296e2dc6894ffbe6975d4aea4c45f328ffc4dea37de65790aeecc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/platforms/base.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94a9ac450f8425c3af86d9e2d5dfaa5f9ba416d5aa894b9630daa3936e7399c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/platforms/pyglet_platform.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4b6796cd0c4b40dbe00e68e136642a66b28f0f55a022411ed6f9f677d685ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/platforms/pyglet_platform.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c6a9a4d9e34090b38c1475ad66c43241433b7386831796ee2d3d39ec5fb95e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/platforms/pyglet_platform.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98a17b875a6e73b37b8f350ce1a66a39051228a7783ca6c3ce050fa1d3c633b"}},{"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":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"81204e757c473c13bfa0c3e3a39a6838c5f83a42fd92de486a571d81714e58eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d418ba9b86d2a03cce798261fe4589e1b4df9bfb655831012f4f3c4dd1b39108"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/sensors/base_sensor.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"76441cb4ca42f52590a2058a507604c03af153b60cdf71a30c8d261b589a7e50"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 104 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":"genesis/__init__.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f923593a47269b65383cbea93eadb169b6ffdb09b95bda572a14f5481c2dea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 457 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.error(\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.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/__init__.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef08bd301c4578b41ef2d4789ce4b80c21c8549df47f771cc2aa661a15c85c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 121 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":"genesis/utils/misc.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4b12aa4f3816ef6bf094982c76cdf8d7e64f7c09161d1f51d36773662364cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 180 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/video_encoder.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37f6c43b0453ed44a2e7f93e7657cdf3fb7d0a199fe801bfc2bc2ed16f43ee7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 58 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"347ef03108e9d2ff9936e2cd03010c5cdc65c99686eea9cf1262a77c8b292325"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 60 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1694bee717d97f32554ffa3c754e7e6d1f362b44c648f3ca5d295eb7192cd626"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 147 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c99da69a79f28a273af2f1bf9f4cfa0b19f207ab69553846cc6323f6eb846e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 316 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bae5b25a775baf16049c43f440d546c80a7efd2f2c796c25cad308968dfe5b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 404 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/utils/usd/usd_context.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978d2c89d9f52b7f2db45e4625ac3e312885373a13dbdd67466e3d167d55e5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 418 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c32a6ff5dd9019bfdaf168311998846eee9a67b04635c3307bc93065e5cf36"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 425 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3613c0fbf490e1e4a159e8c4356b0f1d272805bc6be4e1edd9cc23057a5794ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 436 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ea989bd5674a2476366f440e1fdc44baaa21fc96820e83c6352024ecdb51f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 475 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":"genesis/utils/usd/usd_context.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fb1313ad291781323265a4b423d557063f3e2d8e80fc1d35fe1cec26fef31c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 81 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":"genesis/recorders/file_writers.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b51fbddb8deebb98767b5fa66162a133c9f2a2673c53fd538a55aff1e71df13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 192 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":"genesis/recorders/plotters.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"efde33e00f7fd9623f2054c1ecdf1d1548744ec6ffb1275a55a56e2a5321dee2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 260 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":"genesis/recorders/plotters.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b1018c4fb1b671e6ffc663c12b87850feb1a2c6a8d7461ca9aec5b1a6a9c63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 420 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":"genesis/recorders/plotters.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a715d0f5c98aa98f807e7d12991ef5820ad44ffe23281dbd661909d7679fec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 539 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":"genesis/recorders/trajectory.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb24650859393eb6bcb904bcd8ed05b4dbca6c90900eb2ad7053ebdd9a155a88"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 316 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cebe2e5721c2c1cc90f775119a6c1ec0672cf4f24b2e70c72c4ebfb38e65eee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 328 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3a1a4993daaa14f9018e2564ceeea9ae872aef7f0d04d94edfea48e9d506bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 334 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e89faa55289e9c59967066d770c143a041bfc6c87510f5ca4b2d4fddac046f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 341 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4995c2218170895e384d9b38fc279a3b964aa385373e3ae970b3541309bdd7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 491 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15d9ba255c6edb8acadb9eaca9a906c27ff637c45b1529b7f385993e1012abb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 518 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb32ebb6e4130418975ab75a78fdc68898c24555604287124290d41bed6800b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 686 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41243613d45a7c41187b79976678092ca360c2afa0fc9068d0d6acb151d8618"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 768 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"0145f7e1f2512742d8fbd915b371625a851da102a0802d39aa951b68849f68ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 874 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.debug(\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.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"4358f2d61a712c183d74e57e487fd24c0ee5e8281828bd2032fac1a70b8a89a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 887 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":"genesis/engine/couplers/ipc_coupler/coupler.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"335d90ad57e50746cc0c7dc87c41321c14f88768bfcae761deedc79552548a8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 293 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":"genesis/assets/tower/generate_tower.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d453e95f43da24776d04db587eaf791d6d84cc45541ca96ae51a7b49c4c986"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 320 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":"genesis/assets/tower/generate_tower.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5055fd8dfd656ca30e8608018bed0d7238b7b011999cce9394db24cd76adff8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 402 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":"genesis/assets/tower/generate_tower.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbae7613c86b45b319ed7d200834ea8db3d36589b4986164dedc6deba791cb8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_get_clipboard\u0060 (in \u0060_init_imgui\u0060) swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genesis/ext/pyrender/overlay/plugin.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c16f183195ab1f2e22f761215edd2cf13c69cef569116d0ffa33ef6c4c36b0"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.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-913","guid":"062167e8-5db3-0857-a865-a1fc4aad34bc","name":"CWE-913","shortDescription":{"text":"CWE-913"},"helpUri":"https://cwe.mitre.org/data/definitions/913.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":88,"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."]}]}